$ /nix/store/rry6qingvsrqmc7ll7jgaqpybcbdgf5v-coreutils-9.7/bin/timeout --kill-after=15s 1800s /nix/store/mycbwkcm1jzjgsaiydvzib9phmzfz9vx-nix-2.31.1/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --extra-substituters https://sellout.cachix.org --extra-trusted-public-keys sellout.cachix.org-1:v37cTpWBEycnYxSPAgSQ57Wiqd3wjljni2aC0Xry1DE= --netrc-file /tmp/nix-ci-worker-59ea53193c19185d/cachix-c39c888fe4bf9274/netrc --extra-substituters https://cache.nix-ci.com --extra-trusted-public-keys nix-ci-staging:Q5+aawDG0LPCgu1fP9e+9hktvsfSyvu/Xe5PvzTLRVs= --netrc-file /tmp/nix-ci-worker-59ea53193c19185d/nix-ci-cache-1a76fa1a15a1b5dc/netrc --extra-substituters ssh-ng://worker.nix-ci.com?ssh-key=/tmp/nix-ci-worker-59ea53193c19185d/ssh-key-c06f5952a468b0c6/ssh.key&remote-store=/cache/nix-ci/&base64-ssh-public-host-key=c3NoLWVkMjU1MTkgQUFBQUMzTnphQzFsWkRJMU5URTVBQUFBSU9EQXdicHlRaVYwb2lyakhxbHIwbitnWDNNVjQwbDBKTmlKdVNDZHdoZ1o= --extra-trusted-public-keys nix-ci-staging:Q5+aawDG0LPCgu1fP9e+9hktvsfSyvu/Xe5PvzTLRVs= --print-build-logs build --no-link git+https://x-access-token:<REDACTED:GITHUB_ACCESS_TOKEN>@github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=86e5cce6ed1d4413db707a535c16e7239b9cfaf0#devShells.x86_64-linux.ghc9121 --post-build-hook /tmp/nix-ci-worker-59ea53193c19185d/nix-ci-cache-upload.sh
warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'extra-substituters'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'sandbox'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'use-registries'.
Pass '--accept-flake-config' to trust it
unpacking 'github:sellout/flaky-haskell/20fea137b8249fb1eae71e37d2b3c8c9619e5fc4?narHash=sha256-mznOWfqmZrQxbhHDoj6qTBv3WjfuETiWfiwP%2B83/gd4%3D' into the Git cache...
copying path '/nix/store/01x5k4nlxcpyd85nnr0b9gm89rm8ff4x-source' from 'ssh-ng://worker.nix-ci.com'...
unpacking 'github:nix-systems/default/da67096a3b9bf56a91d16901293e51ba5b49a27e?narHash=sha256-Vy1rq5AaRuLzOxct8nz4T6wlgyUR7zLU309k9mBC768%3D' into the Git cache...
unpacking 'github:sellout/nix-systems/aa9520a9a0f92098d3576c3b4eafcb32c13d6800?narHash=sha256-vta8mxLa5XxpHfb9HCiavFqBrX2xJDvZiKHZOy4kvlA%3D' into the Git cache...
copying path '/nix/store/racjf4xbmqyqb4dfs45kx5iq45i4gx33-source' from 'https://cache.nixos.org'...
copying path '/nix/store/8x6kla3kk5zh56nx6ph6drsqhmg7jzr3-source' from 'https://cache.nix-ci.com'...
unpacking 'github:sellout/project-manager/515764cb0bf3dc7a8e3bf61205297970c14423cf?narHash=sha256-/zX6sW11ZcAo2A2epKXETkW0FBzMuDdTNZF1ktObap0%3D' into the Git cache...
copying path '/nix/store/fwaz9xpyai6xsq1jiymav7kbrcw0gvij-source' from 'https://cache.nix-ci.com'...
unpacking 'github:numtide/treefmt-nix/f56b1934f5f8fcab8deb5d38d42fd692632b47c2?narHash=sha256-ZRVs8UqikBa4Ki3X4KCnMBtBW0ux1DaT35tgsnB1jM4%3D' into the Git cache...
unpacking 'github:Fuuzetsu/shellcheck-nix-attributes/51b49d5fe65ece69eb5e2003396bf096083ec281?narHash=sha256-a0WyWaz%2BnMYFWI43Ip9EUnPuBW0O4EIiTzYZKGqNjss%3D' into the Git cache...
copying path '/nix/store/b9h8bzb06wvswg4cq5ryyapa7d7h5n6f-glibc-locales-2.40-66' from 'https://cache.nixos.org'...
copying path '/nix/store/567g7rq7gq2wfwn3x22sar72mjyghjbd-distribution-nixpkgs-1.7.1.1-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rwyj9q50lxgg2krci51hr7afiql2p8km-gnu-config-2024-01-01' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d84l3qjb077dxkajn24k58z2q261d4lv-gcc-14.3.0-libgcc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d5s1ab9ynjsh45js7d75ijxklzqm49r0-libunistring-1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0sswrc6460s15941xrys8pbm07830zx3-publicsuffix-list-0-unstable-2025-03-12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f244pq7qm9ga22jpa4l0vca2ys4q7wh7-update-autotools-gnu-config-scripts-hook' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vi5fmmv0q0z9rjf3jfis7q2i9g05l8s2-libidn2-2.3.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i3ibgfskl99qd8rslafbpaa1dmxdzh1z-glibc-2.40-66' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s1rbzc4mmfhwlhafha52c8frsrfkrx37-attr-2.5.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l9k32vj2aczxw62134j1x0dsh569jz2l-bash-5.2p37' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s3mkvm3f20pd1vfx109w89jcc0mdcx2a-bzip2-1.0.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9c65bhkvvcsahkzp38ir5gqprp4y44lx-brotli-1.1.0-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/36qzlljldgb41snr4l38pfpcy19w7s2j-ed-1.21.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qvgw9scl3jjy1zsjipm3ngpcq472wj7w-gawk-5.3.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cf1a53iqg6ncnygl698c4v0l8qam5a2q-gcc-14.3.0-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qwsij6q9za18jyfxb3rj1np3gwvmifg3-json-c-0.18' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1v6ry0zx6igrskzd8arw76glqgsi61is-keyutils-1.6.3-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m0i5hf36sv62vgm2ppjkynv03ihdlxvv-gnused-4.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xpsgmdsqym0ydx6hkvpxrp6174s4fwbl-gnumake-4.4.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6dh413ivs6gyzy0s93209jy7cgc40ysx-libpsl-0.21.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qsaszbis1va1b5rvl1fprydx0zad37h2-nghttp2-1.65.0-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2fxp204b9jh1s3lpggdlnws44vvzw1w9-openssl-3.4.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n6vl6ni6zxxgh4163cqnjf8p0n7yah0d-pcre2-10.44' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6ab07lf8v6zjcjr8ysxcsf13kn8593vb-xz-5.8.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/59pgpbm743q1nhav513283zinqrf4rqk-bzip2-1.0.8-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f2q5ld1nipl8w1r2w8m6azhlm2varqgb-zlib-1.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jangxddrzycnc2rl1wc1sqhqp26yrx4k-patch-2.7.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/90r466lzg0jw11v60cki60s0qfhs93vp-gnugrep-3.11' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4zpfjm2r6chc8b10c1xa1d6asy100sqv-file-5.45' from 'https://cache.nix-ci.com'...
copying path '/nix/store/44c243x0jpv587hmxrzl31pripa0f0j8-gzip-1.14' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5cdzaagddbzip0rd0f9bfkfnq143bxd8-krb5-1.21.3-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wi9cp03qqfw49v3j7fzz44k9kqfm7i9i-libssh2-1.11.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lm0g29ps43q8bm2gsd26g5pi2zwb6i8d-gmp-with-cxx-6.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5wf9wpdkxs30811kfgkicn9i3nz9jhsh-patchelf-0.15.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2m97xlq3lpfawmvnp9ii2kk1j0yfzy6q-zstd-1.5.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bylmxi0aa2v3jz2q7zkdpa49nmpyrkgq-acl-2.3.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zwplch93wbpj82bp7riwaixmdx2xi0ah-coreutils-9.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nshhjm3s9pwc86s5hyzqf22pn8kikw8j-curl-8.14.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b7g83isqdl778kmcpv6v68z76x4x5riv-xz-5.8.1-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z059fc40f58cp2yflhbpfdg539x66b0g-diffutils-3.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c9jzm47zb8j7jbpw4a7zdm35qmhdf6ws-findutils-4.10.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hskznnxf50mn9v95j7c2d2flngcj34g2-cabal2nix-2.20.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9v92708qmblip01dc60vnilzbcii5zad-stdenv-linux' from 'https://cache.nixos.org'...
building '/nix/store/6k8xk3d1p3s1v9qr4cs3cn4fz9gjfzk8-cabal2nix-algebraic-graph-duoids.drv'...
cabal2nix-algebraic-graph-duoids (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/bhr71nj06zpi281wazlwpz3qigffvfqy-cabal2nix-algebraic-graph-duoids
cabal2nix-algebraic-graph-duoids (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-algebraic-graph-duoids (post)> added 2 signatures
cabal2nix-algebraic-graph-duoids (post)> added 1689 signatures
cabal2nix-algebraic-graph-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/bhr71nj06zpi281wazlwpz3qigffvfqy-cabal2nix-algebraic-graph-duoids
cabal2nix-algebraic-graph-duoids (post)> copying 1 paths...
cabal2nix-algebraic-graph-duoids (post)> copying path '/nix/store/bhr71nj06zpi281wazlwpz3qigffvfqy-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...
cabal2nix-algebraic-graph-duoids (post)> copying 0 paths...
cabal2nix-algebraic-graph-duoids (post)> added 0 signatures
cabal2nix-algebraic-graph-duoids (post)> added 0 signatures
cabal2nix-algebraic-graph-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/bhr71nj06zpi281wazlwpz3qigffvfqy-cabal2nix-algebraic-graph-duoids
cabal2nix-algebraic-graph-duoids (post)> copying 0 paths...
cabal2nix-algebraic-graph-duoids (post)> copying 0 paths...
building '/nix/store/xi7myqsds70zxx7rr6p8rr0a7jmh7pmj-cabal2nix-duoidal-transformers.drv'...
cabal2nix-duoidal-transformers (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/wq5nndh41ivbk6zfgkkq1vbgapxdlqd9-cabal2nix-duoidal-transformers
cabal2nix-duoidal-transformers (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-duoidal-transformers (post)> added 1 signatures
cabal2nix-duoidal-transformers (post)> added 1 signatures
cabal2nix-duoidal-transformers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/wq5nndh41ivbk6zfgkkq1vbgapxdlqd9-cabal2nix-duoidal-transformers
cabal2nix-duoidal-transformers (post)> copying 1 paths...
cabal2nix-duoidal-transformers (post)> copying path '/nix/store/wq5nndh41ivbk6zfgkkq1vbgapxdlqd9-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...
cabal2nix-duoidal-transformers (post)> copying 0 paths...
cabal2nix-duoidal-transformers (post)> added 0 signatures
cabal2nix-duoidal-transformers (post)> added 0 signatures
cabal2nix-duoidal-transformers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/wq5nndh41ivbk6zfgkkq1vbgapxdlqd9-cabal2nix-duoidal-transformers
cabal2nix-duoidal-transformers (post)> copying 0 paths...
cabal2nix-duoidal-transformers (post)> copying 0 paths...
building '/nix/store/kgi9whs2xxa5qygk92zv9m27jkb7csgd-cabal2nix-duoids.drv'...
cabal2nix-duoids (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/g03s28cwaya26b6xrwn94y9hi38f5wb7-cabal2nix-duoids
cabal2nix-duoids (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-duoids (post)> added 1 signatures
cabal2nix-duoids (post)> added 1 signatures
cabal2nix-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/g03s28cwaya26b6xrwn94y9hi38f5wb7-cabal2nix-duoids
cabal2nix-duoids (post)> copying 1 paths...
cabal2nix-duoids (post)> copying path '/nix/store/g03s28cwaya26b6xrwn94y9hi38f5wb7-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
cabal2nix-duoids (post)> copying 0 paths...
cabal2nix-duoids (post)> added 0 signatures
cabal2nix-duoids (post)> added 0 signatures
cabal2nix-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/g03s28cwaya26b6xrwn94y9hi38f5wb7-cabal2nix-duoids
cabal2nix-duoids (post)> copying 0 paths...
cabal2nix-duoids (post)> copying 0 paths...
building '/nix/store/5avj19qi2shmicdwa0mxhs7sjrids7a1-cabal2nix-duoids-hedgehog.drv'...
cabal2nix-duoids-hedgehog (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/fpqa1b7mfwqqbprdmml145blp4rfa2a4-cabal2nix-duoids-hedgehog
cabal2nix-duoids-hedgehog (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-duoids-hedgehog (post)> added 1 signatures
cabal2nix-duoids-hedgehog (post)> added 1 signatures
cabal2nix-duoids-hedgehog (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/fpqa1b7mfwqqbprdmml145blp4rfa2a4-cabal2nix-duoids-hedgehog
cabal2nix-duoids-hedgehog (post)> copying 1 paths...
cabal2nix-duoids-hedgehog (post)> copying path '/nix/store/fpqa1b7mfwqqbprdmml145blp4rfa2a4-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
cabal2nix-duoids-hedgehog (post)> copying 0 paths...
cabal2nix-duoids-hedgehog (post)> added 0 signatures
cabal2nix-duoids-hedgehog (post)> added 0 signatures
cabal2nix-duoids-hedgehog (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/fpqa1b7mfwqqbprdmml145blp4rfa2a4-cabal2nix-duoids-hedgehog
cabal2nix-duoids-hedgehog (post)> copying 0 paths...
cabal2nix-duoids-hedgehog (post)> copying 0 paths...
copying path '/nix/store/m17m98cfs3z832acdfkbis1jvgl60n38-source' from 'https://cache.nix-ci.com'...
building '/nix/store/7974xcs0p6x9v080ckfrhmc5svj14zd6-cabal2nix-no-recursion.drv'...
cabal2nix-no-recursion (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/wkwsrld99v0hx2p8rr134chm96aag440-cabal2nix-no-recursion
cabal2nix-no-recursion (post)> Pushing 1 paths (1 are already present) using zstd to cache sellout ⏳
cabal2nix-no-recursion (post)> 
cabal2nix-no-recursion (post)> Pushing /nix/store/wkwsrld99v0hx2p8rr134chm96aag440-cabal2nix-no-recursion (848.00 B)
cabal2nix-no-recursion (post)> 
cabal2nix-no-recursion (post)> All done.
cabal2nix-no-recursion (post)> added 1 signatures
cabal2nix-no-recursion (post)> added 2 signatures
cabal2nix-no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/wkwsrld99v0hx2p8rr134chm96aag440-cabal2nix-no-recursion
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/wkwsrld99v0hx2p8rr134chm96aag440-cabal2nix-no-recursion' to 'https://cache.nix-ci.com'...
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/7974xcs0p6x9v080ckfrhmc5svj14zd6-cabal2nix-no-recursion.drv' to 'https://cache.nix-ci.com'...
cabal2nix-no-recursion (post)> added 0 signatures
cabal2nix-no-recursion (post)> added 0 signatures
cabal2nix-no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/wkwsrld99v0hx2p8rr134chm96aag440-cabal2nix-no-recursion
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/wkwsrld99v0hx2p8rr134chm96aag440-cabal2nix-no-recursion' to 'ssh-ng://worker.nix-ci.com'...
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/7974xcs0p6x9v080ckfrhmc5svj14zd6-cabal2nix-no-recursion.drv' to 'ssh-ng://worker.nix-ci.com'...
these 20 derivations will be built:
  /nix/store/g1p9gxdr6s3znm58grj874jsmhcgvd7c-haskell-generic-builder-test-wrapper.sh.drv
  /nix/store/pkw24jpz4qr4dqkm81z8k8nbq11fni8v-Cabal-syntax-3.12.1.0.drv
  /nix/store/v6z49mmb26012avqkyq76n57pzxxjmnf-Cabal-3.12.1.0.drv
  /nix/store/20h8qhwflzzqamva8bzd8k9hsmv3dw0q-ghc-paths-0.1.0.12.drv
  /nix/store/1bbbf2pxm0al5ygvbhwqqpg13x7553hl-doctest-0.24.0.drv
  /nix/store/pzavabz5kv6jy3qyvi95yw4vvmax5k0i-vector-0.13.2.0.drv
  /nix/store/36k9aqym0rc2zb6y5425bxw6zz58sbvp-nothunks-0.3.0.0.drv
  /nix/store/haa9x0jgbgyl1gncb4dryzcdmhrmvlyr-unordered-containers-0.2.20.drv
  /nix/store/k3q1cz2jhpvxqqwhcprpcd32rhp6q2vj-quickcheck-instances-0.3.32.drv
  /nix/store/zh4059nwk2z28s01gwd5dy81332j1s51-extra-1.8.drv
  /nix/store/13gwc5v8mp1ms298j24c5dsmm4q0nx1l-algebraic-graphs-0.7.drv
  /nix/store/18xb04slazjwcsbr2ryj11rkc4ahd7yn-builder.pl.drv
  /nix/store/8lv062znkjdv7nwq8yix81rcvvp78v8m-treefmt.drv
  /nix/store/6hwl2f3sqw46qd8kyadiw8c5zwhkl3i7-pm-session-vars.sh.drv
  /nix/store/6m64ml7fg02m33z5wf8as4hr53bmzr6q-pm-shell-aliases.sh.drv
  /nix/store/1710b6izbmi3cdb9d6ignm6gs42awbgy-project-manager-path-for-duoids.drv
  /nix/store/axwv9wqbfa6jwps7m7yb8fqayv8jy6j1-cabal-doctest-1.0.11.drv
  /nix/store/c8w477i1w49hik4dzmmdz8izdfda15jm-no-recursion-0.3.0.0.drv
  /nix/store/jqrxvjrwkddrjydlz8wklm32s4g2rsm0-ghc-9.12.1-with-packages.drv
  /nix/store/80y1lh75sm5bqaid94k5qm9zk1cgp2kv-ghc-shell-for-packages-0.drv
these 769 paths will be fetched (829.79 MiB download, 8388.96 MiB unpacked):
  /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
  /nix/store/1wglr52h7wrxw0bfz83n455zaczgfvsj-Cabal-syntax-3.12.1.0.tar.gz
  /nix/store/al73ihxc4hsj5pcma0ly1mpvmkfi4ii8-ChasingBottoms-1.3.1.15
  /nix/store/i18zqp5righ6p8ds4z99ig1a7ms66xxg-ChasingBottoms-1.3.1.15-doc
  /nix/store/58cqshcy5h6f67l6d9zkl04d764wdlln-Diff-0.5
  /nix/store/iwqvhzw6z997j1xc860b6592994anpa3-Diff-0.5-doc
  /nix/store/7q411bx50h52ypz8mmn542ym96bap1ak-Diff-1.0.2
  /nix/store/alssi5r4hrr8llhcrzxzcjzm4lz731k2-Diff-1.0.2-doc
  /nix/store/ph59j9ii55h1pcysy85ab9vy8z485h77-Glob-0.10.2
  /nix/store/qijq1ryy1cpblhhzwi5wkf4m7wczmq4b-Glob-0.10.2-doc
  /nix/store/6arjclpg4fpg71xhnfjdrf7c68g7iwva-HUnit-1.6.2.0
  /nix/store/d8dyr9vqps4yci7qmmisfqzra20k8x56-HUnit-1.6.2.0-doc
  /nix/store/55hzdra5a0njibzpz4dyqhpajf6z6llp-ListLike-4.7.8.3
  /nix/store/7pbfya16ibmqq183xg0i4f66pbvdppg0-ListLike-4.7.8.3-doc
  /nix/store/0fw2rxgwaqgrg05zlv523r0f7jfs7yp6-MemoTrie-0.6.11
  /nix/store/9r7pfhjvixdqzqfm6cdmfpf2x41gmc4y-MemoTrie-0.6.11-doc
  /nix/store/ah0arr2ck9lnwszqnixxj7s8s0scq4q3-OneTuple-0.4.2
  /nix/store/3h3jyj18y3j4lndw2frd0fjiz3ksir4c-OneTuple-0.4.2-doc
  /nix/store/8l07vlz0iy5an122mghx0xbfsnq9phi8-Only-0.1
  /nix/store/rqmcz8a6h15s5fc6dfyfx84csg6x2bwx-Only-0.1-doc
  /nix/store/any3avamb2k8zvib45zkbi8mdpcblyvk-QuickCheck-2.14.3
  /nix/store/6qa803lmrix5hd0xfz931hr7a5h81krr-QuickCheck-2.14.3-doc
  /nix/store/s123pkkysjxfgz5g78s6z5pa1air13fd-StateVar-1.2.2
  /nix/store/9yvvq1lp2phdif635lb8gzgncqcg2vfk-StateVar-1.2.2-doc
  /nix/store/zk0g476bmrky6icd9bfh99s2lw1wcka9-adjunctions-4.4.3
  /nix/store/47hp392h0zi5w5c5npb0cp7lp9s2m5w7-adjunctions-4.4.3-doc
  /nix/store/dji3867ykf0xlnmkgmcd0db4sarj4v2s-aeson-2.2.3.0
  /nix/store/9d8p1qszyar2d1fhm03fklnbv9m931ik-aeson-2.2.3.0-doc
  /nix/store/npfycc6a0s7lzc076rdahhfck045zfh1-aeson-pretty-0.8.10
  /nix/store/1mmhl31km9n95qcawdaf92116gjr7bi9-aeson-pretty-0.8.10-doc
  /nix/store/1crkydpxl0sh8214grfpxhafggbyd7fc-alejandra-4.0.0
  /nix/store/qn8vf3mi55jykysjqcl2l519fb9v2f35-alex-3.5.3.0
  /nix/store/lhvjf49vc2m1s2ip48a46n8cq4skysy7-alex-3.5.3.0-data
  /nix/store/83154svs6k7bh763bnprxwkg5aiqks5a-algebraic-graphs-0.7
  /nix/store/adxd5nf7051ai8dry3c88933ly08csgz-algebraic-graphs-0.7-doc
  /nix/store/58pj5537vyg2rzi2l521q29l2b9c6klp-algebraic-graphs-0.7-r3.cabal
  /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  /nix/store/qajlzal9ay5s8wss50czfk65dsq1ij7c-ansi-terminal-1.1.2
  /nix/store/jv1f2yqyvwiavissp6bh1ccpnwgz8dd2-ansi-terminal-1.1.2-doc
  /nix/store/jja8pwfbp3dx9j5q5iy7bfgvbwny0yz8-ansi-terminal-types-1.1
  /nix/store/1xknhxrafz7fjm0nl3nrfk3iin06ydms-ansi-terminal-types-1.1-doc
  /nix/store/dyyylggnf29qdcnkwihqg4g4yj3krs1q-apply-refact-0.15.0.0
  /nix/store/wmp8vxmlij1472b748h5nqlm2f0m1b33-apply-refact-0.15.0.0-doc
  /nix/store/7q7mx0k1c61dl9hk706yay4hwyj2fpzd-assoc-1.1.1
  /nix/store/dqklzvxn4x4waiaa5rgcllzrfc26sx60-assoc-1.1.1-doc
  /nix/store/dmgd5b0hyflmmmwnf2kipp4al5r857px-async-2.2.5
  /nix/store/zy9m2fzby0prhglj1yh9584y726jr5gd-async-2.2.5-doc
  /nix/store/pfcg21w81n1vi6jik5affplayny89g8m-attoparsec-0.14.4
  /nix/store/pd9lz1796m9f85rzhj6i1h58lcjcxvki-attoparsec-aeson-2.2.2.0
  /nix/store/65zxlyy1107irnhn8g8kzdimf2wr3c37-attoparsec-aeson-2.2.2.0-doc
  /nix/store/b0j07izl8bymrfdjiqiqpbbd31j6fah4-aws-c-auth-0.8.1
  /nix/store/gjcvgjvr1m4f386i2279n8z2ks0dp4rn-aws-c-cal-0.8.0
  /nix/store/dw43m0akrx4i361mz3v39gc5v79msy4v-aws-c-common-0.10.3
  /nix/store/1191rci8hq31x01ibch6rw01hxyppzf1-aws-c-compression-0.3.0
  /nix/store/lv09vqv0iwl5xhalivqrh9vq50dd0qhg-aws-c-event-stream-0.5.0
  /nix/store/sshykf1xl0gx5f5fccs192953ca48mlz-aws-c-http-0.9.2
  /nix/store/72clwj3z0160c40d4kraa515fnaxpg95-aws-c-io-0.15.3
  /nix/store/2py9gyblpjn4md4dajbrjdpkici9fdjz-aws-c-mqtt-0.11.0
  /nix/store/ygxiry6v791vkaixa54v2pr00r00qs56-aws-c-s3-0.7.1
  /nix/store/78jpg9csx11aflfk32zj9mapc8ag8658-aws-c-sdkutils-0.2.1
  /nix/store/4fpvq180yap1qcr05gnv3r0z6rr2sw43-aws-checksums-0.2.2
  /nix/store/wgsh6dpfj8dmdnkrhvhzm1jrx4sa4zw0-aws-crt-cpp-0.29.4
  /nix/store/kz3gilypl4hqdv6dpq1akbdl4frhysla-aws-sdk-cpp-1.11.448
  /nix/store/p1mwqyza9q1rqncm4x816y59zim5gc48-barbies-2.1.1.0
  /nix/store/dl0mzb4hvirnpxisbbr4lwb2qhd1d7s0-barbies-2.1.1.0-doc
  /nix/store/vmzk9zd0px97fazvs3l1zyqkazh6wj06-base-compat-0.13.1
  /nix/store/d7jqcsxdfyl8aim2b62481g8ng1y9kim-base-compat-0.13.1-doc
  /nix/store/m6n9m0zb30rw6kgs5fjqmdx9cm2kn30v-base-orphans-0.9.3
  /nix/store/q7arwm1djwzf6hnlk47zg530ibnbbhlr-base-orphans-0.9.3-doc
  /nix/store/higrlk8zcqac83v29hv4cw8dbcwiy2bf-base16-bytestring-1.0.2.0
  /nix/store/z1xl422lbc6w5608ln5q9zws3r8flwcy-base16-bytestring-1.0.2.0-doc
  /nix/store/45675z0yq3jwc1xj81x3qmx2f9hyl8wh-base64-1.0
  /nix/store/2792h6ajwgfdayyn30nsnyxaq0s6g75p-base64-1.0-doc
  /nix/store/nn27l879np49xvx6l1a8nqnqlp9apd8n-bash-interactive-5.2p37
  /nix/store/a4rx79vkyfssicg7cc9jn005nqpliiwc-bash-language-server-5.4.0
  /nix/store/khkwdrvwm1kljaw7xwpq8jhqwcb5w4vx-bash-strict-mode-0.1.0
  /nix/store/06rvcj1v2inswv88bvsdf3458480cn7i-bifunctors-5.6.2
  /nix/store/bayy0wvlqim1cfjy5x7sf21pwwbga4h2-bifunctors-5.6.2-doc
  /nix/store/k7n86wrqm26jynf5yxfi8i5invpjlvys-binary-instances-1.0.6
  /nix/store/rjk07nykg6qqxv4zf83mn0pvin7sak4r-binary-instances-1.0.6-doc
  /nix/store/gizwnl2qpj3m37n6ryzr9jc1bsqj9awj-binary-orphans-1.0.5
  /nix/store/azzbnfhznbdnhgza5nc21yb2ahx10kzw-binary-orphans-1.0.5-doc
  /nix/store/42pzy4ahwk8p41hwfmz2nldgvsdws8q1-binutils-2.44
  /nix/store/5i17rngglby671bra0ns7nr01v1c0340-binutils-2.44-lib
  /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44
  /nix/store/65spavl1r49gbk14qx3p99xvh8db78f6-bitvec-1.1.5.0
  /nix/store/rxw996fr01vv3nqiwlhhc7yn7wz6673k-bitvec-1.1.5.0-doc
  /nix/store/wsn6ci07m11j4b3bvrp25iy7lf35h8v3-blaze-builder-0.4.2.3
  /nix/store/y2nr1raq4h9bf8a7alyn5f9pnw3mbvna-blaze-builder-0.4.2.3-doc
  /nix/store/3hlgarrqhsd5gsmnpfmrjglzwbxqc6q6-blaze-html-0.9.2.0
  /nix/store/6gfmcj8y8bcpmifaxmz792v1gn1giwqn-blaze-html-0.9.2.0-doc
  /nix/store/8k6pf85q7jsvnijk7zm2viz9zpa8xgvc-blaze-markup-0.8.3.0
  /nix/store/y88f80lk97dig6wwcss2ylivx5c8y22w-blaze-markup-0.8.3.0-doc
  /nix/store/k7s2mwdz2vhcagn2dmvc0yh4bv9yb6j4-blaze-textual-0.2.3.1
  /nix/store/66vjs5pradjp1y027z17ddpwb2a1ygn3-blaze-textual-0.2.3.1-doc
  /nix/store/60mh60sl0igwn43xx6rpzswqapa90da9-boehm-gc-8.2.8
  /nix/store/bnm8j03b0h7b2ivmpp9f14n0rzxy9ikb-boring-0.2.2
  /nix/store/yzbkw7mfg2sdawz2gwcwgvmf0cjcaxsb-boring-0.2.2-doc
  /nix/store/yv4kz5qk38y7x5x5rg8a5lmgd9pcd09n-busybox-1.36.1
  /nix/store/xgkmj1q3w5qp7xg3ca48s9zsbdrw66k6-cabal-add-0.1
  /nix/store/lf8b1xd0nbma2w4j9qbwfi1yb1rzbfb0-cabal-add-0.1-doc
  /nix/store/8ic4r88607c95vfk7d2idwr4rh3qz6cd-cabal-doctest-1.0.11.tar.gz
  /nix/store/rwr0pmgbryp0rk4ffvjc45rxqhm38r3v-cabal-install-3.14.2.0
  /nix/store/iy6sagkp3ijsgvdy5fzyhw852gwngvx6-cabal-install-parsers-0.6.1.1
  /nix/store/gmgqa55wynx5yc3k6n8z89cbpby2p0pi-cabal-install-parsers-0.6.1.1-doc
  /nix/store/fnmq9002xgpclpc8fpxzwks1rqh5q9ys-cairo-1.18.2
  /nix/store/mn6gg2m2xql70ifmlyj1lryylhyimvk3-call-stack-0.4.0
  /nix/store/1z9vcs31d1k3z9hgdawzjq2ar3pgs842-call-stack-0.4.0-doc
  /nix/store/snjbj1yjc7ijlamav7049n4clmnzmnrd-case-insensitive-1.2.1.0
  /nix/store/5ms418ciz405r9hnyrxl0xcmxx7lf591-case-insensitive-1.2.1.0-doc
  /nix/store/ac2jnn96k1agnlpp5pf4lxmjbnirn1w3-cereal-0.5.8.3
  /nix/store/qyjkv30vm0jnslxd4myk2csmr2jlx8g7-cereal-0.5.8.3-doc
  /nix/store/khvj3kfrhl9r2zzybk2s2sshnjwzn52w-character-ps-0.1
  /nix/store/3ccp4fcr4cv9pnsak6ambc02qlwf84j3-character-ps-0.1-doc
  /nix/store/czfqnd1k6pyp5n2ipgbslv622f3j5ri3-charset-0.3.12
  /nix/store/dwqw60msag8vnq5780mffwv958c78d69-charset-0.3.12-doc
  /nix/store/3phkhab2g0mwx7q0dzx89mgx0nnrpd7n-choice-0.2.4.1
  /nix/store/3rafiiaxd5db922l3d0qcn5nxa59k7pg-choice-0.2.4.1-doc
  /nix/store/6ckb3544kh0wxy8dl6x5l526p49fk7qs-clay-0.15.0
  /nix/store/616bsq9sxak1s5ghdfbgbndgcj1cjxsk-clay-0.15.0-doc
  /nix/store/yq3xbdp8whbhcffhpizb969mch36j2an-clock-0.8.4
  /nix/store/84grvhvgyq2zi6qy3lzh1kkafh06gxw3-clock-0.8.4-doc
  /nix/store/rhy58fi1jr6m4324d1711lbblf5l2p7f-cmdargs-0.10.22
  /nix/store/hwj6f3zjv1x4gnl8yi7yf2d4g8ghr233-cmdargs-0.10.22-doc
  /nix/store/7qy6ifh8pkpd8zn13gf6h87vs2cp2d77-co-log-core-0.3.2.5
  /nix/store/20rvkp30ah6czdsh1yzh5wk416cbnzhn-co-log-core-0.3.2.5-doc
  /nix/store/n5m58qzjc44zs66dmwr6hy8cdjdzn4wq-code-page-0.2.1
  /nix/store/yjpg827y9gd4m07kgf4inwrbkn85xlg7-code-page-0.2.1-doc
  /nix/store/wm4qssdkjhd6zcm8xyish7l4fy7aniqd-colour-2.3.6
  /nix/store/fh4i0hrim9jpwf807kdyhfjf2hhj7vlb-colour-2.3.6-data
  /nix/store/xd7a09zbjpchvjqm253gw2xhhgrgfi36-colour-2.3.6-doc
  /nix/store/28gjbhan4axwyah9hy73dbdlpcl0hinh-colourista-0.1.0.2
  /nix/store/p0b85292sxl3js89mcyz7fy6rdmd6zn8-colourista-0.1.0.2-doc
  /nix/store/3xz413398n24kgqqsrrp1l5hc7nx7s7b-commutative-semigroups-0.2.0.2
  /nix/store/7kqw4w5s13nd1s4q24rr0qc7vl6kjdyz-commutative-semigroups-0.2.0.2-doc
  /nix/store/b9ar7rxf2lvkv9ph0zf7bgikamh59fpi-comonad-5.0.9
  /nix/store/ba3mzjni8v5wnbwbcsqa38rsi4hxqygb-comonad-5.0.9-doc
  /nix/store/klqv17pvmspyki9vdinmnw9prq8d1n37-concurrent-output-1.10.21
  /nix/store/a18xm3yfhdjkckcvbkclmrph475p6zgc-concurrent-output-1.10.21-doc
  /nix/store/p0cfpkkkla7lxr8hfmjbqvcahx507n3h-conduit-1.3.6.1
  /nix/store/qq29j064ycqz4g5g98l7h5201j246nah-conduit-1.3.6.1-doc
  /nix/store/ix4n2w112p09f32516gmxlh2dg68sq7v-conduit-extra-1.3.7
  /nix/store/57xkkyy60nfbj8rx2m8jgwdi3y0xz0ra-conduit-extra-1.3.7-doc
  /nix/store/02qhxd2cicprw6ahfl3n2x3778kai4q7-conduit-parse-0.2.1.1
  /nix/store/4m73i1crg28k20id77njj6v2gm9s1fjv-conduit-parse-0.2.1.1-doc
  /nix/store/342jwl67r98gbb59ncj81vf5lla52q3j-constraints-0.14.2
  /nix/store/aj9f54k89pc0qjd4gaqpb0adr3sshk67-constraints-0.14.2-doc
  /nix/store/nfgn6bwn72w25vi67gsjygwswji3iryx-constraints-extras-0.4.0.2
  /nix/store/cnbk2ddff8kwgr19cad3pmn2iydjkrmc-constraints-extras-0.4.0.2-doc
  /nix/store/f4n0zi1x0kg48ry4a0n47qq7dvvjh7hf-contravariant-1.5.5
  /nix/store/5n4ip8ndsdsdbf95hihjqdm94z5rm36v-contravariant-1.5.5-doc
  /nix/store/zx9kcf3aj5rprl31107cazv8rzn41aqm-cpphs-1.20.9.1
  /nix/store/f1prajafig5845gx091zg06xh4hgzv73-cpphs-1.20.9.1-doc
  /nix/store/8xjpz3wvb22s8q3hjh57a7yhzwnq967v-cryptohash-sha1-0.11.101.0
  /nix/store/v7czx9mjs7g85ibiyrzgd61bp5063kaz-cryptohash-sha1-0.11.101.0-doc
  /nix/store/85x4vfkgrzs6nk7s2mbv6869ry6zdqyx-cryptohash-sha256-0.11.102.1
  /nix/store/pxiqvlxkql1l7pi9s090favyrz9s7nsg-cryptohash-sha256-0.11.102.1-doc
  /nix/store/pa8pgwscbaib2qb7vn9prrjdlmkjrz69-data-default-0.7.1.3
  /nix/store/cn6lia1r9xln85mfcmifbrl859l3di94-data-default-0.7.1.3-doc
  /nix/store/ls9lyl91619dh7mpxg44a8pyga7i9kh1-data-default-class-0.1.2.2
  /nix/store/q3jxvh3naa6vdyy4ynr51vfqd2nvghb5-data-default-class-0.1.2.2-doc
  /nix/store/ydizyzjxznvchdi1gfkz6i2hqp7xpwry-data-default-instances-containers-0.1.0.3
  /nix/store/b0pnpzj231ff8czvxhsn5mjizmk27lvv-data-default-instances-containers-0.1.0.3-doc
  /nix/store/wppssc0mkd98n6ln17h2b4vfizqb14xs-data-default-instances-dlist-0.0.1.2
  /nix/store/229k4rfzxhmb2paslyb756m6yalxn2qh-data-default-instances-dlist-0.0.1.2-doc
  /nix/store/smz68mp95nw51w7ayg1xjm4qi1hzj84q-data-default-instances-old-locale-0.0.1.2
  /nix/store/w4kcw521ql1bqgwpl80n0flr9isrfl74-data-default-instances-old-locale-0.0.1.2-doc
  /nix/store/1jjw1rrnb4acavxb550d16cy34l15y0k-data-fix-0.3.4
  /nix/store/6nl3hz4gbdb7s17spawd6b3w30c9mvlz-data-fix-0.3.4-doc
  /nix/store/x96w22l8iqhd0k92x7gys2qsy0wcsc89-dav1d-1.5.1
  /nix/store/xcaznsndin98ig8w4bbq6nq4idrhqgh6-dav1d-1.5.1-dev
  /nix/store/2869410yhvnskxh8l9hmjvndvwi0j2nn-deferred-folds-0.9.18.7
  /nix/store/qbq76kza5l6d7c2xxj4zxvr9iwfnsnsm-deferred-folds-0.9.18.7-doc
  /nix/store/f2c0p6w6x2dmp252xjh144mncw8m2rjs-dejavu-fonts-minimal-2.37
  /nix/store/wvkqippf3b6f8jf9hqcr678fdq5nq57h-dependent-map-0.4.0.0
  /nix/store/qkxz1npgj6nzibpflzgpjc13z9h2av6v-dependent-map-0.4.0.0-doc
  /nix/store/cbrj8bi6yvrr878xfy1jzbgm88y1g8xi-dependent-sum-0.7.2.0
  /nix/store/nr5zn19j431lqlsi8pj35582w708jnci-dependent-sum-0.7.2.0-doc
  /nix/store/hb1zdadjajqagsmlsc5ms46s9acfn2fq-deriving-aeson-0.2.10
  /nix/store/9gh1biyyhviffcihn69d71n8z1myaylq-deriving-aeson-0.2.10-doc
  /nix/store/nl8506nciivgw17jnj9bawh0j314m7an-die-hook
  /nix/store/5s2abhvvcyxfgw1a2y0rk1jw6h1s0kj4-dir-traverse-0.2.3.0
  /nix/store/cx4f06grjqr6bd13g2vyzcw8l1fdvk2p-dir-traverse-0.2.3.0-doc
  /nix/store/nmz0d2n2ncznsfnrl9n6m11avm37xggy-direct-sqlite-2.3.29
  /nix/store/12kr9dlkrqcccmvbh39bmzh9ra673ci2-direct-sqlite-2.3.29-doc
  /nix/store/ry6fmjgjp58jrrhfjzjd4n8ygb7k09yd-direnv-2.36.0
  /nix/store/kahxqgf2jz35asgp7bx8zyvn1qiwcblr-distributive-0.6.2.1
  /nix/store/c83ymfzcfws8ljc8ixqdymvhfbg1al35-distributive-0.6.2.1-doc
  /nix/store/zl2qmri8zrkbazpckd8sjd4s3fparkpp-dlist-1.0
  /nix/store/ps9ccacm7g9cl5di2j1wrb2ih1bd8jkm-dlist-1.0-doc
  /nix/store/25rjicrjsc82nyg4cj2ykkmcb69kxlij-dns-root-data-2025-04-14
  /nix/store/sx0kgsyjl6cggpb83pb21s1x5sjxb7am-doctest-0.24.0.tar.gz
  /nix/store/5xckmr6v2gv9v1s7g8pc80lgxs62pns9-double-conversion-3.3.1
  /nix/store/ncjvky2z13rk45nqlrizdh9ypn108pch-editline-1.17.1
  /nix/store/rh4hvsib7vsqx5qnfbd54qdmg2ahbzzy-elfutils-0.192-bin
  /nix/store/3vsxig0sb5q6vbdfgh3gc0drfvw43yj5-elfutils-0.192-dev
  /nix/store/jnnyz04l7g8gdny8mp5ggpy1rf59r2qk-enummapset-0.7.3.0
  /nix/store/ji8p34qdwpd1sy20ivdshaz12ka1vyq0-enummapset-0.7.3.0-doc
  /nix/store/256w8fq06a087k54ph5xpklysslv6in1-erf-2.0.0.0
  /nix/store/8f0yws14vw25ppq4rbdb92j8mscfs3bs-erf-2.0.0.0-doc
  /nix/store/fid5v1wd8wkrz39yp73d0hhlny2ms9w5-expand-response-params
  /nix/store/jr8kyv517lyd5xcv3pnhr6z4wirbi06r-expat-2.7.3
  /nix/store/xgq1s3jcadwwiimw67cqgs0r72xymrwx-extensions-0.1.0.3
  /nix/store/c8gy4i7zypzykxxk967i0z4piil54nv4-extensions-0.1.0.3-doc
  /nix/store/3ph9dcpgs14vacr47jlymnxrfzn7apr9-extra-1.8
  /nix/store/cjcb64mda71z7vgv5jd0kxw169xqh0g5-extra-1.8-doc
  /nix/store/djwymlbaqpzn2y2l24hzjxn7wfn797lb-extra-1.8.tar.gz
  /nix/store/1yj7ij8nwr2nlz1fgksrwqkx4p3iif7n-fail-4.9.0.0
  /nix/store/sb2g1pi05lya9wlgmvwsak18r3vjc3y7-file-embed-0.0.16.0
  /nix/store/d02hxww6hkch28fxiqlrfkyd7wpy39x6-file-embed-0.0.16.0-doc
  /nix/store/84l59pxppfi3grhi7bgbs14g96dpv5c9-filemanip-0.3.6.3
  /nix/store/f3zzdw029hbbq5hlh7jaizrxrmnxsx1r-filemanip-0.3.6.3-doc
  /nix/store/xs33cxq6swjvvqvgsly50kcph37h6l89-filepattern-0.1.3
  /nix/store/a572k2ghc4zz4mpawlmr7f01ccyc9g4k-filepattern-0.1.3-doc
  /nix/store/29amvdiz8ki1qcicmpmmi1c749fj578f-filtrable-0.1.6.0
  /nix/store/gq37kyz2c9daf37zd7a5619f03bph2s7-filtrable-0.1.6.0-doc
  /nix/store/88byk4qbxl7apvnmjqc7a9z9dp93ssjs-fingertree-0.1.5.0
  /nix/store/5ay4865dmgbzrs16jy5b32md7aya4krf-fingertree-0.1.5.0-doc
  /nix/store/rxv21hqmz3qy8rysf6f0hk1fxhps7gzb-fmlist-0.9.4
  /nix/store/4vjb9b1mvxnb4wp4qhb7fdid7445j8yd-fmlist-0.9.4-doc
  /nix/store/wmilrdxy6sr52az0lp1cajl8kc2mn058-focus-1.0.3.2
  /nix/store/xzjxsaay5d1hvrvq0wp0jsg3wja4cq34-focus-1.0.3.2-doc
  /nix/store/g0f9gbyfngcmllwglmqw9qdmakhlga1g-foldl-1.4.18
  /nix/store/si1dmlp4h232zwci2vrakdljddr4473j-foldl-1.4.18-doc
  /nix/store/59s8rkrndv5vk8bhb9ljy6pvgyh63baf-fontconfig-2.16.0
  /nix/store/wnvcwai159xvb8m4i6c9aiv90c3ilhk7-fontconfig-2.16.0-lib
  /nix/store/fhjm9szvdh1n2qsxi7n2l1j98a867gcz-fourmolu-0.18.0.0
  /nix/store/vl3q1rlq8mvm96j7zd0nfid4ak846g1j-fourmolu-0.18.0.0-doc
  /nix/store/0h3w1l1lzkd9qyqryb5k12j6mbzjrjxp-free-5.2
  /nix/store/kn0wgv74v6m44jbymca77pyfl19y12fw-free-5.2-doc
  /nix/store/p1cqrricl0ch7qab8b8w3krhc91d890v-freetype-2.13.3
  /nix/store/62h5sfxr4s1qc3fghcan06viq4gms6yg-fribidi-1.0.16
  /nix/store/62kigi0npspra72nq3wp1p8wbgvmxshr-fuzzy-0.1.1.0
  /nix/store/wql0wmyczaywk56vps0h24rnd2zizca2-fuzzy-0.1.1.0-doc
  /nix/store/y28c83zz73yr4vwz1fsl4nsrn6yz5fj0-gcc-14.3.0
  /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0
  /nix/store/awm8a4wpvh14h42jl21m2armqhm8fhy7-gd-2.3.3
  /nix/store/vmw4ghy1v0lz64f1xx4cyv6g6qc1lb1k-gdbm-1.25-lib
  /nix/store/akc947m4vlrmzjil7d0wv91v3gkjflf3-gdk-pixbuf-2.42.12
  /nix/store/p2vr9qkjladbmw83iavkkj3vagandkcw-generic-arbitrary-1.0.1.2
  /nix/store/r53ka1vvjvlx8i027h08zqpgx0fx8g42-generic-arbitrary-1.0.1.2-doc
  /nix/store/8d91bb68zsl1r8laq7p2hkfifainjhq3-generic-deriving-1.14.6
  /nix/store/9q6hps1cj2cra46v8gbaf0h02p0z45f3-generic-deriving-1.14.6-doc
  /nix/store/973hmwrcpkp6r8c607j2j1dqddqnv9r8-generic-lens-2.2.2.0
  /nix/store/3dl6p3l7lk0w21pvxqak2zi8lcv4wznx-generic-lens-2.2.2.0-doc
  /nix/store/02i858dbqv1gad4149b7varj19hsiam3-generic-lens-core-2.2.1.0
  /nix/store/32blvzag2d2bpx5g24n1a43151p3kq3x-generic-lens-core-2.2.1.0-doc
  /nix/store/k3nb7i40zirp5zn5b58vkczhainysg4k-generically-0.1.1
  /nix/store/nhpi1w3rc6ji4f6nq9gdcci9zrjjsfbx-generically-0.1.1-doc
  /nix/store/sz6wx51pnm4dpcliyysd27i0jqywm15x-gettext-0.22.5
  /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1
  /nix/store/l356y1vcry8bqjnhd7j6vqivw9l2rvi3-ghc-9.12.1-doc
  /nix/store/iv5x18bvnk8mqs8fxxa84s2dhhdg4sbz-ghc-exactprint-1.12.0.0
  /nix/store/9dqqmnnj7r9xxllsakrnan0y84qdal2l-ghc-exactprint-1.12.0.0-doc
  /nix/store/isimivqvmw3ww5zywav15l46m3p5fpsq-ghc-lib-parser-9.12.2.20250320
  /nix/store/xfxawjyd1plcn3aaxdbhcmk3gbxwkzhd-ghc-lib-parser-9.12.2.20250320-data
  /nix/store/q8mdwkpg6bngg1k894wjbr4qkj7jy2la-ghc-lib-parser-9.12.2.20250320-doc
  /nix/store/ncr785p6i6lyjihiixvv8k7jxnvlz3nv-ghc-lib-parser-ex-9.12.0.0
  /nix/store/z6cdgbnhk0vvn14bkiizmikz4lf7qv75-ghc-lib-parser-ex-9.12.0.0-doc
  /nix/store/hklm9xzb35m11r0317jn8njgqr40y80y-ghc-paths-0.1.0.12
  /nix/store/mixl6wqgxy9daxqz1pdi03njrf0w1qzk-ghc-paths-0.1.0.12-doc
  /nix/store/nb6f6gsg55nky42zddn60xr2wbd7s08c-ghc-paths-0.1.0.12-r7.cabal
  /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  /nix/store/p8wrzfa275rwgfw810ybd9a8wf2pprkl-ghc-trace-events-0.1.2.10
  /nix/store/n122119x4xa4l4x1hxgyk1v8axcvbjsr-ghc-trace-events-0.1.2.10-doc
  /nix/store/5pa7r78r4pmqagfq71srmdkkwligwdb2-ghcide-2.10.0.0
  /nix/store/7dbjs2c7n1hjhyyp8r2ks9jlmjz189l3-ghcide-2.10.0.0-doc
  /nix/store/imw7yr5pkn22zaq7z7hczpb9dim29scw-giflib-5.2.2
  /nix/store/639k78iljhfmciklnivi0wja8jcy788g-git-2.50.1
  /nix/store/ka79yp3ljjdkglkg0m55fxcbl130rjm6-git-2.50.1-doc
  /nix/store/rsaa5pxy7ncsxl13f55jy47k848il06z-githash-0.1.7.0
  /nix/store/d29mzpvs6d6krj3m1cqph7cm9m1x63sz-githash-0.1.7.0-doc
  /nix/store/5rkg2cbn0g45rhfxqcp5iyjl2dcvsmg1-gitrev-1.3.1
  /nix/store/7pmg4mpna0ww28l57lv82jpwmpqjac4l-gitrev-1.3.1-doc
  /nix/store/8gfq9pn1shnhi6mha2a56aa3ny7g9r6f-glib-2.84.3
  /nix/store/fm1snxs1cg8ml9fjj6kra32sc8413k8z-glibc-2.40-66-bin
  /nix/store/1v9ggwkpb0xy708s11s1g9fhinn3b06r-glibc-2.40-66-dev
  /nix/store/6mxnr68qgihr5pmp4avjbijjgwifdnml-gmp-6.3.0
  /nix/store/mml8yn060rz4krfdcqpqy435imx3x2k3-gmp-with-cxx-6.3.0-dev
  /nix/store/zrqnaqv2l3vq6w80jwaf5qhgjjkdk937-gnutls-3.8.9
  /nix/store/spmkixfl0sj5l0vvj9gxxlymid3nkwh2-graphite2-1.3.14
  /nix/store/4agib1rqrq7dplfhakg6xh9injdyan0n-graphviz-12.2.1
  /nix/store/zyg1px9d41rmv75jr76lxxfxv3zwkn2z-groff-1.23.0
  /nix/store/kgshgyy6warcdj62p7gm0rnmdl9c9mn0-gtest-1.16.0
  /nix/store/l1y3v80zbq5yw155ldyhs3g1pvg8hb8i-gts-0.7.6
  /nix/store/v03a1m3b2z4gml5z7d9wbh8kxz32l9xr-harfbuzz-10.2.0
  /nix/store/7wy9v1yd358qmbk9ryqb3ki4p7yrxgj2-hashable-1.4.7.0
  /nix/store/xmnd0c4h48aprjr00i21zdzmbzxgjz5j-hashable-1.4.7.0-doc
  /nix/store/pmg9r24613mp20p1k888img9jlqjm8p0-haskell-language-server-2.10.0.0
  /nix/store/940hm1dixb6f9wjadl23nyhy73njqf0p-haskell-lexer-1.1.2
  /nix/store/14hq8w7izw1yffszp1kd6vyridh041iq-haskell-lexer-1.1.2-doc
  /nix/store/vr8lipn5h6q1zbaqmydgjfnqm54g9002-heaps-0.4.1
  /nix/store/4qvrmz6b00i91p7hwhx478dccg3lcgb6-heaps-0.4.1-doc
  /nix/store/2949lhzs84qkv2bjkv46bxb90f48iicp-hedgehog-1.5
  /nix/store/87ncvh1wb17xybw0391b2a8rzd32kbiv-hedgehog-1.5-doc
  /nix/store/pvv66l1jj47vvknnsy9g9y8c7i8nrqix-hie-bios-0.14.0
  /nix/store/lzmn33azy3c7jbrbkqni0b0i2g1xvd43-hie-bios-0.14.0-doc
  /nix/store/lss9p3pcmkfgkk291y755dbgn1g6cfwj-hie-compat-0.3.1.2
  /nix/store/ylh3biza9xnkdkgs00vn9g1jq6amy633-hie-compat-0.3.1.2-doc
  /nix/store/vhkra7z7g0v909d4s7wffgn78hc30q2j-hiedb-0.6.0.2
  /nix/store/p40fxi5zffww2v293xxf4ggvy1xraakb-hiedb-0.6.0.2-doc
  /nix/store/68jqswsp2y81xxvdwggz8d2g4abrfqsk-hlint-3.10
  /nix/store/01rfsn8kjbhvklskpbg5c82p7id61cd1-hlint-3.10-data
  /nix/store/2wzzsv79bvdm7nklz35j9czdx43v90hk-hlint-3.10-doc
  /nix/store/qbscv63yl3pi2p2k2052ygjh7svbgbgp-hlint-3.8
  /nix/store/xpqq6zqzqyyviajl2sfkcaj1s0ck7z4p-hlint-3.8-data
  /nix/store/4nq74d4wbwy48jybkjsqdi2ncays8p7w-hls-graph-2.10.0.0
  /nix/store/2y8nnf795pv6dz71mfy1ddpifsy2z9w7-hls-graph-2.10.0.0-data
  /nix/store/dq0x8c7blbb31q381msyshz8cc0clskx-hls-graph-2.10.0.0-doc
  /nix/store/lscng9zsswc6krg0im81g7yzqb23gfrl-hls-plugin-api-2.10.0.0
  /nix/store/6fy03xq4w6cwp84lm70g4ri2q4cw3mbz-hls-plugin-api-2.10.0.0-doc
  /nix/store/2hksmrgh9jqs5hsj3bkznwm55mlqmi71-hls-test-utils-2.10.0.0
  /nix/store/m61ym5cs5jcd0cincbg75fyrgz3h57px-hls-test-utils-2.10.0.0-doc
  /nix/store/4kpbg61sraqf1rlvj5ka125j2s93y4r8-hostname-net-tools-2.10
  /nix/store/2pcbxrvymdks5imwprhjzl7pl12q4702-hscolour-1.25
  /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25
  /nix/store/iwhdsy0fbsdpf9gbf5v6wa3aspl4s0sn-hscolour-1.25-data
  /nix/store/gmvrlry6c4ima11v9q8h11z0b0c4vjmq-hscolour-1.25-doc
  /nix/store/1p5gmq9id6kq93vj95j6krkc2ac7vvi7-hspec-2.11.12
  /nix/store/mqgps2hb7gic9rgqdc1xqnhxi0m6kxk2-hspec-2.11.12-doc
  /nix/store/01avpw2x6y107vq8p9zcpim9s5zwmll2-hspec-core-2.11.12
  /nix/store/pycjypz4bvnxy4km8mwybhsyvwri15fg-hspec-core-2.11.12-doc
  /nix/store/ps9m23cnf34c88zihpz1kcd760kyhbbg-hspec-discover-2.11.12
  /nix/store/7pmsq6hkylq7a3pzdkcadvpxh46f9xzw-hspec-discover-2.11.12-doc
  /nix/store/k85pcmaq1rky36drpz2h07ri2ddn4pr5-hspec-expectations-0.8.4
  /nix/store/dj8vrdjdpmfdwbvfsifypsvmbyccml6q-hspec-expectations-0.8.4-doc
  /nix/store/9dp94l0ndy2c3hi02s20kdiq1y7kj4kl-hw-fingertree-0.1.2.1
  /nix/store/3zp0wmxiffrszflmawj21z9id7vnfg08-hw-fingertree-0.1.2.1-doc
  /nix/store/fc7y8xli57v8m0i01d7kxnm20vfxr7is-hw-prim-0.6.3.2
  /nix/store/2k7rn4nj9xw018d7mm451gpbjnh819qs-hw-prim-0.6.3.2-doc
  /nix/store/rymdwd8k4abh40b3mw4pf69g793mdqbi-iana-etc-20250108
  /nix/store/krj0md2jkaaz4ksrg8wqab80wk34d1d0-icu4c-76.1
  /nix/store/70sl6zdmxwxp0hi6q0dr3dhf3h4mf8fn-icu4c-76.1-dev
  /nix/store/idqybcji3xw8a2lli6whjjhhyra4k8yy-implicit-hie-0.1.4.0
  /nix/store/ww6mxb1s5y9zzqzlqshj5km4l0j2bl5x-implicit-hie-0.1.4.0-doc
  /nix/store/whmbzyxnp17bjws71min4wbsqi3bm7g7-indexed-profunctors-0.1.1.1
  /nix/store/hirhdq8l0g0cmvyi5bc5b8gri9a131bb-indexed-profunctors-0.1.1.1-doc
  /nix/store/kpx4j2vnw5lm8jb41qmjlc8pv7ssps51-indexed-traversable-0.1.4
  /nix/store/rmbd8rw598i6pmvdgnl8z6911fdb4sw1-indexed-traversable-0.1.4-doc
  /nix/store/wjzkd918l3am84gfw61w9ds8l791hjwl-indexed-traversable-instances-0.1.2
  /nix/store/wjhd155hvjy0vvjcnclrczbm40afyyqh-indexed-traversable-instances-0.1.2-doc
  /nix/store/y9xfpidx45ksd78igp9fglimyh50z0p8-inspection-testing-0.5.0.3
  /nix/store/xaklrhfpz60xwgmfyhr4p2hq4bika9vq-inspection-testing-0.5.0.3-doc
  /nix/store/5ryfkbkiy19kcb70pp87vbp1bl5kb6m3-integer-conversion-0.1.1
  /nix/store/qk9fd27153v1h66b1clv1mm0vd5cbljr-integer-conversion-0.1.1-doc
  /nix/store/4qrhifdyvq6p6vvibhj3xyfgjawf985w-integer-logarithms-1.0.4
  /nix/store/q4g45kmrjip4lgz005minx0m12z15a0r-integer-logarithms-1.0.4-doc
  /nix/store/pv5a21l9dkx5y211z0y3pi2cvbiri7wl-invariant-0.6.4
  /nix/store/dym5s345ifxyhw4as9f6xn4fapbb9gml-invariant-0.6.4-doc
  /nix/store/fpsjnh09h1jnyqm51925wa2xck72jchb-isl-0.20
  /nix/store/a11jawsqjf43hzr2vnnp2ih24rpi35rv-jailbreak-cabal-1.4.1
  /nix/store/b4rm0x46a7p3f0ihqgshf3zhiw6gk8is-jq-1.7.1
  /nix/store/r49zci44xq7i6wl61ayhq82wn6v7w9lm-jq-1.7.1-bin
  /nix/store/qy8kw7nqaq4iblp0w1prr5hl9pagdflb-js-dgtable-0.5.2
  /nix/store/chhq6a1bf9zh2x6v2hi9hsxf44nvglb8-js-dgtable-0.5.2-data
  /nix/store/riy0czhqxr1839mikrzacqwd85qvfw41-js-dgtable-0.5.2-doc
  /nix/store/1xzdpi8p3a3zsl18f0phx6myh3qxzhvn-js-flot-0.8.3
  /nix/store/gcsa0mdibmj12j7jicqrm6lwvj6wyj15-js-flot-0.8.3-data
  /nix/store/bnm30x6v7psl5p1qn1l1b55fcr4ak644-js-flot-0.8.3-doc
  /nix/store/v92rk8wc32dvrb196q8plj4zfv9dx8y6-js-jquery-3.3.1
  /nix/store/7163ps9r4h87hhyxig0g2lb1y33dgh85-js-jquery-3.3.1-data
  /nix/store/gbddsm0n973569isapi9irgabm3lc80z-js-jquery-3.3.1-doc
  /nix/store/5lbz62bs2p1ppj65q7c2ibps8vvn0qdd-kan-extensions-5.2.6
  /nix/store/l6c9cbslxm3pilscm4jqqxmk7k8kg1x7-kan-extensions-5.2.6-doc
  /nix/store/laryjwvjl934mlv503g3n1mzfak4jgpi-keep-sorted-0.6.1
  /nix/store/cvbl7cgisiywca874apc6qilahb5kr6d-lens-5.3.4
  /nix/store/ahiryhcx78rq0zi17skyng875kazc7ha-lens-5.3.4-doc
  /nix/store/vbyfww2y9s8x8q80fj6wv464kz5izf6j-lens-aeson-1.2.3
  /nix/store/x5r33wccdrqg9haz4bn57c4r0a68arkj-lens-aeson-1.2.3-doc
  /nix/store/cacml0j41d0zkj043va8ryg29cfs3s0j-lerc-4.0.0
  /nix/store/p8fdrwah2spzb8i0f666bn7lpm1ccqj7-less-668
  /nix/store/2yvh4kwhfd65dcd3r6y6bgdwclfndvzr-libX11-1.8.12
  /nix/store/4gybpyd4avw8hz8gk0fhhkh2pk06rm6d-libXau-1.0.12
  /nix/store/rl14lfb8yhxxajpvlkp7ymvy2gy9f1lk-libXdmcp-1.1.5
  /nix/store/2v2nlnxm34grn5iq1s1n4di9vsn3k4si-libXext-1.3.6
  /nix/store/73z88bd7ad3qqvyy7j1rgflvpadqzkqi-libXft-2.3.9
  /nix/store/279a53jiv7pg1bds2ln3zl5ipmmfv9pn-libXpm-3.5.17
  /nix/store/x9agy8k80f2d7qcds6rhrqrv68xqcqiz-libXrender-0.9.12
  /nix/store/y3qhvjg23hq8j7b0z4ixp076sk4l83rv-libaom-3.11.0
  /nix/store/xsr9bwrfr0yz4s61qjr9jx8wv1756bgk-libaom-3.11.0-bin
  /nix/store/rjb0brw6yy6hjpjj006qbl9m1z26pci0-libaom-3.11.0-dev
  /nix/store/b7lgmwg8dcm6qvi62sncv1r9k7pl70vs-libarchive-3.8.2-lib
  /nix/store/vn4zlycwkh6kvds89l34mb04nd6dc055-libavif-1.2.1
  /nix/store/y38l4arx7jj82splqhcna30w8484inlb-libblake3-1.8.2
  /nix/store/hkj8hw50n2jafdd9ls7ibq09lddgkgnv-libcap-ng-0.8.5
  /nix/store/s3a1b4z1g76ghg8lx7n9x1x737fk50yk-libcpuid-0.7.1
  /nix/store/crxsllsl4kg5p0001gfal6a58yxmhjnw-libdatrie-2019-12-20-lib
  /nix/store/ck7khcf4za0whllxl5v2p0g5qcfkzzmh-libdeflate-1.23
  /nix/store/ka48qwfbrhac03afnw6pcmnfq11agwpr-libevent-2.1.12
  /nix/store/a7qf1v4q79pqvkx66ra8dy36anrd7nmw-libffi-3.4.8-dev
  /nix/store/dl9967vkjl6i3k3vc8hyh01yvawwsm4i-libgit2-1.9.0-lib
  /nix/store/4iwxcmla6n5yzwbwj57jkhas92jrjb1q-libjpeg-turbo-3.0.4
  /nix/store/lagazc9fy36vg2h9dh7rjxd3a19az0m7-libmicrohttpd-1.0.1
  /nix/store/h8xdapcbh1hgqrbcs1xbfamxgx4wwrj3-libmpc-1.3.1
  /nix/store/pi5lc3mghn6m2c8x2psvp6z9m1cmbapc-libpipeline-1.5.8
  /nix/store/8a6g04hk9jbq2cpx7afpl1j9f2q6h5sz-libpng-apng-1.6.46
  /nix/store/5njwabxkp1adj6q55a0yhncj51mnzib9-libseccomp-2.6.0-lib
  /nix/store/7alkpy53ndwgg2j1548vlgc3j6pzmjkj-libselinux-3.8.1
  /nix/store/imwag50h7nn22kvky64v82i6c5bfgxql-libsodium-1.0.20
  /nix/store/w8mfdhc191qmajj92g6yi0izqzvacj2w-libtasn1-4.20.0
  /nix/store/qyz709rdi8pdai3krdmyppaw6w21bjsj-libthai-0.1.29
  /nix/store/f5ijn1z4aih5gjby8xr2264p1y8gnn46-libtiff-4.7.0
  /nix/store/aj10j7rli4yhdfpl1f7yw31rkq4ha7yk-libtool-2.5.4-lib
  /nix/store/j3y24dy35j88w7vk1cnf3lf1g3w9r2c9-libuv-1.51.0
  /nix/store/xgkmxh2vg0ff61y8ngdcx73i58zs0fmg-libuv-1.51.0-dev
  /nix/store/1f3i1xmh7mc7llqgzryhgm4cfzsbyisb-libvmaf-3.0.0
  /nix/store/smphwkfmvcw623296s39lnj6ahvjbh28-libvmaf-3.0.0-dev
  /nix/store/0mj66hc9mf2bfj9d0v8mis77d51c7kzp-libwebp-1.5.0
  /nix/store/5wbk6hz3xcxkhrndryxkh1p1ms0k20im-libwebp-1.5.0
  /nix/store/xwd1s74zk3bwilv4p02284ckyy319vhz-libxcb-1.17.0
  /nix/store/cvd68krxqrwgrsigszs0al2i8dnvlwk4-libxcrypt-4.4.38
  /nix/store/f35fr3iklsi4kb4jznr025bzrksg1hms-libxml2-2.13.8
  /nix/store/6ckh2f3fjlcqw966x66wr042l67iia1g-libyaml-0.1.4
  /nix/store/5ii808v25prqkcfixdjqdzm82a3ml8qd-libyaml-0.1.4-doc
  /nix/store/zrlqnpwy62jjnk8nna8f14i92nj5zdjj-libyaml-clib-0.2.5
  /nix/store/yb0da9d5xbvpjdpvai5yajsrm5728iy7-libyuv-1908
  /nix/store/igij0b49dymgkaryvq3vwayklc77q73f-lifted-async-0.10.2.7
  /nix/store/y47qgw77vmmvagnz2495qhr5z1sq9xkv-lifted-async-0.10.2.7-doc
  /nix/store/mjgx67mmcp65dmiigw10fvvyf7258vy5-lifted-base-0.2.3.12
  /nix/store/i1c3ihy6ak8kznsqz240jc64ssp48i2j-lifted-base-0.2.3.12-doc
  /nix/store/dlfjyqx1c99z7szp881jpnzbakw8m97x-linux-headers-6.12.7
  /nix/store/ainsif7pamzrmhjb65f8jfx7c3fd1fqm-list-t-1.0.5.7
  /nix/store/nqqywsa2085qv53bmp4dnmpphm9y4rzq-list-t-1.0.5.7-doc
  /nix/store/6xk5plhj8i31xky6n4318r9720aclvhv-llhttp-9.2.1
  /nix/store/hqd6vbajkgl0zsnfdk3v3in8nszh1qfl-lndir-1.0.5
  /nix/store/q2jrhil9qirwjxdwzmpbgf3k59rai7n0-logging-facade-0.3.1
  /nix/store/12cg3b0sc41z3xigljzyl6idsnb8yxnj-logging-facade-0.3.1-doc
  /nix/store/26bn58h3jh46cljyrlvya3ysrq9y04hg-logict-0.8.2.0
  /nix/store/ar57yk0mws7dz1w0lf4mya8xc2sccch3-logict-0.8.2.0-doc
  /nix/store/d7rwmcrxibwyvfrdy8cs6x1lzl6w17aw-lowdown-1.3.2-lib
  /nix/store/fichlly4xps5vgldgxspjg2i9915m8m5-lsp-2.7.0.1
  /nix/store/4xyd40212jniicayywkgcwlmpfj3d2kn-lsp-2.7.0.1-doc
  /nix/store/qanifwwivgj4zsfg6gihj0b2p912my2s-lsp-test-0.17.1.1
  /nix/store/b32qypqpzl7kcxk0ihd404g1y8ix9dzx-lsp-test-0.17.1.1-doc
  /nix/store/iblmmv16hig4rxkydysbrvybspjsj1c1-lsp-types-2.3.0.1
  /nix/store/00fvrq3cxapb8pxaidpfwazf024m4qdk-lucid-2.11.20250303
  /nix/store/rizqd8y944p20p6006i64daa4icf6bjz-lucid-2.11.20250303-doc
  /nix/store/xyk2c2yisfzmc20rvcrp7gaacfc9y8dh-lukko-0.1.2
  /nix/store/c8g40y8g3yb9yyz90jk98gjjl52yrj29-lukko-0.1.2-doc
  /nix/store/4kw98q84pbv2nwq3ay12aavfa9zi4d9z-mailcap-2.1.54
  /nix/store/iw8i9xxh37lhx7sg2pmnw54gmmvcvd2w-make-shell-wrapper-hook
  /nix/store/c0f2wpa3h99yrjhr0lzxgb3hlans4yb6-man-db-2.13.0
  /nix/store/l7h22r206m627prqzjbz8g9mwh8qlvz5-megaparsec-9.6.1
  /nix/store/71a69ncw41dh9ad2i7n94s9kylgw5zqa-megaparsec-9.6.1-doc
  /nix/store/p8y6kj0gdbl24kbdz45gxndbwpfhs05q-microaeson-0.1.0.2
  /nix/store/0bjbynbmzhqb0cqviv23rcl29xvz3vif-microaeson-0.1.0.2-doc
  /nix/store/nyz3gfl1q203blbpvp9p1nsnp091ndsj-mmap-0.5.9
  /nix/store/m19j17vl57gxcn69swhcz4js2m48qqab-mmap-0.5.9-doc
  /nix/store/2z37kwaakxx7rv9gbzidzpjfrhx2ijjr-mmorph-1.2.0
  /nix/store/aj4710rxfnxw996aw3z5mmfz96qrhb7w-mmorph-1.2.0-doc
  /nix/store/abfhh92nhw6anlajrfraci9ipmls9qg3-mockery-0.3.5
  /nix/store/x4xyq2k3spk4hzlv8ihx4pv0md6cbdrg-mockery-0.3.5-doc
  /nix/store/lsm3rsbkpkjpdvmn29z2gwbpk4jps93n-mod-0.2.0.1
  /nix/store/sa3c1f4mkgjn8m37p97r25cf50v8f0ld-mod-0.2.0.1-doc
  /nix/store/6fi078iwp0bnf2cmp38rn63cyjw3f117-monad-control-1.0.3.1
  /nix/store/424wq9xw5b75rvgspjd678sy1nl1phwl-monad-control-1.0.3.1-doc
  /nix/store/d62asgzspaa7336vpi8clck1531cwi1r-mono-traversable-1.0.21.0
  /nix/store/q05nxwf4xfcw1iwcph9lziljs9faradx-mono-traversable-1.0.21.0-doc
  /nix/store/6whdgqs1bxl3nj3p4pw7m7ygywv8dx6z-monoid-subclasses-1.2.6
  /nix/store/yx1a42k4bkmslj5z57hgsy7hh9l1wmsi-monoid-subclasses-1.2.6-doc
  /nix/store/68bgk51v8baq44lqb3ps74b7jpcgc30z-mpdecimal-4.0.0
  /nix/store/bgp9znk5cnzmh0fbb2l0rwclbz2qv0w8-mpfr-4.2.2
  /nix/store/jbc7djw77c1mp62hc37lcfgbzfi1pvyy-ncompress-5.0
  /nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5
  /nix/store/hgc91dkd1iqjdic0s55j1j2rycxd20k0-ncurses-6.5-dev
  /nix/store/10jlvwj869vdcgk9kzgxxficq81y7bzm-ncurses-6.5-man
  /nix/store/pbsv3vr6s0l31j582z2080r5zxyan7h3-neat-interpolation-0.5.1.4
  /nix/store/a1kf6qbkp5kxpj3icnwl9d73lnz7i87y-neat-interpolation-0.5.1.4-doc
  /nix/store/dlq6da0kanx17zih03cbkwz61y8ijfjd-net-tools-2.10
  /nix/store/hfwp8v0hkf1msb88xxak64kwsskbg5id-nettle-3.10.1
  /nix/store/79j405fi824qk664mh9lyvyzi58bspkf-network-3.2.7.0
  /nix/store/07wjbhl3cj9vkl44kwwxlvd5j6x1s38i-network-3.2.7.0-doc
  /nix/store/5j3hqg6yx4ivzcpvan5mw5by0kwpf614-network-uri-2.6.4.2
  /nix/store/7i61k32sgy7gjgm244rrvfqw67zwa0by-network-uri-2.6.4.2-doc
  /nix/store/9kl7bwbna1d9mxd2yllysw5q860ag5ls-newtype-generics-0.6.2
  /nix/store/yvz7nwc7kswwl71f3p4s65ngvhiavkrk-newtype-generics-0.6.2-doc
  /nix/store/baai0iy8l2j08zx05ydwz4cf0qgyllx7-nil-2024-08-06
  /nix/store/x92x70hdpnpdblgnvpyar7nbvp8h74nb-nix-2.28.5
  /nix/store/hb74b7w63fdcc69213qzr2mc6x4wr0k5-nix-2.28.5-man
  /nix/store/righ0a5sp3swjn2xr59zibpqa8hg85jf-nixos-option
  /nix/store/s0jzinq4ym2l1n7mqf0j0chpcc9caj08-nodejs-22.20.0
  /nix/store/xa1dr7cjlg1cczxwsc5zmw81s9yv816m-nothunks-0.3.0.0-r1.cabal
  /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
  /nix/store/f1inivd1j4s7js0xvc7kg5mxvrwh5ibf-old-locale-1.0.0.7
  /nix/store/8v129s1hg5r2m6yk8x42219q4grvx7nz-old-locale-1.0.0.7-doc
  /nix/store/27madh8va6rpjzhhx9w9rfb8qr68bh1m-old-time-1.1.0.4
  /nix/store/3wj1q8xp6vdm2a310hm10za1b59a14mb-old-time-1.1.0.4-doc
  /nix/store/5540mrdimy0hzz8zd3j1r622bcrxidz0-oniguruma-6.9.10-lib
  /nix/store/y490z63bh4d0yqh55fqvplnkn9kfda3r-openssl-3.4.3-bin
  /nix/store/dhrylylhir0cy7a0scg1zmq0gbq3lwpm-openssl-3.4.3-dev
  /nix/store/66bm06jqzcz010svgn4wlxgl4gbsmg67-opentelemetry-0.8.0
  /nix/store/bap22fv6xqflgffjhjc7bmza7sar6fyc-opentelemetry-0.8.0-doc
  /nix/store/xykynv36ax77x5g0ld5i2jp1dnq9ybn7-optparse-applicative-0.18.1.0
  /nix/store/r2k2csd684g5axz95n4g3v31zhavrlih-optparse-applicative-0.18.1.0-doc
  /nix/store/9yldp9sxzi8bgsiffaxh080d0gp7lfrx-optparse-simple-0.1.1.4
  /nix/store/jxqp78rmqkzcivlf68dycadhl9m5bdvm-optparse-simple-0.1.1.4-doc
  /nix/store/3z07arviz8y5fyl2568akykm9slrjr7a-ormolu-0.7.4.0-bin
  /nix/store/f46cjw7zid58lbgn1acslmrprwdh5rfh-ormolu-0.8.0.0
  /nix/store/wk2sh5p4j0rm939dbhdz46qkfnbvqpc3-ormolu-0.8.0.0-doc
  /nix/store/mr2qlbg1005kpgcq06jfmcll69zzfav4-p11-kit-0.25.5
  /nix/store/jphjx778qgmsa5awgdal5vmxan2ay2iv-pango-1.56.3
  /nix/store/yx4ffgcraw0b10831khd2pwqbiqlch87-parallel-3.2.2.0
  /nix/store/nq87vwbrvwrj9nilvw95a6a89b8srdbl-parallel-3.2.2.0-doc
  /nix/store/yp8r1hx3jb28m4dx9d7icw2mw052bg2g-parser-combinators-1.3.0
  /nix/store/84n6irnzzz26gsh0w1fd0cg4rnhnv6wb-parser-combinators-1.3.0-doc
  /nix/store/xcqd1qdp761cwvwzlcihz5raqvql3dbj-parsers-0.12.12
  /nix/store/01cg43c1v3bfnw3camg6gklvr8ysmv6r-parsers-0.12.12-doc
  /nix/store/k9lfh0l007sp61rag7d9bf3nn5bg3qy7-perl-5.40.0
  /nix/store/dkj8lkhrnxszlqrfhp72isf4gbh011wz-perl5.40.0-Authen-SASL-2.1700
  /nix/store/cpmmmdmdqwssg63l87ry66gqa32dy251-perl5.40.0-CGI-4.59
  /nix/store/xm50jlvjhvfgafac1bgg725mzx1ha7zy-perl5.40.0-CGI-Fast-2.16
  /nix/store/sa3nxi77fbvhsqrsyrh9jank9qlvpqd2-perl5.40.0-Clone-0.46
  /nix/store/rcm5xr7jbv4ppd52xxkhf86ljvkszzij-perl5.40.0-Crypt-URandom-0.39
  /nix/store/dyvvj190jffvi40qqgfqh6pjnhpfalx7-perl5.40.0-Digest-HMAC-1.04
  /nix/store/9hkmjwiwmzjhc3bldlzjfllx35kb0z72-perl5.40.0-Encode-Locale-1.05
  /nix/store/bfaj5s5p74d608q7v6b62rv4gnbcw4zc-perl5.40.0-FCGI-0.82
  /nix/store/d6qwk9wlslhisb7imqq5gfcqppf1yhlh-perl5.40.0-FCGI-ProcManager-0.28
  /nix/store/cs3bmq8ppvm13icjdwdp5f753j663ck6-perl5.40.0-File-Listing-6.16
  /nix/store/ka4vb8g9byjyhz6fwb1567jw34kv8yxr-perl5.40.0-HTML-Parser-3.81
  /nix/store/znd3lz8b5nkqb80ymrrxf0p3v2d4klm8-perl5.40.0-HTML-TagCloud-0.38
  /nix/store/wyfc8fx4h9fw9jscjb69pldxz7npy948-perl5.40.0-HTML-Tagset-3.20
  /nix/store/1yzyw24zirzv7p3fb9aikik9hpg2yl6i-perl5.40.0-HTTP-CookieJar-0.014
  /nix/store/gjaa2wzl71i6j2mi6f7dyjigpw7iqa84-perl5.40.0-HTTP-Cookies-6.10
  /nix/store/ggj3jz0vspp622bllbd9q98k30rrjhvj-perl5.40.0-HTTP-Daemon-6.16
  /nix/store/3lwgl9b6mv8rnqn9bnrjkj7m6h1p259p-perl5.40.0-HTTP-Date-6.06
  /nix/store/9r8a8rfwgf39vz0i8nl4fw51nik3rn37-perl5.40.0-HTTP-Message-6.45
  /nix/store/3d43mg79p6j94pi1ids55886wpzvhypn-perl5.40.0-HTTP-Negotiate-6.01
  /nix/store/hp1khv252qq4mf8bca6mgwnddjhk4xwi-perl5.40.0-IO-HTML-1.004
  /nix/store/vyjsqcmiy5d5xz1m8dlyhc4dh1hf0x3w-perl5.40.0-IO-Socket-SSL-2.083
  /nix/store/ngvraf6n06mdc2arhcaz6hqc6i9n55c3-perl5.40.0-LWP-MediaTypes-6.04
  /nix/store/0snbyniwb1r3cnjl9x9nbif0gfhmwph0-perl5.40.0-Mozilla-CA-20230821
  /nix/store/ph5pv9f7pimg7pj8zb72fslinlmlsdda-perl5.40.0-Net-HTTP-6.23
  /nix/store/nybj8mlvvy2dg5mz5fazrn96amc80bn2-perl5.40.0-Net-SMTP-SSL-1.04
  /nix/store/41val8hvldpsba2p5h968qxvkcbdc2ka-perl5.40.0-Net-SSLeay-1.92
  /nix/store/34gjbw1i8m18s7qbfv3x17qzmrps1iqq-perl5.40.0-TermReadKey-2.38
  /nix/store/pvcgn24aldi3jpib51va7kgay77iy565-perl5.40.0-Test-Fatal-0.017
  /nix/store/2f26afhylw5929dzsw3sd6yxqnv7jc0a-perl5.40.0-Test-Needs-0.002010
  /nix/store/fg9kf6i51a5d0a526lh81x7vlp4sn6gj-perl5.40.0-Test-RequiresInternet-0.05
  /nix/store/55hq32l96ck1jgfdq2q0xa8c82gb3cmc-perl5.40.0-TimeDate-2.33
  /nix/store/gni1fvxkj5cn8qlj27qz30hz1ilcf826-perl5.40.0-Try-Tiny-0.31
  /nix/store/ifk5d3lg114pqlm5j8pyhvvj19652cmn-perl5.40.0-URI-5.21
  /nix/store/r5syz7c6hpviypkpxsmlxnfvhc8f9s4y-perl5.40.0-WWW-RobotRules-6.02
  /nix/store/3r0yzwy2cbwmmvqdhn3rz72rzwg719g1-perl5.40.0-libnet-3.15
  /nix/store/6pi18h9fngcwyhh6sn19cqsgwd9r4d91-perl5.40.0-libwww-perl-6.72
  /nix/store/89f2cpa92syklzh88wrphnj6az46hrv0-pixman-0.44.2
  /nix/store/y6229rfrjkn65jd1918q0gfcapxqls44-polyparse-1.13
  /nix/store/03jx5i9a0qhl8v0avd2891y8b78fpc2k-polyparse-1.13-doc
  /nix/store/1v83kfdr30f4vi0d1nfsqpg3c8h5d3ny-prettier-3.5.3
  /nix/store/xpz4wl2qkkp77svsazhvj1rj7msnjrbl-pretty-show-1.10
  /nix/store/vb6n1cvfqackckh6yzdsi3nszc4wzvb4-pretty-show-1.10-data
  /nix/store/ch81lb13sq51l1qhj28rnszbfh5j7nkl-pretty-show-1.10-doc
  /nix/store/qz75a3jhqs7lzxx9i97kc75b20j7gmqg-pretty-simple-4.1.3.0
  /nix/store/fyz9z1s1b9jf2xldiqr6vliyfirsm259-pretty-simple-4.1.3.0-doc
  /nix/store/1g0ydwds8l52nqdj3jqyxjndm2vj3i0d-prettyprinter-1.7.1
  /nix/store/f59cvb3azcy99bpwpyhsagcyyrlzdgz2-prettyprinter-1.7.1-doc
  /nix/store/55w43cjj0xhbqyy5c5y0ap6szs9ymbbp-prettyprinter-ansi-terminal-1.1.3
  /nix/store/5kw54i7zrn3rp3jqqnpaqnb7b726xszx-prettyprinter-ansi-terminal-1.1.3-doc
  /nix/store/3xcfx6ja61przk3c3zrr2wpx1rlqqp8h-primes-0.2.1.0
  /nix/store/5g5v3jm58y4qblr4z1fih17bmwm7hy8f-primes-0.2.1.0-doc
  /nix/store/6naj6c7b1i7n4aadha7y21w0vsi663ic-primitive-0.9.1.0
  /nix/store/sz74n46f77q43c46v70ig5ykyxb59b8n-primitive-0.9.1.0-doc
  /nix/store/hd3dvqf8jq3xyr607ccac4qby7dzvvd0-primitive-extras-0.10.2.2
  /nix/store/iw05bbmi6g397wmd3gchpfwx4yffbz7m-primitive-extras-0.10.2.2-doc
  /nix/store/nca4i5a2bkybdrahkq16b828bwil9vj7-primitive-unlifted-2.1.0.0
  /nix/store/69f8dh68x4m51mq3pn7p3zvd80kz0pl3-primitive-unlifted-2.1.0.0-doc
  /nix/store/2rmx2zzck3l0vm4v3j91kbnynqz6mhsn-process-extras-0.7.4
  /nix/store/6kq1hn557w08zgxa9h3ssidqpfcg9rkk-process-extras-0.7.4-doc
  /nix/store/w6jdnki0dksxaj8bb1xwiwdwsyzpx8s5-profunctors-5.6.2
  /nix/store/cj7c03gpivb8pcdqwcd28ajj1gxrqi5r-profunctors-5.6.2-doc
  /nix/store/kf5v9rymcwv753pa8hhhivcj4ndlw7a2-project-manager
  /nix/store/jd20rkmqmkfkcvk2wl2lmzz7acq4svlr-python3-3.12.12
  /nix/store/bjd354fpfl0ji9axfjhqv9vrzhgk1gvv-quickcheck-instances-0.3.32
  /nix/store/akx8njmx8m5wdzv2a8qmfc0cc293h5yk-quickcheck-instances-0.3.32-doc
  /nix/store/rdyclnza81hs6dvba743pc1zri6zlx9n-quickcheck-instances-0.3.32-r1.cabal
  /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
  /nix/store/jwx6psrfazdhc594x8panawg1fbsl65v-quickcheck-io-0.2.0
  /nix/store/h2l1csxwpk8sg65jgrd5dgv8d7hqy8l7-quickcheck-io-0.2.0-doc
  /nix/store/7jy5rmj94d2cwbdxrc4pnwxkkdif7z5i-random-1.2.1.3
  /nix/store/44ckhkd5q2bjs02sir4wfwi6mb5m3d61-random-1.2.1.3-doc
  /nix/store/gjzm7r9g1qwl5aq2l7ay8n42y47g61ns-rapidcheck-0-unstable-2023-12-14
  /nix/store/k8c60f1c543yng7878rfkc12han58hiv-readline-8.2p13
  /nix/store/370db4ypfsxk6fx6w9bndp40v8kiw7cr-refact-0.3.0.2
  /nix/store/7h99psqc9bcdia6dylz3r5pj2svvps37-refact-0.3.0.2-doc
  /nix/store/7d7fiy2wylqgyvjigy5vd0i5gmka427r-reflection-2.1.9
  /nix/store/m1hrkbmmck308kfpm48p600pqs4mkgyf-reflection-2.1.9-doc
  /nix/store/jg7r899q9in9ma0ixizsyfzwz0293x9n-regex-1.1.0.2
  /nix/store/gwkdbp3lmaiamqa0q9rs5nrbrqdzjllp-regex-1.1.0.2-doc
  /nix/store/mi6a7hfbvibpl9b0v5zc3zbqg9y6gwwp-regex-applicative-0.3.4
  /nix/store/qx3c3cdbsg8p0ys86dvz652mkr86mmls-regex-applicative-0.3.4-doc
  /nix/store/z4sdhq56qydyic97ina0mz8hnvfmy66f-regex-base-0.94.0.3
  /nix/store/q2732wlr9zsnydyvifws6afb4m7b6a67-regex-base-0.94.0.3-doc
  /nix/store/jcxjkb144bwnkyqfazgij2g0d95n7jwv-regex-pcre-builtin-0.95.2.3.8.44
  /nix/store/l5s2s6jj3n03myanmr9b7f8azz7xry69-regex-pcre-builtin-0.95.2.3.8.44-doc
  /nix/store/q8qhaq9g7ml1ccin7m5h9clpcx6lsng6-regex-tdfa-1.3.2.3
  /nix/store/98vn6dk1lj83rhv64dp3sz16mpybdn6a-regex-tdfa-1.3.2.3-doc
  /nix/store/8p1hb3kwai3xcj5mmxc0bzr7jpkvjgj0-relude-1.2.2.0
  /nix/store/331cyxny9sl1czvs27kla2h7nlp2f4hf-relude-1.2.2.0-doc
  /nix/store/jrc53jks2ab6qzqw9lvgh8qcs21xh39q-remove-references-to
  /nix/store/adj29y5x83ah5hrxc71zly9knxqyh2sy-resourcet-1.3.0
  /nix/store/x0y8yxddm1lyjx5bi1fd091qjlf1cgbv-resourcet-1.3.0-doc
  /nix/store/9bpvskhwpcwm2bkrfyb3kcqhxxydmrgi-row-types-1.0.1.2
  /nix/store/khfl83fc9xdmd8b6zffls8hnfpnvahlj-row-types-1.0.1.2-doc
  /nix/store/zvfwx5xsqc62vpq3wsq6pq035v8ivzsk-s2n-tls-1.5.17
  /nix/store/zkbw2np26vm3md0x90qn2x668dl0xhw5-safe-0.3.21
  /nix/store/7mb7j8gr001rdja1536p9k235p40w6pk-safe-0.3.21-doc
  /nix/store/9anwbb8my8k1as3lmbrgnqk0brwhccw5-safe-exceptions-0.1.7.4
  /nix/store/pddm7n3rmb8g7j8k39r701i0bpx5ykm3-safe-exceptions-0.1.7.4-doc
  /nix/store/i7zisx8hpdkk242vkrmkmx0k80sx7adq-scientific-0.3.8.0
  /nix/store/xllixqrh4b7pd776r0260xncr9cwd9d1-scientific-0.3.8.0-doc
  /nix/store/4gdhmwi6qyrx6n153qkz9lgralf9hv61-selective-0.7.0.1
  /nix/store/k42s05mk195v1pign6a67fsy49a3372x-selective-0.7.0.1-doc
  /nix/store/3492k6ifj705qq3x8ni563mf8jsj2p0l-semialign-1.3.1
  /nix/store/llycccbp8q7kjxvrmwwfhhfxhbzqpmds-semialign-1.3.1-doc
  /nix/store/i6yr5blpyjfpn2isi2n1fnfmqn8qrv0f-semigroupoids-6.0.1
  /nix/store/v866yqy7iy0rk35b0snajsww4zbr90l0-semigroupoids-6.0.1-doc
  /nix/store/qz9w89siywrm039w6zawgr9hdbw4a58i-semigroups-0.20
  /nix/store/gsv623kvqr7bnx511nn75w4zgmp4cqwf-semigroups-0.20-doc
  /nix/store/4a17c75yhfh3drqw9ldji8i8nprb8fjn-semirings-0.7
  /nix/store/bvjadim9w886lprmd19xmijbj00vvm9n-semirings-0.7-doc
  /nix/store/amfs7ad9h4zkxwdiz9pnxsl4lzi9rcb4-setup-debug-info-dirs-hook
  /nix/store/129blsi86ngrzhrxxrpbq3i4p80avwz3-shake-0.19.8
  /nix/store/84hmqn3x9v4h04ghsd50fr2dna8bfiwz-shake-0.19.8-data
  /nix/store/5s3jv1ccshz73dwzb37m15wzgqwsgqgl-shake-0.19.8-doc
  /nix/store/yjjsam4isbmf38nzw055sy19ayir49hn-shellcheck-0.10.0-bin
  /nix/store/2iqqqiv17dldcjhv9c0803kzjr1a0h1z-silently-1.2.5.4
  /nix/store/ylv19zca2sz622w015c2ph1r76g4kbim-silently-1.2.5.4-doc
  /nix/store/r5byynxki49k1dxrjiams20lbcc3111v-slist-0.2.1.0
  /nix/store/p1chyvkqmniv13hzgkbnj6y8daj3p7cj-slist-0.2.1.0-doc
  /nix/store/i6fp8aqa3c2a3xmw6r1wrgbb9vabsr4j-some-1.0.6
  /nix/store/398z5a16c0zwx3382dai0frlk3v1vzy8-some-1.0.6-doc
  /nix/store/sd3prqk07hyd0jad27c3g331k3kqqrw1-sorted-list-0.2.3.1
  /nix/store/givqg3adscd6n9zg48nvd4ms5dpkqbas-sorted-list-0.2.3.1-doc
  /nix/store/nvzr87j4yrr1v66qzjz2m1qr217f18fh-split-0.2.5
  /nix/store/vcp9ijhb689ffxiqddv73h7q0ldsd6y4-split-0.2.5-doc
  /nix/store/c0i5jayvp308xpd4ic4l9m8cy9l08rfl-splitmix-0.1.1
  /nix/store/ah2hr8nz29q277i6jc3rbslmnkq77m76-splitmix-0.1.1-doc
  /nix/store/ks3slx52c0jmfgg717n0jq9lp354mlnw-sqlite-3.48.0
  /nix/store/17qrg8r0mpynmz06lx60fgs8g6dgbb3a-sqlite-3.48.0-bin
  /nix/store/x8r21k5xskd7647wzb625g3gfxrj97w8-sqlite-3.48.0-dev
  /nix/store/y7sfrsbbv1iiibldn6hmsa3c0xkxp9pk-sqlite-simple-0.4.19.0
  /nix/store/adhl1mp0jkipzvd63cjvpyprgwcbliqx-sqlite-simple-0.4.19.0-doc
  /nix/store/b8qfkszgly5i4xw6iy58aakykwizjp9r-stan-0.2.0.0
  /nix/store/lfwfj17y9fpjb73nsj2m35rmkh587a0x-stdenv-linux
  /nix/store/b41r12sz45kwihimbr0vppnv3pbwg869-stm-containers-1.2.1.1
  /nix/store/4nikdc7gzglj91b3fwljxrrk369sc8i2-stm-containers-1.2.1.1-doc
  /nix/store/hgcgnzi2hkb39qc67mc3yrm8gj1672fw-stm-hamt-1.2.1.1
  /nix/store/ri5wi93v01w3gd8z66bzsslksbvraiw8-stm-hamt-1.2.1.1-doc
  /nix/store/p1lcnr10xkqj91qwrx7h2vwpl0n4bfcb-streaming-commons-0.2.3.0
  /nix/store/dk924y9x6hh7swikpp1gjra7wxfmcj8a-streaming-commons-0.2.3.0-doc
  /nix/store/jbrwq60i8p3vggylw33i8vw5azk872if-strict-0.5.1
  /nix/store/z5risz35a0ivvbdir23brdswblsfcabg-strict-0.5.1-doc
  /nix/store/yfrj5wm73crh0sh6agp5ni6y44yiqkpl-stringbuilder-0.5.1
  /nix/store/aw5s88wg8z8c9jky5q3779bz9xz37mfi-stringbuilder-0.5.1-doc
  /nix/store/mv6nv9p58cfan9bjddvlkvgfrmwha1ln-syb-0.7.2.4
  /nix/store/23j1myrqz4kja5zrpg315a74xhjpg7ba-syb-0.7.2.4-doc
  /nix/store/ki2lrj6qyg9laqhvby34jwbcwnx6n733-tagged-0.8.9
  /nix/store/qnwrirkqnzmw3kirk7mqikhqf4qc1ppm-tagged-0.8.9-doc
  /nix/store/0kva63pa4y3jvmsciy4pw6pji11nsgc2-tar-0.6.3.0
  /nix/store/m0dg0kwwr1dimdn97qjrqqqjb6cmza5y-tasty-1.5.3
  /nix/store/32x2vm02nvmnsym4icgany6r075a1jcb-tasty-1.5.3-doc
  /nix/store/blbh66mv2p3hgk1g0r4s2l2cv2hawiz4-tasty-expected-failure-0.12.3
  /nix/store/brmfvky017w9fv928j29q7y6pgm1fwdq-tasty-expected-failure-0.12.3-doc
  /nix/store/mzn32qnr4jnjd7dcwca7c68284ykzynf-tasty-golden-2.3.5
  /nix/store/dpywqgcj6p9q5y2694p5fsr8cd149fsf-tasty-golden-2.3.5-doc
  /nix/store/2yn7sjhs9xls74p0dnbxkjhrfh1z4bad-tasty-hedgehog-1.4.0.2
  /nix/store/5hljn8waa27ihk3a4f766ldy8jgbxzn4-tasty-hedgehog-1.4.0.2-doc
  /nix/store/4iq6m8v9d3mjx0560lgkwz1pm6hpshr0-tasty-hunit-0.10.2
  /nix/store/sz43j41wrzlx3s5zznpw70m71bvppx9j-tasty-hunit-0.10.2-doc
  /nix/store/9kid16psxv3ac92gmvjwnfqncrfyyf2a-tasty-inspection-testing-0.2.1
  /nix/store/7lbz8vrk33inhm3k4wqrypmpzlb33s5j-tasty-inspection-testing-0.2.1-doc
  /nix/store/k6zy18mmkkw3mqnq74rmwd4rdi73dfr3-tasty-quickcheck-0.11
  /nix/store/r0i5jhs0krppykr7rpyd4c9wrj4imrsc-tasty-quickcheck-0.11-doc
  /nix/store/rqqs2h20ms83lzal7w3vkx76ybbldzfq-tasty-rerun-1.1.20
  /nix/store/n2c6jv19ydqs2qsbniw2lji4wl6i16l4-tasty-rerun-1.1.20-doc
  /nix/store/k89i56m6xryzi4cp5szdqxi39v82mk5p-tbb-2021.11.0
  /nix/store/1v1hww4wcl2h88fx8dv8lg2wkp4rb9n5-tbb-2021.11.0-dev
  /nix/store/i881scqi2iqjm2n3y85624marbaa5liq-temporary-1.3
  /nix/store/dxv978ybby5k4rn0jdxplmvn6r3zx34a-temporary-1.3-doc
  /nix/store/w974qznk4s5kr2y80c2hx49cz482s4fd-terminal-size-0.3.4
  /nix/store/2y995qm8spzlc4n0kgb98hf8m0rnrkvk-terminal-size-0.3.4-doc
  /nix/store/xzs0h3bwcrkqy40x8qxpymcym60dh7xw-text-iso8601-0.1.1
  /nix/store/wsn1nvbrx1sjfrv2f96n1x8dmp0sx5vy-text-iso8601-0.1.1-doc
  /nix/store/dpyq8cjszc5infx2v39y9z4ii8mv31fk-text-rope-0.2
  /nix/store/h3nr6k2ndyr35rm0ywvf7czn75v295za-text-rope-0.2-data
  /nix/store/fgpi87dd52vaqc6vrzdjhlinq1mbjvdk-text-rope-0.2-doc
  /nix/store/a4m5kl0prlgp0s9nh3xhj68xvcvhp4q6-text-short-0.1.6
  /nix/store/gsjqfc4d77skb4a9v9rcpfs1f193x7gg-text-short-0.1.6-doc
  /nix/store/qb0kdq6l5082wyi0vk9vy40blzx6fsrb-tf-random-0.5
  /nix/store/0zqmybjrqxrawmiwmwi3npwqhf0vzs4x-tf-random-0.5-doc
  /nix/store/pd4mqm4x1kpjj4fzawi9l16kyjylhjgp-th-abstraction-0.7.1.0
  /nix/store/nla9fk8xm9m0hwrhav8m8k7i2nhsp0ch-th-abstraction-0.7.1.0-doc
  /nix/store/1jpiinw73avdfk2jqbackvb3g0ssd113-th-compat-0.1.6
  /nix/store/pdp29pz76ih5i852pglbdcs5603zfi3q-th-compat-0.1.6-doc
  /nix/store/00y8j5k3icmii9bsxq1h0k2qk5w4qjym-th-env-0.1.1
  /nix/store/syp5lnykizihxzpk8imaky22p1r0b077-th-env-0.1.1-doc
  /nix/store/yyqj461mzbpwbkjilzy6i0hh00fpcmg0-these-1.2.1
  /nix/store/r25sbpi31s37n17h1ashcw0cdi37w6c8-these-1.2.1-doc
  /nix/store/638aw4gghdpyx88wvr6wv197mjm5m21v-time-compat-1.9.8
  /nix/store/2v33i11wwfk3dscxqv8i9n51dkhq1f1s-time-compat-1.9.8-doc
  /nix/store/mwkyywhir33pypabv5q15c7l329vakd3-time-locale-compat-0.1.1.5
  /nix/store/kfblccbckdw013zl3ypmmiji8nc2l44l-time-locale-compat-0.1.1.5-doc
  /nix/store/8jkjmg5pgvdbmlcm06l0y296ggq10k9a-tomland-1.3.3.3
  /nix/store/k9jz0innbqqp5ryd2h581wxgq66has9g-tomland-1.3.3.3-doc
  /nix/store/d8r6djnk02fn7c3zzddi45b7j6ammar1-transformers-base-0.4.6
  /nix/store/fhfkhr5gmns5x0r3z5kmy72gsac10mx3-transformers-base-0.4.6-doc
  /nix/store/1j98l6qnql4hhya968kl504gbp4g2rii-transformers-compat-0.7.2
  /nix/store/xaqk6r72qp9afxv118gsng65n6hwvspw-transformers-compat-0.7.2-doc
  /nix/store/fwvs562iykzdi02kddg62f7vk297ll4g-treefmt-2.3.1
  /nix/store/h93vmdq9m6bhynhff3k8l1v6c4a3n85c-treefmt.toml
  /nix/store/c7343g3gddsaqk5injlragf90zi81d53-trial-0.0.0.0
  /nix/store/4csilwv1d0c22n9ag0np9pwqrp4qqixc-trial-0.0.0.0-doc
  /nix/store/4ncdin24z5cc1kwy68f774qkx4aslrjh-trial-optparse-applicative-0.0.0.0
  /nix/store/szyll6hd2zlz50jray4ds50ckbw0hl5q-trial-optparse-applicative-0.0.0.0-doc
  /nix/store/axqhcyimnglv62khxx23b0fmsi0lyr5f-trial-tomland-0.0.0.0
  /nix/store/2gxnjir771gqpng5abbzzbcv3pkb82vc-trial-tomland-0.0.0.0-doc
  /nix/store/6ayyddxh48zl9w5152dyf8ad0v4zsf4w-typed-process-0.2.13.0
  /nix/store/bhqlamm38dc407gq7d81w8pv7c44c7ck-typed-process-0.2.13.0-doc
  /nix/store/2s4hpq73hn49jd84x976m3acp3rd3k1x-tzdata-2025b
  /nix/store/zysii25rs1dd8liwmrzfa4apbpwq90rq-unbound-1.23.1-lib
  /nix/store/6bl62bwnb9ny9nb8sjv3bfzwj5brknp3-unbounded-delays-0.1.1.1
  /nix/store/p3aspjkyjvxa2f8g925nywdbpmmbgh74-unbounded-delays-0.1.1.1-doc
  /nix/store/fs0ys8mahsjjrf0hl0nxdkrhfibk3why-uniplate-1.6.13
  /nix/store/z4wy2dihf8dkcldad0zpbj5y88bc88w5-uniplate-1.6.13-doc
  /nix/store/acxc8p35wfs4qwhjmx3b2akj9lsv8s2c-unix-compat-0.7.4
  /nix/store/9ggan45hyz25b1dgd65vav0dyddsp8ar-unix-compat-0.7.4-doc
  /nix/store/05dn9zmnhbxhj1wqs9n9fjrk5dgbb3yz-unliftio-0.2.25.1
  /nix/store/rfh6nc0zsrxw0smh3iqqg8g4xlc6bg87-unliftio-0.2.25.1-doc
  /nix/store/b56fmsg0kb68ln7nmxkkxvfv7br3zfja-unliftio-core-0.2.1.0
  /nix/store/cr0qfcb1zz817w4s4zcrwdwqhsrvzavm-unliftio-core-0.2.1.0-doc
  /nix/store/s5g7jf0nksz7nbzvc6h90wyvxj1nkfiy-unordered-containers-0.2.20
  /nix/store/cwn0q1l4l5va4rwj99zmipj3zkybn202-unordered-containers-0.2.20-doc
  /nix/store/25zlmz5xa3xsw61nnvnr0apygnb0jncn-unordered-containers-0.2.20-r4.cabal
  /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
  /nix/store/bklf7bsk95mwvhcxcmrwg54x1bqh9ips-utf8-string-1.0.2
  /nix/store/i789vdyjzig7ihzsn9rbp1360kina7q3-utf8-string-1.0.2-doc
  /nix/store/vviigq6ivqsvccdcqa8x6yjkjyha37mj-util-linux-minimal-2.41.1-bin
  /nix/store/18ks84vwka6v1ldjp0cnil98pyykr3a9-util-linux-minimal-2.41.1-lib
  /nix/store/xhll94m7ylb2v42xadrrrrlhrn798x0k-util-linux-minimal-2.41.1-login
  /nix/store/izqi1kbfayrajfvmsbsq5gb5qlrr65pa-util-linux-minimal-2.41.1-mount
  /nix/store/s1xwhyh16gnl7zcxmmdhjirkzwaxda3p-util-linux-minimal-2.41.1-swap
  /nix/store/iyani753r5ak51raxw4xds574xsjpbpd-uuid-types-1.0.6
  /nix/store/w2jimc7pdj205rf0k7lgyxmvlfn8crjd-uuid-types-1.0.6-doc
  /nix/store/sdrsmvdgjxh8270frrwq212wkh4w6bvd-vale-3.11.2
  /nix/store/ik2w712jcgs9n45121m6f8dhhmrr3kah-validation-selective-0.2.0.0
  /nix/store/92m52pxv8gqispfckf5c5zbf44zkwfak-validation-selective-0.2.0.0-doc
  /nix/store/f2yf6a3zxi4lpadcbq07jh4b1vz4gkma-vector-0.13.2.0
  /nix/store/61ibdhyk58w8ks0cj49z3c77vmzb6y0y-vector-0.13.2.0-r1.cabal
  /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  /nix/store/zdc1rvy9asfymfmjrrdyfbvspa2rl86c-vector-algorithms-0.9.1.0
  /nix/store/xkvr8wx9x22wd0rrpf5kdbhk9hzqbch6-vector-algorithms-0.9.1.0-doc
  /nix/store/nypv5clp5cjikf15hv4ssrzpwg0jn7d4-vector-binary-instances-0.2.5.2
  /nix/store/nc5kcrxmy5v0hbzipwp7iarkn3arl8i3-vector-binary-instances-0.2.5.2-doc
  /nix/store/525rr9izc62hzaqd6m382ffzpyyjqpmx-vector-stream-0.1.0.1
  /nix/store/4grp2z8wn38m660zlhajsl7jbvr851dp-vector-stream-0.1.0.1-doc
  /nix/store/ls9cvsgx2qbq6axak51q84m6nn24syk7-void-0.7.3
  /nix/store/c2yxvrk4sxmb8wfp31aww7fwgdszyyg1-void-0.7.3-doc
  /nix/store/bwh36sygq4k0yx7dnbqb9d3ricm4rvr8-wherefrom-compat-0.1.1.1
  /nix/store/d54d66aavjksbws2q9m4qhwcfq5ci046-wherefrom-compat-0.1.1.1-doc
  /nix/store/dmkyccgzj2am8bavhg5bc958znvp2p0z-witherable-0.5
  /nix/store/65b8wzqy2hwmiqki9nwxw60ndqv7iil3-witherable-0.5-doc
  /nix/store/pxiq1f2z48dw4h162hwh2kqxgyfvpzdd-wl-pprint-annotated-0.1.0.1
  /nix/store/fk262kxkfpi0z9bb5vbfvhiwz3y3wj7v-wl-pprint-annotated-0.1.0.1-doc
  /nix/store/415vrrldwx6lkxp4wzabxmflrs375i8x-yaml-0.11.11.2
  /nix/store/q68ndfq9jjim4circcz6sr88xggbvlbk-yaml-0.11.11.2-doc
  /nix/store/g02hirmx1b86nj46xfjfpf90nnwlm7g9-zlib-0.7.1.0
  /nix/store/5isjwp8s4csyrn5cs2m7w9mf3mdwqv96-zlib-0.7.1.0-doc
  /nix/store/ybhi1g8z643mcg5n4pkwhsihj4klk9y0-zlib-1.3.1-dev
  /nix/store/f17vj6c0s3rb57dda77p176abpa3v4x8-zlib-ng-2.2.4
  /nix/store/rigwlrg08iw071x8brffd9cq8x039k6z-zstd-1.5.7-bin
copying path '/nix/store/q7arwm1djwzf6hnlk47zg530ibnbbhlr-base-orphans-0.9.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fh4i0hrim9jpwf807kdyhfjf2hhj7vlb-colour-2.3.6-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xfxawjyd1plcn3aaxdbhcmk3gbxwkzhd-ghc-lib-parser-9.12.2.20250320-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/01rfsn8kjbhvklskpbg5c82p7id61cd1-hlint-3.10-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2y8nnf795pv6dz71mfy1ddpifsy2z9w7-hls-graph-2.10.0.0-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/chhq6a1bf9zh2x6v2hi9hsxf44nvglb8-js-dgtable-0.5.2-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gcsa0mdibmj12j7jicqrm6lwvj6wyj15-js-flot-0.8.3-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7163ps9r4h87hhyxig0g2lb1y33dgh85-js-jquery-3.3.1-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dlfjyqx1c99z7szp881jpnzbakw8m97x-linux-headers-6.12.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/84hmqn3x9v4h04ghsd50fr2dna8bfiwz-shake-0.19.8-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h3nr6k2ndyr35rm0ywvf7czn75v295za-text-rope-0.2-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5xckmr6v2gv9v1s7g8pc80lgxs62pns9-double-conversion-3.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fid5v1wd8wkrz39yp73d0hhlny2ms9w5-expand-response-params' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iwhdsy0fbsdpf9gbf5v6wa3aspl4s0sn-hscolour-1.25-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/10jlvwj869vdcgk9kzgxxficq81y7bzm-ncurses-6.5-man' from 'https://cache.nix-ci.com'...
building '/nix/store/18xb04slazjwcsbr2ryj11rkc4ahd7yn-builder.pl.drv'...
building '/nix/store/6m64ml7fg02m33z5wf8as4hr53bmzr6q-pm-shell-aliases.sh.drv'...
building '/nix/store/g1p9gxdr6s3znm58grj874jsmhcgvd7c-haskell-generic-builder-test-wrapper.sh.drv'...
builder.pl> Running phase: patchPhase
builder.pl> Running phase: updateAutotoolsGnuConfigScriptsPhase
builder.pl> Running phase: configurePhase
builder.pl> no configure script, doing nothing
builder.pl> Running phase: buildPhase
builder.pl> Running phase: checkPhase
builder.pl> Running phase: installPhase
builder.pl> no Makefile or custom installPhase, doing nothing
builder.pl> Running phase: fixupPhase
builder.pl> shrinking RPATHs of ELF executables and libraries in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
builder.pl> checking for references to /build/ in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl...
builder.pl> patching script interpreter paths in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
pm-shell-aliases.sh (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/0jmd2bmazii5bd3kkri5prcky7swrn88-pm-shell-aliases.sh
pm-shell-aliases.sh (post)> Nothing to push - all store paths are already on Cachix.
pm-shell-aliases.sh (post)> added 1 signatures
pm-shell-aliases.sh (post)> added 1 signatures
pm-shell-aliases.sh (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/0jmd2bmazii5bd3kkri5prcky7swrn88-pm-shell-aliases.sh
pm-shell-aliases.sh (post)> copying 0 paths...
pm-shell-aliases.sh (post)> copying 0 paths...
pm-shell-aliases.sh (post)> added 0 signatures
pm-shell-aliases.sh (post)> added 0 signatures
pm-shell-aliases.sh (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/0jmd2bmazii5bd3kkri5prcky7swrn88-pm-shell-aliases.sh
pm-shell-aliases.sh (post)> copying 0 paths...
pm-shell-aliases.sh (post)> copying 0 paths...
builder.pl (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
builder.pl (post)> Nothing to push - all store paths are already on Cachix.
builder.pl (post)> added 1 signatures
builder.pl (post)> added 2 signatures
builder.pl (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
builder.pl (post)> copying 0 paths...
builder.pl (post)> copying 0 paths...
builder.pl (post)> added 0 signatures
builder.pl (post)> added 0 signatures
builder.pl (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
builder.pl (post)> copying 0 paths...
builder.pl (post)> copying 0 paths...
haskell-generic-builder-test-wrapper.sh (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/4aglf609sav489rr35hg8vwpx8zh2cnb-haskell-generic-builder-test-wrapper.sh
haskell-generic-builder-test-wrapper.sh (post)> Nothing to push - all store paths are already on Cachix.
haskell-generic-builder-test-wrapper.sh (post)> added 2 signatures
haskell-generic-builder-test-wrapper.sh (post)> added 0 signatures
haskell-generic-builder-test-wrapper.sh (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4aglf609sav489rr35hg8vwpx8zh2cnb-haskell-generic-builder-test-wrapper.sh
haskell-generic-builder-test-wrapper.sh (post)> copying 0 paths...
haskell-generic-builder-test-wrapper.sh (post)> copying 0 paths...
haskell-generic-builder-test-wrapper.sh (post)> added 0 signatures
haskell-generic-builder-test-wrapper.sh (post)> added 0 signatures
haskell-generic-builder-test-wrapper.sh (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4aglf609sav489rr35hg8vwpx8zh2cnb-haskell-generic-builder-test-wrapper.sh
haskell-generic-builder-test-wrapper.sh (post)> copying 0 paths...
haskell-generic-builder-test-wrapper.sh (post)> copying 0 paths...
copying path '/nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/1wglr52h7wrxw0bfz83n455zaczgfvsj-Cabal-syntax-3.12.1.0.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/lhvjf49vc2m1s2ip48a46n8cq4skysy7-alex-3.5.3.0-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1crkydpxl0sh8214grfpxhafggbyd7fc-alejandra-4.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/58pj5537vyg2rzi2l521q29l2b9c6klp-algebraic-graphs-0.7-r3.cabal' from 'https://cache.nixos.org'...
copying path '/nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/5i17rngglby671bra0ns7nr01v1c0340-binutils-2.44-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dw43m0akrx4i361mz3v39gc5v79msy4v-aws-c-common-0.10.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/60mh60sl0igwn43xx6rpzswqapa90da9-boehm-gc-8.2.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yv4kz5qk38y7x5x5rg8a5lmgd9pcd09n-busybox-1.36.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8ic4r88607c95vfk7d2idwr4rh3qz6cd-cabal-doctest-1.0.11.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/nl8506nciivgw17jnj9bawh0j314m7an-die-hook' from 'https://cache.nixos.org'...
copying path '/nix/store/x96w22l8iqhd0k92x7gys2qsy0wcsc89-dav1d-1.5.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f2c0p6w6x2dmp252xjh144mncw8m2rjs-dejavu-fonts-minimal-2.37' from 'https://cache.nix-ci.com'...
copying path '/nix/store/25rjicrjsc82nyg4cj2ykkmcb69kxlij-dns-root-data-2025-04-14' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sx0kgsyjl6cggpb83pb21s1x5sjxb7am-doctest-0.24.0.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/ncjvky2z13rk45nqlrizdh9ypn108pch-editline-1.17.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qn8vf3mi55jykysjqcl2l519fb9v2f35-alex-3.5.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jr8kyv517lyd5xcv3pnhr6z4wirbi06r-expat-2.7.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/djwymlbaqpzn2y2l24hzjxn7wfn797lb-extra-1.8.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/1yj7ij8nwr2nlz1fgksrwqkx4p3iif7n-fail-4.9.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/62h5sfxr4s1qc3fghcan06viq4gms6yg-fribidi-1.0.16' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vmw4ghy1v0lz64f1xx4cyv6g6qc1lb1k-gdbm-1.25-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sz6wx51pnm4dpcliyysd27i0jqywm15x-gettext-0.22.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nb6f6gsg55nky42zddn60xr2wbd7s08c-ghc-paths-0.1.0.12-r7.cabal' from 'https://cache.nixos.org'...
copying path '/nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/imw7yr5pkn22zaq7z7hczpb9dim29scw-giflib-5.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ka79yp3ljjdkglkg0m55fxcbl130rjm6-git-2.50.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/42pzy4ahwk8p41hwfmz2nldgvsdws8q1-binutils-2.44' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fm1snxs1cg8ml9fjj6kra32sc8413k8z-glibc-2.40-66-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6mxnr68qgihr5pmp4avjbijjgwifdnml-gmp-6.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mml8yn060rz4krfdcqpqy435imx3x2k3-gmp-with-cxx-6.3.0-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/spmkixfl0sj5l0vvj9gxxlymid3nkwh2-graphite2-1.3.14' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kgshgyy6warcdj62p7gm0rnmdl9c9mn0-gtest-1.16.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zyg1px9d41rmv75jr76lxxfxv3zwkn2z-groff-1.23.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xpqq6zqzqyyviajl2sfkcaj1s0ck7z4p-hlint-3.8-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xcaznsndin98ig8w4bbq6nq4idrhqgh6-dav1d-1.5.1-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rymdwd8k4abh40b3mw4pf69g793mdqbi-iana-etc-20250108' from 'https://cache.nix-ci.com'...
copying path '/nix/store/krj0md2jkaaz4ksrg8wqab80wk34d1d0-icu4c-76.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a11jawsqjf43hzr2vnnp2ih24rpi35rv-jailbreak-cabal-1.4.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fpsjnh09h1jnyqm51925wa2xck72jchb-isl-0.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qbscv63yl3pi2p2k2052ygjh7svbgbgp-hlint-3.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/59s8rkrndv5vk8bhb9ljy6pvgyh63baf-fontconfig-2.16.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cacml0j41d0zkj043va8ryg29cfs3s0j-lerc-4.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p8fdrwah2spzb8i0f666bn7lpm1ccqj7-less-668' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4gybpyd4avw8hz8gk0fhhkh2pk06rm6d-libXau-1.0.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rl14lfb8yhxxajpvlkp7ymvy2gy9f1lk-libXdmcp-1.1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hkj8hw50n2jafdd9ls7ibq09lddgkgnv-libcap-ng-0.8.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s3a1b4z1g76ghg8lx7n9x1x737fk50yk-libcpuid-0.7.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/crxsllsl4kg5p0001gfal6a58yxmhjnw-libdatrie-2019-12-20-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ck7khcf4za0whllxl5v2p0g5qcfkzzmh-libdeflate-1.23' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ka48qwfbrhac03afnw6pcmnfq11agwpr-libevent-2.1.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a7qf1v4q79pqvkx66ra8dy36anrd7nmw-libffi-3.4.8-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4iwxcmla6n5yzwbwj57jkhas92jrjb1q-libjpeg-turbo-3.0.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pi5lc3mghn6m2c8x2psvp6z9m1cmbapc-libpipeline-1.5.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8a6g04hk9jbq2cpx7afpl1j9f2q6h5sz-libpng-apng-1.6.46' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1v9ggwkpb0xy708s11s1g9fhinn3b06r-glibc-2.40-66-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5njwabxkp1adj6q55a0yhncj51mnzib9-libseccomp-2.6.0-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7alkpy53ndwgg2j1548vlgc3j6pzmjkj-libselinux-3.8.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w8mfdhc191qmajj92g6yi0izqzvacj2w-libtasn1-4.20.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/imwag50h7nn22kvky64v82i6c5bfgxql-libsodium-1.0.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qyz709rdi8pdai3krdmyppaw6w21bjsj-libthai-0.1.29' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p1cqrricl0ch7qab8b8w3krhc91d890v-freetype-2.13.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aj10j7rli4yhdfpl1f7yw31rkq4ha7yk-libtool-2.5.4-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j3y24dy35j88w7vk1cnf3lf1g3w9r2c9-libuv-1.51.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1f3i1xmh7mc7llqgzryhgm4cfzsbyisb-libvmaf-3.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5wbk6hz3xcxkhrndryxkh1p1ms0k20im-libwebp-1.5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xwd1s74zk3bwilv4p02284ckyy319vhz-libxcb-1.17.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cvd68krxqrwgrsigszs0al2i8dnvlwk4-libxcrypt-4.4.38' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f35fr3iklsi4kb4jznr025bzrksg1hms-libxml2-2.13.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y3qhvjg23hq8j7b0z4ixp076sk4l83rv-libaom-3.11.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/smphwkfmvcw623296s39lnj6ahvjbh28-libvmaf-3.0.0-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xgkmxh2vg0ff61y8ngdcx73i58zs0fmg-libuv-1.51.0-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f5ijn1z4aih5gjby8xr2264p1y8gnn46-libtiff-4.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zrlqnpwy62jjnk8nna8f14i92nj5zdjj-libyaml-clib-0.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yb0da9d5xbvpjdpvai5yajsrm5728iy7-libyuv-1908' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6xk5plhj8i31xky6n4318r9720aclvhv-llhttp-9.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0mj66hc9mf2bfj9d0v8mis77d51c7kzp-libwebp-1.5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hqd6vbajkgl0zsnfdk3v3in8nszh1qfl-lndir-1.0.5' from 'https://cache.nixos.org'...
copying path '/nix/store/d7rwmcrxibwyvfrdy8cs6x1lzl6w17aw-lowdown-1.3.2-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4kw98q84pbv2nwq3ay12aavfa9zi4d9z-mailcap-2.1.54' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iw8i9xxh37lhx7sg2pmnw54gmmvcvd2w-make-shell-wrapper-hook' from 'https://cache.nixos.org'...
copying path '/nix/store/68bgk51v8baq44lqb3ps74b7jpcgc30z-mpdecimal-4.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dl9967vkjl6i3k3vc8hyh01yvawwsm4i-libgit2-1.9.0-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bgp9znk5cnzmh0fbb2l0rwclbz2qv0w8-mpfr-4.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b7lgmwg8dcm6qvi62sncv1r9k7pl70vs-libarchive-3.8.2-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jbc7djw77c1mp62hc37lcfgbzfi1pvyy-ncompress-5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h8xdapcbh1hgqrbcs1xbfamxgx4wwrj3-libmpc-1.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hgc91dkd1iqjdic0s55j1j2rycxd20k0-ncurses-6.5-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dlq6da0kanx17zih03cbkwz61y8ijfjd-net-tools-2.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xsr9bwrfr0yz4s61qjr9jx8wv1756bgk-libaom-3.11.0-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hfwp8v0hkf1msb88xxak64kwsskbg5id-nettle-3.10.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y28c83zz73yr4vwz1fsl4nsrn6yz5fj0-gcc-14.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/baai0iy8l2j08zx05ydwz4cf0qgyllx7-nil-2024-08-06' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hb74b7w63fdcc69213qzr2mc6x4wr0k5-nix-2.28.5-man' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xa1dr7cjlg1cczxwsc5zmw81s9yv816m-nothunks-0.3.0.0-r1.cabal' from 'https://cache.nixos.org'...
copying path '/nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/5540mrdimy0hzz8zd3j1r622bcrxidz0-oniguruma-6.9.10-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gjcvgjvr1m4f386i2279n8z2ks0dp4rn-aws-c-cal-0.8.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1191rci8hq31x01ibch6rw01hxyppzf1-aws-c-compression-0.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/78jpg9csx11aflfk32zj9mapc8ag8658-aws-c-sdkutils-0.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4fpvq180yap1qcr05gnv3r0z6rr2sw43-aws-checksums-0.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rjb0brw6yy6hjpjj006qbl9m1z26pci0-libaom-3.11.0-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wnvcwai159xvb8m4i6c9aiv90c3ilhk7-fontconfig-2.16.0-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y490z63bh4d0yqh55fqvplnkn9kfda3r-openssl-3.4.3-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3z07arviz8y5fyl2568akykm9slrjr7a-ormolu-0.7.4.0-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mr2qlbg1005kpgcq06jfmcll69zzfav4-p11-kit-0.25.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/70sl6zdmxwxp0hi6q0dr3dhf3h4mf8fn-icu4c-76.1-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b4rm0x46a7p3f0ihqgshf3zhiw6gk8is-jq-1.7.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dhrylylhir0cy7a0scg1zmq0gbq3lwpm-openssl-3.4.3-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k9lfh0l007sp61rag7d9bf3nn5bg3qy7-perl-5.40.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sa3nxi77fbvhsqrsyrh9jank9qlvpqd2-perl5.40.0-Clone-0.46' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dyvvj190jffvi40qqgfqh6pjnhpfalx7-perl5.40.0-Digest-HMAC-1.04' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rcm5xr7jbv4ppd52xxkhf86ljvkszzij-perl5.40.0-Crypt-URandom-0.39' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9hkmjwiwmzjhc3bldlzjfllx35kb0z72-perl5.40.0-Encode-Locale-1.05' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r49zci44xq7i6wl61ayhq82wn6v7w9lm-jq-1.7.1-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bfaj5s5p74d608q7v6b62rv4gnbcw4zc-perl5.40.0-FCGI-0.82' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4kpbg61sraqf1rlvj5ka125j2s93y4r8-hostname-net-tools-2.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2yvh4kwhfd65dcd3r6y6bgdwclfndvzr-libX11-1.8.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d6qwk9wlslhisb7imqq5gfcqppf1yhlh-perl5.40.0-FCGI-ProcManager-0.28' from 'https://cache.nix-ci.com'...
copying path '/nix/store/znd3lz8b5nkqb80ymrrxf0p3v2d4klm8-perl5.40.0-HTML-TagCloud-0.38' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wyfc8fx4h9fw9jscjb69pldxz7npy948-perl5.40.0-HTML-Tagset-3.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hp1khv252qq4mf8bca6mgwnddjhk4xwi-perl5.40.0-IO-HTML-1.004' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ngvraf6n06mdc2arhcaz6hqc6i9n55c3-perl5.40.0-LWP-MediaTypes-6.04' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0snbyniwb1r3cnjl9x9nbif0gfhmwph0-perl5.40.0-Mozilla-CA-20230821' from 'https://cache.nix-ci.com'...
copying path '/nix/store/41val8hvldpsba2p5h968qxvkcbdc2ka-perl5.40.0-Net-SSLeay-1.92' from 'https://cache.nix-ci.com'...
copying path '/nix/store/34gjbw1i8m18s7qbfv3x17qzmrps1iqq-perl5.40.0-TermReadKey-2.38' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2f26afhylw5929dzsw3sd6yxqnv7jc0a-perl5.40.0-Test-Needs-0.002010' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fg9kf6i51a5d0a526lh81x7vlp4sn6gj-perl5.40.0-Test-RequiresInternet-0.05' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dkj8lkhrnxszlqrfhp72isf4gbh011wz-perl5.40.0-Authen-SASL-2.1700' from 'https://cache.nix-ci.com'...
copying path '/nix/store/55hq32l96ck1jgfdq2q0xa8c82gb3cmc-perl5.40.0-TimeDate-2.33' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gni1fvxkj5cn8qlj27qz30hz1ilcf826-perl5.40.0-Try-Tiny-0.31' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ifk5d3lg114pqlm5j8pyhvvj19652cmn-perl5.40.0-URI-5.21' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3r0yzwy2cbwmmvqdhn3rz72rzwg719g1-perl5.40.0-libnet-3.15' from 'https://cache.nix-ci.com'...
copying path '/nix/store/89f2cpa92syklzh88wrphnj6az46hrv0-pixman-0.44.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vb6n1cvfqackckh6yzdsi3nszc4wzvb4-pretty-show-1.10-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rdyclnza81hs6dvba743pc1zri6zlx9n-quickcheck-instances-0.3.32-r1.cabal' from 'https://cache.nixos.org'...
copying path '/nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/gjzm7r9g1qwl5aq2l7ay8n42y47g61ns-rapidcheck-0-unstable-2023-12-14' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k8c60f1c543yng7878rfkc12han58hiv-readline-8.2p13' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jrc53jks2ab6qzqw9lvgh8qcs21xh39q-remove-references-to' from 'https://cache.nixos.org'...
copying path '/nix/store/zvfwx5xsqc62vpq3wsq6pq035v8ivzsk-s2n-tls-1.5.17' from 'https://cache.nix-ci.com'...
copying path '/nix/store/amfs7ad9h4zkxwdiz9pnxsl4lzi9rcb4-setup-debug-info-dirs-hook' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yjjsam4isbmf38nzw055sy19ayir49hn-shellcheck-0.10.0-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ks3slx52c0jmfgg717n0jq9lp354mlnw-sqlite-3.48.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nn27l879np49xvx6l1a8nqnqlp9apd8n-bash-interactive-5.2p37' from 'https://cache.nix-ci.com'...
copying path '/nix/store/17qrg8r0mpynmz06lx60fgs8g6dgbb3a-sqlite-3.48.0-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k89i56m6xryzi4cp5szdqxi39v82mk5p-tbb-2021.11.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/72clwj3z0160c40d4kraa515fnaxpg95-aws-c-io-0.15.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pvcgn24aldi3jpib51va7kgay77iy565-perl5.40.0-Test-Fatal-0.017' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2s4hpq73hn49jd84x976m3acp3rd3k1x-tzdata-2025b' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x8r21k5xskd7647wzb625g3gfxrj97w8-sqlite-3.48.0-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1v1hww4wcl2h88fx8dv8lg2wkp4rb9n5-tbb-2021.11.0-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zysii25rs1dd8liwmrzfa4apbpwq90rq-unbound-1.23.1-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/25zlmz5xa3xsw61nnvnr0apygnb0jncn-unordered-containers-0.2.20-r4.cabal' from 'https://cache.nixos.org'...
copying path '/nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/18ks84vwka6v1ldjp0cnil98pyykr3a9-util-linux-minimal-2.41.1-lib' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3lwgl9b6mv8rnqn9bnrjkj7m6h1p259p-perl5.40.0-HTTP-Date-6.06' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vyjsqcmiy5d5xz1m8dlyhc4dh1hf0x3w-perl5.40.0-IO-Socket-SSL-2.083' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xhll94m7ylb2v42xadrrrrlhrn798x0k-util-linux-minimal-2.41.1-login' from 'https://cache.nix-ci.com'...
copying path '/nix/store/61ibdhyk58w8ks0cj49z3c77vmzb6y0y-vector-0.13.2.0-r1.cabal' from 'https://cache.nixos.org'...
copying path '/nix/store/lv09vqv0iwl5xhalivqrh9vq50dd0qhg-aws-c-event-stream-0.5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sshykf1xl0gx5f5fccs192953ca48mlz-aws-c-http-0.9.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz' from 'https://cache.nixos.org'...
copying path '/nix/store/ph5pv9f7pimg7pj8zb72fslinlmlsdda-perl5.40.0-Net-HTTP-6.23' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r5syz7c6hpviypkpxsmlxnfvhc8f9s4y-perl5.40.0-WWW-RobotRules-6.02' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cs3bmq8ppvm13icjdwdp5f753j663ck6-perl5.40.0-File-Listing-6.16' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8gfq9pn1shnhi6mha2a56aa3ny7g9r6f-glib-2.84.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1yzyw24zirzv7p3fb9aikik9hpg2yl6i-perl5.40.0-HTTP-CookieJar-0.014' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b0j07izl8bymrfdjiqiqpbbd31j6fah4-aws-c-auth-0.8.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2py9gyblpjn4md4dajbrjdpkici9fdjz-aws-c-mqtt-0.11.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9r8a8rfwgf39vz0i8nl4fw51nik3rn37-perl5.40.0-HTTP-Message-6.45' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nybj8mlvvy2dg5mz5fazrn96amc80bn2-perl5.40.0-Net-SMTP-SSL-1.04' from 'https://cache.nix-ci.com'...
copying path '/nix/store/izqi1kbfayrajfvmsbsq5gb5qlrr65pa-util-linux-minimal-2.41.1-mount' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ygxiry6v791vkaixa54v2pr00r00qs56-aws-c-s3-0.7.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s1xwhyh16gnl7zcxmmdhjirkzwaxda3p-util-linux-minimal-2.41.1-swap' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ybhi1g8z643mcg5n4pkwhsihj4klk9y0-zlib-1.3.1-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vviigq6ivqsvccdcqa8x6yjkjyha37mj-util-linux-minimal-2.41.1-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f17vj6c0s3rb57dda77p176abpa3v4x8-zlib-ng-2.2.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rigwlrg08iw071x8brffd9cq8x039k6z-zstd-1.5.7-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ka4vb8g9byjyhz6fwb1567jw34kv8yxr-perl5.40.0-HTML-Parser-3.81' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gjaa2wzl71i6j2mi6f7dyjigpw7iqa84-perl5.40.0-HTTP-Cookies-6.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ggj3jz0vspp622bllbd9q98k30rrjhvj-perl5.40.0-HTTP-Daemon-6.16' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3d43mg79p6j94pi1ids55886wpzvhypn-perl5.40.0-HTTP-Negotiate-6.01' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wgsh6dpfj8dmdnkrhvhzm1jrx4sa4zw0-aws-crt-cpp-0.29.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rwr0pmgbryp0rk4ffvjc45rxqhm38r3v-cabal-install-3.14.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kz3gilypl4hqdv6dpq1akbdl4frhysla-aws-sdk-cpp-1.11.448' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y38l4arx7jj82splqhcna30w8484inlb-libblake3-1.8.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cpmmmdmdqwssg63l87ry66gqa32dy251-perl5.40.0-CGI-4.59' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x92x70hdpnpdblgnvpyar7nbvp8h74nb-nix-2.28.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2v2nlnxm34grn5iq1s1n4di9vsn3k4si-libXext-1.3.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/279a53jiv7pg1bds2ln3zl5ipmmfv9pn-libXpm-3.5.17' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x9agy8k80f2d7qcds6rhrqrv68xqcqiz-libXrender-0.9.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/73z88bd7ad3qqvyy7j1rgflvpadqzkqi-libXft-2.3.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xm50jlvjhvfgafac1bgg725mzx1ha7zy-perl5.40.0-CGI-Fast-2.16' from 'https://cache.nix-ci.com'...
copying path '/nix/store/khkwdrvwm1kljaw7xwpq8jhqwcb5w4vx-bash-strict-mode-0.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l356y1vcry8bqjnhd7j6vqivw9l2rvi3-ghc-9.12.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s0jzinq4ym2l1n7mqf0j0chpcc9caj08-nodejs-22.20.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zrqnaqv2l3vq6w80jwaf5qhgjjkdk937-gnutls-3.8.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c0f2wpa3h99yrjhr0lzxgb3hlans4yb6-man-db-2.13.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lagazc9fy36vg2h9dh7rjxd3a19az0m7-libmicrohttpd-1.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rh4hvsib7vsqx5qnfbd54qdmg2ahbzzy-elfutils-0.192-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3vsxig0sb5q6vbdfgh3gc0drfvw43yj5-elfutils-0.192-dev' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lfwfj17y9fpjb73nsj2m35rmkh587a0x-stdenv-linux' from 'https://cache.nix-ci.com'...
copying path '/nix/store/righ0a5sp3swjn2xr59zibpqa8hg85jf-nixos-option' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kf5v9rymcwv753pa8hhhivcj4ndlw7a2-project-manager' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fnmq9002xgpclpc8fpxzwks1rqh5q9ys-cairo-1.18.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/akc947m4vlrmzjil7d0wv91v3gkjflf3-gdk-pixbuf-2.42.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l1y3v80zbq5yw155ldyhs3g1pvg8hb8i-gts-0.7.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v03a1m3b2z4gml5z7d9wbh8kxz32l9xr-harfbuzz-10.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a4rx79vkyfssicg7cc9jn005nqpliiwc-bash-language-server-5.4.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1v83kfdr30f4vi0d1nfsqpg3c8h5d3ny-prettier-3.5.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jphjx778qgmsa5awgdal5vmxan2ay2iv-pango-1.56.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vn4zlycwkh6kvds89l34mb04nd6dc055-libavif-1.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/awm8a4wpvh14h42jl21m2armqhm8fhy7-gd-2.3.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4agib1rqrq7dplfhakg6xh9injdyan0n-graphviz-12.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ry6fmjgjp58jrrhfjzjd4n8ygb7k09yd-direnv-2.36.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/laryjwvjl934mlv503g3n1mzfak4jgpi-keep-sorted-0.6.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jd20rkmqmkfkcvk2wl2lmzz7acq4svlr-python3-3.12.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fwvs562iykzdi02kddg62f7vk297ll4g-treefmt-2.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sdrsmvdgjxh8270frrwq212wkh4w6bvd-vale-3.11.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h93vmdq9m6bhynhff3k8l1v6c4a3n85c-treefmt.toml' from 'https://cache.nix-ci.com'...
building '/nix/store/8lv062znkjdv7nwq8yix81rcvvp78v8m-treefmt.drv'...
treefmt (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/rzysllpbpg5p4p96lq1891s3r3q1vzhv-treefmt
treefmt (post)> Nothing to push - all store paths are already on Cachix.
treefmt (post)> added 1 signatures
treefmt (post)> added 1390 signatures
treefmt (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/rzysllpbpg5p4p96lq1891s3r3q1vzhv-treefmt
treefmt (post)> copying 0 paths...
treefmt (post)> copying 0 paths...
treefmt (post)> added 0 signatures
treefmt (post)> added 0 signatures
treefmt (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/rzysllpbpg5p4p96lq1891s3r3q1vzhv-treefmt
treefmt (post)> copying 0 paths...
treefmt (post)> copying 0 paths...
building '/nix/store/6hwl2f3sqw46qd8kyadiw8c5zwhkl3i7-pm-session-vars.sh.drv'...
copying path '/nix/store/iwqvhzw6z997j1xc860b6592994anpa3-Diff-0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3h3jyj18y3j4lndw2frd0fjiz3ksir4c-OneTuple-0.4.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dqklzvxn4x4waiaa5rgcllzrfc26sx60-assoc-1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rqmcz8a6h15s5fc6dfyfx84csg6x2bwx-Only-0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qyjkv30vm0jnslxd4myk2csmr2jlx8g7-cereal-0.5.8.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9yvvq1lp2phdif635lb8gzgncqcg2vfk-StateVar-1.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/alssi5r4hrr8llhcrzxzcjzm4lz731k2-Diff-1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d7jqcsxdfyl8aim2b62481g8ng1y9kim-base-compat-0.13.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z1xl422lbc6w5608ln5q9zws3r8flwcy-base16-bytestring-1.0.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/azzbnfhznbdnhgza5nc21yb2ahx10kzw-binary-orphans-1.0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y2nr1raq4h9bf8a7alyn5f9pnw3mbvna-blaze-builder-0.4.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lf8b1xd0nbma2w4j9qbwfi1yb1rzbfb0-cabal-add-0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1z9vcs31d1k3z9hgdawzjq2ar3pgs842-call-stack-0.4.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/adxd5nf7051ai8dry3c88933ly08csgz-algebraic-graphs-0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3ccp4fcr4cv9pnsak6ambc02qlwf84j3-character-ps-0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3rafiiaxd5db922l3d0qcn5nxa59k7pg-choice-0.2.4.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/616bsq9sxak1s5ghdfbgbndgcj1cjxsk-clay-0.15.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/84grvhvgyq2zi6qy3lzh1kkafh06gxw3-clock-0.8.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hwj6f3zjv1x4gnl8yi7yf2d4g8ghr233-cmdargs-0.10.22-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/20rvkp30ah6czdsh1yzh5wk416cbnzhn-co-log-core-0.3.2.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yjpg827y9gd4m07kgf4inwrbkn85xlg7-code-page-0.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xd7a09zbjpchvjqm253gw2xhhgrgfi36-colour-2.3.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d8dyr9vqps4yci7qmmisfqzra20k8x56-HUnit-1.6.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7kqw4w5s13nd1s4q24rr0qc7vl6kjdyz-commutative-semigroups-0.2.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5n4ip8ndsdsdbf95hihjqdm94z5rm36v-contravariant-1.5.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v7czx9mjs7g85ibiyrzgd61bp5063kaz-cryptohash-sha1-0.11.101.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pxiqvlxkql1l7pi9s090favyrz9s7nsg-cryptohash-sha256-0.11.102.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y88f80lk97dig6wwcss2ylivx5c8y22w-blaze-markup-0.8.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/66vjs5pradjp1y027z17ddpwb2a1ygn3-blaze-textual-0.2.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q3jxvh3naa6vdyy4ynr51vfqd2nvghb5-data-default-class-0.1.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cx4f06grjqr6bd13g2vyzcw8l1fdvk2p-dir-traverse-0.2.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/12kr9dlkrqcccmvbh39bmzh9ra673ci2-direct-sqlite-2.3.29-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ps9ccacm7g9cl5di2j1wrb2ih1bd8jkm-dlist-1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8f0yws14vw25ppq4rbdb92j8mscfs3bs-erf-2.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c8gy4i7zypzykxxk967i0z4piil54nv4-extensions-0.1.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cjcb64mda71z7vgv5jd0kxw169xqh0g5-extra-1.8-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b0pnpzj231ff8czvxhsn5mjizmk27lvv-data-default-instances-containers-0.1.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1xknhxrafz7fjm0nl3nrfk3iin06ydms-ansi-terminal-types-1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d02hxww6hkch28fxiqlrfkyd7wpy39x6-file-embed-0.0.16.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gq37kyz2c9daf37zd7a5619f03bph2s7-filtrable-0.1.6.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5ay4865dmgbzrs16jy5b32md7aya4krf-fingertree-0.1.5.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4vjb9b1mvxnb4wp4qhb7fdid7445j8yd-fmlist-0.9.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xzjxsaay5d1hvrvq0wp0jsg3wja4cq34-focus-1.0.3.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6gfmcj8y8bcpmifaxmz792v1gn1giwqn-blaze-html-0.9.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qijq1ryy1cpblhhzwi5wkf4m7wczmq4b-Glob-0.10.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/229k4rfzxhmb2paslyb756m6yalxn2qh-data-default-instances-dlist-0.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nhpi1w3rc6ji4f6nq9gdcci9zrjjsfbx-generically-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q8mdwkpg6bngg1k894wjbr4qkj7jy2la-ghc-lib-parser-9.12.2.20250320-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mixl6wqgxy9daxqz1pdi03njrf0w1qzk-ghc-paths-0.1.0.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n122119x4xa4l4x1hxgyk1v8axcvbjsr-ghc-trace-events-0.1.2.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jv1f2yqyvwiavissp6bh1ccpnwgz8dd2-ansi-terminal-1.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7pmg4mpna0ww28l57lv82jpwmpqjac4l-gitrev-1.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xmnd0c4h48aprjr00i21zdzmbzxgjz5j-hashable-1.4.7.0-doc' from 'https://cache.nix-ci.com'...
pm-session-vars.sh (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/4v8j3hyzlapc0j49mvda9wrfaxvx8hkl-pm-session-vars.sh
pm-session-vars.sh (post)> Nothing to push - all store paths are already on Cachix.
pm-session-vars.sh (post)> added 1 signatures
pm-session-vars.sh (post)> added 1 signatures
pm-session-vars.sh (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4v8j3hyzlapc0j49mvda9wrfaxvx8hkl-pm-session-vars.sh
pm-session-vars.sh (post)> copying 0 paths...
pm-session-vars.sh (post)> copying 0 paths...
pm-session-vars.sh (post)> added 0 signatures
pm-session-vars.sh (post)> added 0 signatures
pm-session-vars.sh (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4v8j3hyzlapc0j49mvda9wrfaxvx8hkl-pm-session-vars.sh
pm-session-vars.sh (post)> copying 0 paths...
pm-session-vars.sh (post)> copying 0 paths...
copying path '/nix/store/14hq8w7izw1yffszp1kd6vyridh041iq-haskell-lexer-1.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4qvrmz6b00i91p7hwhx478dccg3lcgb6-heaps-0.4.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rmbd8rw598i6pmvdgnl8z6911fdb4sw1-indexed-traversable-0.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xaklrhfpz60xwgmfyhr4p2hq4bika9vq-inspection-testing-0.5.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gmvrlry6c4ima11v9q8h11z0b0c4vjmq-hscolour-1.25-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7pmsq6hkylq7a3pzdkcadvpxh46f9xzw-hspec-discover-2.11.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q4g45kmrjip4lgz005minx0m12z15a0r-integer-logarithms-1.0.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dj8vrdjdpmfdwbvfsifypsvmbyccml6q-hspec-expectations-0.8.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hirhdq8l0g0cmvyi5bc5b8gri9a131bb-indexed-profunctors-0.1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ylh3biza9xnkdkgs00vn9g1jq6amy633-hie-compat-0.3.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/12cg3b0sc41z3xigljzyl6idsnb8yxnj-logging-facade-0.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/riy0czhqxr1839mikrzacqwd85qvfw41-js-dgtable-0.5.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ar57yk0mws7dz1w0lf4mya8xc2sccch3-logict-0.8.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gbddsm0n973569isapi9irgabm3lc80z-js-jquery-3.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bnm30x6v7psl5p1qn1l1b55fcr4ak644-js-flot-0.8.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zy9m2fzby0prhglj1yh9584y726jr5gd-async-2.2.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5ms418ciz405r9hnyrxl0xcmxx7lf591-case-insensitive-1.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p0b85292sxl3js89mcyz7fy6rdmd6zn8-colourista-0.1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6nl3hz4gbdb7s17spawd6b3w30c9mvlz-data-fix-0.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a572k2ghc4zz4mpawlmr7f01ccyc9g4k-filepattern-0.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c8g40y8g3yb9yyz90jk98gjjl52yrj29-lukko-0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0bjbynbmzhqb0cqviv23rcl29xvz3vif-microaeson-0.1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m19j17vl57gxcn69swhcz4js2m48qqab-mmap-0.5.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aj4710rxfnxw996aw3z5mmfz96qrhb7w-mmorph-1.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/07wjbhl3cj9vkl44kwwxlvd5j6x1s38i-network-3.2.7.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/32blvzag2d2bpx5g24n1a43151p3kq3x-generic-lens-core-2.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yvz7nwc7kswwl71f3p4s65ngvhiavkrk-newtype-generics-0.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8v129s1hg5r2m6yk8x42219q4grvx7nz-old-locale-1.0.0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bap22fv6xqflgffjhjc7bmza7sar6fyc-opentelemetry-0.8.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nq87vwbrvwrj9nilvw95a6a89b8srdbl-parallel-3.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/84n6irnzzz26gsh0w1fd0cg4rnhnv6wb-parser-combinators-1.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6pi18h9fngcwyhh6sn19cqsgwd9r4d91-perl5.40.0-libwww-perl-6.72' from 'https://cache.nix-ci.com'...
copying path '/nix/store/03jx5i9a0qhl8v0avd2891y8b78fpc2k-polyparse-1.13-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ch81lb13sq51l1qhj28rnszbfh5j7nkl-pretty-show-1.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f59cvb3azcy99bpwpyhsagcyyrlzdgz2-prettyprinter-1.7.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5g5v3jm58y4qblr4z1fih17bmwm7hy8f-primes-0.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sz74n46f77q43c46v70ig5ykyxb59b8n-primitive-0.9.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7h99psqc9bcdia6dylz3r5pj2svvps37-refact-0.3.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w4kcw521ql1bqgwpl80n0flr9isrfl74-data-default-instances-old-locale-0.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9r7pfhjvixdqzqfm6cdmfpf2x41gmc4y-MemoTrie-0.6.11-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3wj1q8xp6vdm2a310hm10za1b59a14mb-old-time-1.1.0.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rizqd8y944p20p6006i64daa4icf6bjz-lucid-2.11.20250303-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m1hrkbmmck308kfpm48p600pqs4mkgyf-reflection-2.1.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qx3c3cdbsg8p0ys86dvz652mkr86mmls-regex-applicative-0.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q2732wlr9zsnydyvifws6afb4m7b6a67-regex-base-0.94.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7mb7j8gr001rdja1536p9k235p40w6pk-safe-0.3.21-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yx1a42k4bkmslj5z57hgsy7hh9l1wmsi-monoid-subclasses-1.2.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cn6lia1r9xln85mfcmifbrl859l3di94-data-default-0.7.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pddm7n3rmb8g7j8k39r701i0bpx5ykm3-safe-exceptions-0.1.7.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k42s05mk195v1pign6a67fsy49a3372x-selective-0.7.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gsv623kvqr7bnx511nn75w4zgmp4cqwf-semigroups-0.20-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ylv19zca2sz622w015c2ph1r76g4kbim-silently-1.2.5.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p1chyvkqmniv13hzgkbnj6y8daj3p7cj-slist-0.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/398z5a16c0zwx3382dai0frlk3v1vzy8-some-1.0.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/givqg3adscd6n9zg48nvd4ms5dpkqbas-sorted-list-0.2.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l5s2s6jj3n03myanmr9b7f8azz7xry69-regex-pcre-builtin-0.95.2.3.8.44-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f1prajafig5845gx091zg06xh4hgzv73-cpphs-1.20.9.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/98vn6dk1lj83rhv64dp3sz16mpybdn6a-regex-tdfa-1.3.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5kw54i7zrn3rp3jqqnpaqnb7b726xszx-prettyprinter-ansi-terminal-1.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vcp9ijhb689ffxiqddv73h7q0ldsd6y4-split-0.2.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ah2hr8nz29q277i6jc3rbslmnkq77m76-splitmix-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/adhl1mp0jkipzvd63cjvpyprgwcbliqx-sqlite-simple-0.4.19.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qk9fd27153v1h66b1clv1mm0vd5cbljr-integer-conversion-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xllixqrh4b7pd776r0260xncr9cwd9d1-scientific-0.3.8.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aw5s88wg8z8c9jky5q3779bz9xz37mfi-stringbuilder-0.5.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/23j1myrqz4kja5zrpg315a74xhjpg7ba-syb-0.7.2.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qnwrirkqnzmw3kirk7mqikhqf4qc1ppm-tagged-0.8.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2y995qm8spzlc4n0kgb98hf8m0rnrkvk-terminal-size-0.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fgpi87dd52vaqc6vrzdjhlinq1mbjvdk-text-rope-0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r2k2csd684g5axz95n4g3v31zhavrlih-optparse-applicative-0.18.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fyz9z1s1b9jf2xldiqr6vliyfirsm259-pretty-simple-4.1.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gsjqfc4d77skb4a9v9rcpfs1f193x7gg-text-short-0.1.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/44ckhkd5q2bjs02sir4wfwi6mb5m3d61-random-1.2.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nla9fk8xm9m0hwrhav8m8k7i2nhsp0ch-th-abstraction-0.7.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pdp29pz76ih5i852pglbdcs5603zfi3q-th-compat-0.1.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r25sbpi31s37n17h1ashcw0cdi37w6c8-these-1.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/71a69ncw41dh9ad2i7n94s9kylgw5zqa-megaparsec-9.6.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wql0wmyczaywk56vps0h24rnd2zizca2-fuzzy-0.1.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yzbkw7mfg2sdawz2gwcwgvmf0cjcaxsb-boring-0.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c83ymfzcfws8ljc8ixqdymvhfbg1al35-distributive-0.6.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9dqqmnnj7r9xxllsakrnan0y84qdal2l-ghc-exactprint-1.12.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a18xm3yfhdjkckcvbkclmrph475p6zgc-concurrent-output-1.10.21-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2v33i11wwfk3dscxqv8i9n51dkhq1f1s-time-compat-1.9.8-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2792h6ajwgfdayyn30nsnyxaq0s6g75p-base64-1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d29mzpvs6d6krj3m1cqph7cm9m1x63sz-githash-0.1.7.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7i61k32sgy7gjgm244rrvfqw67zwa0by-network-uri-2.6.4.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/69f8dh68x4m51mq3pn7p3zvd80kz0pl3-primitive-unlifted-2.1.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z5risz35a0ivvbdir23brdswblsfcabg-strict-0.5.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aj9f54k89pc0qjd4gaqpb0adr3sshk67-constraints-0.14.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9q6hps1cj2cra46v8gbaf0h02p0z45f3-generic-deriving-1.14.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/syp5lnykizihxzpk8imaky22p1r0b077-th-env-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dl0mzb4hvirnpxisbbr4lwb2qhd1d7s0-barbies-2.1.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6qa803lmrix5hd0xfz931hr7a5h81krr-QuickCheck-2.14.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ba3mzjni8v5wnbwbcsqa38rsi4hxqygb-comonad-5.0.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dxv978ybby5k4rn0jdxplmvn6r3zx34a-temporary-1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p40fxi5zffww2v293xxf4ggvy1xraakb-hiedb-0.6.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jxqp78rmqkzcivlf68dycadhl9m5bdvm-optparse-simple-0.1.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/32x2vm02nvmnsym4icgany6r075a1jcb-tasty-1.5.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wsn1nvbrx1sjfrv2f96n1x8dmp0sx5vy-text-iso8601-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0zqmybjrqxrawmiwmwi3npwqhf0vzs4x-tf-random-0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a1kf6qbkp5kxpj3icnwl9d73lnz7i87y-neat-interpolation-0.5.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wk2sh5p4j0rm939dbhdz46qkfnbvqpc3-ormolu-0.8.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x4xyq2k3spk4hzlv8ihx4pv0md6cbdrg-mockery-0.3.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kfblccbckdw013zl3ypmmiji8nc2l44l-time-locale-compat-0.1.1.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bayy0wvlqim1cfjy5x7sf21pwwbga4h2-bifunctors-5.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cnbk2ddff8kwgr19cad3pmn2iydjkrmc-constraints-extras-0.4.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fhfkhr5gmns5x0r3z5kmy72gsac10mx3-transformers-base-0.4.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xaqk6r72qp9afxv118gsng65n6hwvspw-transformers-compat-0.7.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4csilwv1d0c22n9ag0np9pwqrp4qqixc-trial-0.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p3aspjkyjvxa2f8g925nywdbpmmbgh74-unbounded-delays-0.1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9ggan45hyz25b1dgd65vav0dyddsp8ar-unix-compat-0.7.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cr0qfcb1zz817w4s4zcrwdwqhsrvzavm-unliftio-core-0.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cwn0q1l4l5va4rwj99zmipj3zkybn202-unordered-containers-0.2.20-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i789vdyjzig7ihzsn9rbp1360kina7q3-utf8-string-1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w2jimc7pdj205rf0k7lgyxmvlfn8crjd-uuid-types-1.0.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/424wq9xw5b75rvgspjd678sy1nl1phwl-monad-control-1.0.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nr5zn19j431lqlsi8pj35582w708jnci-dependent-sum-0.7.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/639k78iljhfmciklnivi0wja8jcy788g-git-2.50.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i18zqp5righ6p8ds4z99ig1a7ms66xxg-ChasingBottoms-1.3.1.15-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r53ka1vvjvlx8i027h08zqpgx0fx8g42-generic-arbitrary-1.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h2l1csxwpk8sg65jgrd5dgv8d7hqy8l7-quickcheck-io-0.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/brmfvky017w9fv928j29q7y6pgm1fwdq-tasty-expected-failure-0.12.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sz43j41wrzlx3s5zznpw70m71bvppx9j-tasty-hunit-0.10.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7lbz8vrk33inhm3k4wqrypmpzlb33s5j-tasty-inspection-testing-0.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2k7rn4nj9xw018d7mm451gpbjnh819qs-hw-prim-0.6.3.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f3zzdw029hbbq5hlh7jaizrxrmnxsx1r-filemanip-0.3.6.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cj7c03gpivb8pcdqwcd28ajj1gxrqi5r-profunctors-5.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qkxz1npgj6nzibpflzgpjc13z9h2av6v-dependent-map-0.4.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x0y8yxddm1lyjx5bi1fd091qjlf1cgbv-resourcet-1.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i1c3ihy6ak8kznsqz240jc64ssp48i2j-lifted-base-0.2.3.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7pbfya16ibmqq183xg0i4f66pbvdppg0-ListLike-4.7.8.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r0i5jhs0krppykr7rpyd4c9wrj4imrsc-tasty-quickcheck-0.11-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pycjypz4bvnxy4km8mwybhsyvwri15fg-hspec-core-2.11.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n2c6jv19ydqs2qsbniw2lji4wl6i16l4-tasty-rerun-1.1.20-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/szyll6hd2zlz50jray4ds50ckbw0hl5q-trial-optparse-applicative-0.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bhqlamm38dc407gq7d81w8pv7c44c7ck-typed-process-0.2.13.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rfh6nc0zsrxw0smh3iqqg8g4xlc6bg87-unliftio-0.2.25.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/92m52pxv8gqispfckf5c5zbf44zkwfak-validation-selective-0.2.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nc5kcrxmy5v0hbzipwp7iarkn3arl8i3-vector-binary-instances-0.2.5.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dwqw60msag8vnq5780mffwv958c78d69-charset-0.3.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wjhd155hvjy0vvjcnclrczbm40afyyqh-indexed-traversable-instances-0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/akx8njmx8m5wdzv2a8qmfc0cc293h5yk-quickcheck-instances-0.3.32-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y47qgw77vmmvagnz2495qhr5z1sq9xkv-lifted-async-0.10.2.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gwkdbp3lmaiamqa0q9rs5nrbrqdzjllp-regex-1.1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3zp0wmxiffrszflmawj21z9id7vnfg08-hw-fingertree-0.1.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/331cyxny9sl1czvs27kla2h7nlp2f4hf-relude-1.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v866yqy7iy0rk35b0snajsww4zbr90l0-semigroupoids-6.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bvjadim9w886lprmd19xmijbj00vvm9n-semirings-0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5s3jv1ccshz73dwzb37m15wzgqwsgqgl-shake-0.19.8-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dpywqgcj6p9q5y2694p5fsr8cd149fsf-tasty-golden-2.3.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k9jz0innbqqp5ryd2h581wxgq66has9g-tomland-1.3.3.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3dl6p3l7lk0w21pvxqak2zi8lcv4wznx-generic-lens-2.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dym5s345ifxyhw4as9f6xn4fapbb9gml-invariant-0.6.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/01cg43c1v3bfnw3camg6gklvr8ysmv6r-parsers-0.12.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6kq1hn557w08zgxa9h3ssidqpfcg9rkk-process-extras-0.7.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z4wy2dihf8dkcldad0zpbj5y88bc88w5-uniplate-1.6.13-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4grp2z8wn38m660zlhajsl7jbvr851dp-vector-stream-0.1.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c2yxvrk4sxmb8wfp31aww7fwgdszyyg1-void-0.7.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mqgps2hb7gic9rgqdc1xqnhxi0m6kxk2-hspec-2.11.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d54d66aavjksbws2q9m4qhwcfq5ci046-wherefrom-compat-0.1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/65b8wzqy2hwmiqki9nwxw60ndqv7iil3-witherable-0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/khfl83fc9xdmd8b6zffls8hnfpnvahlj-row-types-1.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fk262kxkfpi0z9bb5vbfvhiwz3y3wj7v-wl-pprint-annotated-0.1.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5isjwp8s4csyrn5cs2m7w9mf3mdwqv96-zlib-0.7.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kn0wgv74v6m44jbymca77pyfl19y12fw-free-5.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rxw996fr01vv3nqiwlhhc7yn7wz6673k-bitvec-1.1.5.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/si1dmlp4h232zwci2vrakdljddr4473j-foldl-1.4.18-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sa3c1f4mkgjn8m37p97r25cf50v8f0ld-mod-0.2.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/llycccbp8q7kjxvrmwwfhhfxhbzqpmds-semialign-1.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2gxnjir771gqpng5abbzzbcv3pkb82vc-trial-tomland-0.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wmp8vxmlij1472b748h5nqlm2f0m1b33-apply-refact-0.15.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z6cdgbnhk0vvn14bkiizmikz4lf7qv75-ghc-lib-parser-ex-9.12.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/87ncvh1wb17xybw0391b2a8rzd32kbiv-hedgehog-1.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dk924y9x6hh7swikpp1gjra7wxfmcj8a-streaming-commons-0.2.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xkvr8wx9x22wd0rrpf5kdbhk9hzqbch6-vector-algorithms-0.9.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9d8p1qszyar2d1fhm03fklnbv9m931ik-aeson-2.2.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qbq76kza5l6d7c2xxj4zxvr9iwfnsnsm-deferred-folds-0.9.18.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nqqywsa2085qv53bmp4dnmpphm9y4rzq-list-t-1.0.5.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q05nxwf4xfcw1iwcph9lziljs9faradx-mono-traversable-1.0.21.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/47hp392h0zi5w5c5npb0cp7lp9s2m5w7-adjunctions-4.4.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iw05bbmi6g397wmd3gchpfwx4yffbz7m-primitive-extras-0.10.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l6c9cbslxm3pilscm4jqqxmk7k8kg1x7-kan-extensions-5.2.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ri5wi93v01w3gd8z66bzsslksbvraiw8-stm-hamt-1.2.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qq29j064ycqz4g5g98l7h5201j246nah-conduit-1.3.6.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4nikdc7gzglj91b3fwljxrrk369sc8i2-stm-containers-1.2.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ahiryhcx78rq0zi17skyng875kazc7ha-lens-5.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ji8p34qdwpd1sy20ivdshaz12ka1vyq0-enummapset-0.7.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vl3q1rlq8mvm96j7zd0nfid4ak846g1j-fourmolu-0.18.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/65zxlyy1107irnhn8g8kzdimf2wr3c37-attoparsec-aeson-2.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dq0x8c7blbb31q381msyshz8cc0clskx-hls-graph-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9gh1biyyhviffcihn69d71n8z1myaylq-deriving-aeson-0.2.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1mmhl31km9n95qcawdaf92116gjr7bi9-aeson-pretty-0.8.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rjk07nykg6qqxv4zf83mn0pvin7sak4r-binary-instances-1.0.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5hljn8waa27ihk3a4f766ldy8jgbxzn4-tasty-hedgehog-1.4.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gmgqa55wynx5yc3k6n8z89cbpby2p0pi-cabal-install-parsers-0.6.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/57xkkyy60nfbj8rx2m8jgwdi3y0xz0ra-conduit-extra-1.3.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4m73i1crg28k20id77njj6v2gm9s1fjv-conduit-parse-0.2.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5ii808v25prqkcfixdjqdzm82a3ml8qd-libyaml-0.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q68ndfq9jjim4circcz6sr88xggbvlbk-yaml-0.11.11.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lzmn33azy3c7jbrbkqni0b0i2g1xvd43-hie-bios-0.14.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2wzzsv79bvdm7nklz35j9czdx43v90hk-hlint-3.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ww6mxb1s5y9zzqzlqshj5km4l0j2bl5x-implicit-hie-0.1.4.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x5r33wccdrqg9haz4bn57c4r0a68arkj-lens-aeson-1.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4xyd40212jniicayywkgcwlmpfj3d2kn-lsp-2.7.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6fy03xq4w6cwp84lm70g4ri2q4cw3mbz-hls-plugin-api-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b32qypqpzl7kcxk0ihd404g1y8ix9dzx-lsp-test-0.17.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7dbjs2c7n1hjhyyp8r2ks9jlmjz189l3-ghcide-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m61ym5cs5jcd0cincbg75fyrgz3h57px-hls-test-utils-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
building '/nix/store/1710b6izbmi3cdb9d6ignm6gs42awbgy-project-manager-path-for-duoids.drv'...
project-manager-path-for-duoids> created 346 symlinks in user environment
project-manager-path-for-duoids (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/qch3c76xs7kng1y0myy2pjvszqi09afb-project-manager-path-for-duoids
project-manager-path-for-duoids (post)> Nothing to push - all store paths are already on Cachix.
project-manager-path-for-duoids (post)> added 4 signatures
project-manager-path-for-duoids (post)> added 371 signatures
project-manager-path-for-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/qch3c76xs7kng1y0myy2pjvszqi09afb-project-manager-path-for-duoids
project-manager-path-for-duoids (post)> copying 0 paths...
project-manager-path-for-duoids (post)> copying 0 paths...
project-manager-path-for-duoids (post)> added 0 signatures
project-manager-path-for-duoids (post)> added 0 signatures
project-manager-path-for-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/qch3c76xs7kng1y0myy2pjvszqi09afb-project-manager-path-for-duoids
project-manager-path-for-duoids (post)> copying 0 paths...
project-manager-path-for-duoids (post)> copying 0 paths...
copying path '/nix/store/58cqshcy5h6f67l6d9zkl04d764wdlln-Diff-0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7q411bx50h52ypz8mmn542ym96bap1ak-Diff-1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8l07vlz0iy5an122mghx0xbfsnq9phi8-Only-0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ah0arr2ck9lnwszqnixxj7s8s0scq4q3-OneTuple-0.4.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s123pkkysjxfgz5g78s6z5pa1air13fd-StateVar-1.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/83154svs6k7bh763bnprxwkg5aiqks5a-algebraic-graphs-0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vmzk9zd0px97fazvs3l1zyqkazh6wj06-base-compat-0.13.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m6n9m0zb30rw6kgs5fjqmdx9cm2kn30v-base-orphans-0.9.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7q7mx0k1c61dl9hk706yay4hwyj2fpzd-assoc-1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/higrlk8zcqac83v29hv4cw8dbcwiy2bf-base16-bytestring-1.0.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gizwnl2qpj3m37n6ryzr9jc1bsqj9awj-binary-orphans-1.0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wsn6ci07m11j4b3bvrp25iy7lf35h8v3-blaze-builder-0.4.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mn6gg2m2xql70ifmlyj1lryylhyimvk3-call-stack-0.4.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3phkhab2g0mwx7q0dzx89mgx0nnrpd7n-choice-0.2.4.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/khvj3kfrhl9r2zzybk2s2sshnjwzn52w-character-ps-0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ac2jnn96k1agnlpp5pf4lxmjbnirn1w3-cereal-0.5.8.3' from 'https://cache.nix-ci.com'...
building '/nix/store/pkw24jpz4qr4dqkm81z8k8nbq11fni8v-Cabal-syntax-3.12.1.0.drv'...
copying path '/nix/store/6ckb3544kh0wxy8dl6x5l526p49fk7qs-clay-0.15.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yq3xbdp8whbhcffhpizb969mch36j2an-clock-0.8.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rhy58fi1jr6m4324d1711lbblf5l2p7f-cmdargs-0.10.22' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7qy6ifh8pkpd8zn13gf6h87vs2cp2d77-co-log-core-0.3.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n5m58qzjc44zs66dmwr6hy8cdjdzn4wq-code-page-0.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wm4qssdkjhd6zcm8xyish7l4fy7aniqd-colour-2.3.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3xz413398n24kgqqsrrp1l5hc7nx7s7b-commutative-semigroups-0.2.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f4n0zi1x0kg48ry4a0n47qq7dvvjh7hf-contravariant-1.5.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8xjpz3wvb22s8q3hjh57a7yhzwnq967v-cryptohash-sha1-0.11.101.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/85x4vfkgrzs6nk7s2mbv6869ry6zdqyx-cryptohash-sha256-0.11.102.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ls9lyl91619dh7mpxg44a8pyga7i9kh1-data-default-class-0.1.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6arjclpg4fpg71xhnfjdrf7c68g7iwva-HUnit-1.6.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5s2abhvvcyxfgw1a2y0rk1jw6h1s0kj4-dir-traverse-0.2.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8k6pf85q7jsvnijk7zm2viz9zpa8xgvc-blaze-markup-0.8.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nmz0d2n2ncznsfnrl9n6m11avm37xggy-direct-sqlite-2.3.29' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zl2qmri8zrkbazpckd8sjd4s3fparkpp-dlist-1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/256w8fq06a087k54ph5xpklysslv6in1-erf-2.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3ph9dcpgs14vacr47jlymnxrfzn7apr9-extra-1.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ydizyzjxznvchdi1gfkz6i2hqp7xpwry-data-default-instances-containers-0.1.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sb2g1pi05lya9wlgmvwsak18r3vjc3y7-file-embed-0.0.16.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/29amvdiz8ki1qcicmpmmi1c749fj578f-filtrable-0.1.6.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/88byk4qbxl7apvnmjqc7a9z9dp93ssjs-fingertree-0.1.5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rxv21hqmz3qy8rysf6f0hk1fxhps7gzb-fmlist-0.9.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wmilrdxy6sr52az0lp1cajl8kc2mn058-focus-1.0.3.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k3nb7i40zirp5zn5b58vkczhainysg4k-generically-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/isimivqvmw3ww5zywav15l46m3p5fpsq-ghc-lib-parser-9.12.2.20250320' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hklm9xzb35m11r0317jn8njgqr40y80y-ghc-paths-0.1.0.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wppssc0mkd98n6ln17h2b4vfizqb14xs-data-default-instances-dlist-0.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3hlgarrqhsd5gsmnpfmrjglzwbxqc6q6-blaze-html-0.9.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p8wrzfa275rwgfw810ybd9a8wf2pprkl-ghc-trace-events-0.1.2.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7wy9v1yd358qmbk9ryqb3ki4p7yrxgj2-hashable-1.4.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jja8pwfbp3dx9j5q5iy7bfgvbwny0yz8-ansi-terminal-types-1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/940hm1dixb6f9wjadl23nyhy73njqf0p-haskell-lexer-1.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5rkg2cbn0g45rhfxqcp5iyjl2dcvsmg1-gitrev-1.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vr8lipn5h6q1zbaqmydgjfnqm54g9002-heaps-0.4.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lss9p3pcmkfgkk291y755dbgn1g6cfwj-hie-compat-0.3.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2pcbxrvymdks5imwprhjzl7pl12q4702-hscolour-1.25' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ps9m23cnf34c88zihpz1kcd760kyhbbg-hspec-discover-2.11.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k85pcmaq1rky36drpz2h07ri2ddn4pr5-hspec-expectations-0.8.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/whmbzyxnp17bjws71min4wbsqi3bm7g7-indexed-profunctors-0.1.1.1' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: setupCompilerEnvironmentPhase
copying path '/nix/store/kpx4j2vnw5lm8jb41qmjlc8pv7ssps51-indexed-traversable-0.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y9xfpidx45ksd78igp9fglimyh50z0p8-inspection-testing-0.5.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4qrhifdyvq6p6vvibhj3xyfgjawf985w-integer-logarithms-1.0.4' from 'https://cache.nix-ci.com'...
Cabal-syntax> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
copying path '/nix/store/dmgd5b0hyflmmmwnf2kipp4al5r857px-async-2.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qajlzal9ay5s8wss50czfk65dsq1ij7c-ansi-terminal-1.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/snjbj1yjc7ijlamav7049n4clmnzmnrd-case-insensitive-1.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1jjw1rrnb4acavxb550d16cy34l15y0k-data-fix-0.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xs33cxq6swjvvqvgsly50kcph37h6l89-filepattern-0.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/02i858dbqv1gad4149b7varj19hsiam3-generic-lens-core-2.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qy8kw7nqaq4iblp0w1prr5hl9pagdflb-js-dgtable-0.5.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1xzdpi8p3a3zsl18f0phx6myh3qxzhvn-js-flot-0.8.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/28gjbhan4axwyah9hy73dbdlpcl0hinh-colourista-0.1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v92rk8wc32dvrb196q8plj4zfv9dx8y6-js-jquery-3.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q2jrhil9qirwjxdwzmpbgf3k59rai7n0-logging-facade-0.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/26bn58h3jh46cljyrlvya3ysrq9y04hg-logict-0.8.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xyk2c2yisfzmc20rvcrp7gaacfc9y8dh-lukko-0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p8y6kj0gdbl24kbdz45gxndbwpfhs05q-microaeson-0.1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nyz3gfl1q203blbpvp9p1nsnp091ndsj-mmap-0.5.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/79j405fi824qk664mh9lyvyzi58bspkf-network-3.2.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9kl7bwbna1d9mxd2yllysw5q860ag5ls-newtype-generics-0.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f1inivd1j4s7js0xvc7kg5mxvrwh5ibf-old-locale-1.0.0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/66bm06jqzcz010svgn4wlxgl4gbsmg67-opentelemetry-0.8.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yx4ffgcraw0b10831khd2pwqbiqlch87-parallel-3.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yp8r1hx3jb28m4dx9d7icw2mw052bg2g-parser-combinators-1.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y6229rfrjkn65jd1918q0gfcapxqls44-polyparse-1.13' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1g0ydwds8l52nqdj3jqyxjndm2vj3i0d-prettyprinter-1.7.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3xcfx6ja61przk3c3zrr2wpx1rlqqp8h-primes-0.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0fw2rxgwaqgrg05zlv523r0f7jfs7yp6-MemoTrie-0.6.11' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xpz4wl2qkkp77svsazhvj1rj7msnjrbl-pretty-show-1.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6naj6c7b1i7n4aadha7y21w0vsi663ic-primitive-0.9.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/370db4ypfsxk6fx6w9bndp40v8kiw7cr-refact-0.3.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7d7fiy2wylqgyvjigy5vd0i5gmka427r-reflection-2.1.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/smz68mp95nw51w7ayg1xjm4qi1hzj84q-data-default-instances-old-locale-0.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/27madh8va6rpjzhhx9w9rfb8qr68bh1m-old-time-1.1.0.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mi6a7hfbvibpl9b0v5zc3zbqg9y6gwwp-regex-applicative-0.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z4sdhq56qydyic97ina0mz8hnvfmy66f-regex-base-0.94.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zkbw2np26vm3md0x90qn2x668dl0xhw5-safe-0.3.21' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pa8pgwscbaib2qb7vn9prrjdlmkjrz69-data-default-0.7.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9anwbb8my8k1as3lmbrgnqk0brwhccw5-safe-exceptions-0.1.7.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4gdhmwi6qyrx6n153qkz9lgralf9hv61-selective-0.7.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qz9w89siywrm039w6zawgr9hdbw4a58i-semigroups-0.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2iqqqiv17dldcjhv9c0803kzjr1a0h1z-silently-1.2.5.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r5byynxki49k1dxrjiams20lbcc3111v-slist-0.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i6fp8aqa3c2a3xmw6r1wrgbb9vabsr4j-some-1.0.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jcxjkb144bwnkyqfazgij2g0d95n7jwv-regex-pcre-builtin-0.95.2.3.8.44' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q8qhaq9g7ml1ccin7m5h9clpcx6lsng6-regex-tdfa-1.3.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sd3prqk07hyd0jad27c3g331k3kqqrw1-sorted-list-0.2.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nvzr87j4yrr1v66qzjz2m1qr217f18fh-split-0.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c0i5jayvp308xpd4ic4l9m8cy9l08rfl-splitmix-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yfrj5wm73crh0sh6agp5ni6y44yiqkpl-stringbuilder-0.5.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mv6nv9p58cfan9bjddvlkvgfrmwha1ln-syb-0.7.2.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ki2lrj6qyg9laqhvby34jwbcwnx6n733-tagged-0.8.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/55w43cjj0xhbqyy5c5y0ap6szs9ymbbp-prettyprinter-ansi-terminal-1.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7jy5rmj94d2cwbdxrc4pnwxkkdif7z5i-random-1.2.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0kva63pa4y3jvmsciy4pw6pji11nsgc2-tar-0.6.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w974qznk4s5kr2y80c2hx49cz482s4fd-terminal-size-0.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a4m5kl0prlgp0s9nh3xhj68xvcvhp4q6-text-short-0.1.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pd4mqm4x1kpjj4fzawi9l16kyjylhjgp-th-abstraction-0.7.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1jpiinw73avdfk2jqbackvb3g0ssd113-th-compat-0.1.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yyqj461mzbpwbkjilzy6i0hh00fpcmg0-these-1.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/638aw4gghdpyx88wvr6wv197mjm5m21v-time-compat-1.9.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zx9kcf3aj5rprl31107cazv8rzn41aqm-cpphs-1.20.9.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mwkyywhir33pypabv5q15c7l329vakd3-time-locale-compat-0.1.1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/klqv17pvmspyki9vdinmnw9prq8d1n37-concurrent-output-1.10.21' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1j98l6qnql4hhya968kl504gbp4g2rii-transformers-compat-0.7.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bnm8j03b0h7b2ivmpp9f14n0rzxy9ikb-boring-0.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kahxqgf2jz35asgp7bx8zyvn1qiwcblr-distributive-0.6.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rsaa5pxy7ncsxl13f55jy47k848il06z-githash-0.1.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iv5x18bvnk8mqs8fxxa84s2dhhdg4sbz-ghc-exactprint-1.12.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5ryfkbkiy19kcb70pp87vbp1bl5kb6m3-integer-conversion-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/45675z0yq3jwc1xj81x3qmx2f9hyl8wh-base64-1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5j3hqg6yx4ivzcpvan5mw5by0kwpf614-network-uri-2.6.4.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nca4i5a2bkybdrahkq16b828bwil9vj7-primitive-unlifted-2.1.0.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: unpackPhase
copying path '/nix/store/i7zisx8hpdkk242vkrmkmx0k80sx7adq-scientific-0.3.8.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/342jwl67r98gbb59ncj81vf5lla52q3j-constraints-0.14.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jbrwq60i8p3vggylw33i8vw5azk872if-strict-0.5.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8d91bb68zsl1r8laq7p2hkfifainjhq3-generic-deriving-1.14.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p1mwqyza9q1rqncm4x816y59zim5gc48-barbies-2.1.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xzs0h3bwcrkqy40x8qxpymcym60dh7xw-text-iso8601-0.1.1' from 'https://cache.nix-ci.com'...
Cabal-syntax> unpacking source archive /nix/store/1wglr52h7wrxw0bfz83n455zaczgfvsj-Cabal-syntax-3.12.1.0.tar.gz
copying path '/nix/store/00y8j5k3icmii9bsxq1h0k2qk5w4qjym-th-env-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/any3avamb2k8zvib45zkbi8mdpcblyvk-QuickCheck-2.14.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ph59j9ii55h1pcysy85ab9vy8z485h77-Glob-0.10.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b9ar7rxf2lvkv9ph0zf7bgikamh59fpi-comonad-5.0.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2z37kwaakxx7rv9gbzidzpjfrhx2ijjr-mmorph-1.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xykynv36ax77x5g0ld5i2jp1dnq9ybn7-optparse-applicative-0.18.1.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> source root is Cabal-syntax-3.12.1.0
copying path '/nix/store/i881scqi2iqjm2n3y85624marbaa5liq-temporary-1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qb0kdq6l5082wyi0vk9vy40blzx6fsrb-tf-random-0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d8r6djnk02fn7c3zzddi45b7j6ammar1-transformers-base-0.4.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c7343g3gddsaqk5injlragf90zi81d53-trial-0.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pfcg21w81n1vi6jik5affplayny89g8m-attoparsec-0.14.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l7h22r206m627prqzjbz8g9mwh8qlvz5-megaparsec-9.6.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/00fvrq3cxapb8pxaidpfwazf024m4qdk-lucid-2.11.20250303' from 'https://cache.nix-ci.com'...
Cabal-syntax> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-syntax-3.12.1.0/src/Language/Haskell/Extension.hs"
copying path '/nix/store/abfhh92nhw6anlajrfraci9ipmls9qg3-mockery-0.3.5' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: patchPhase
copying path '/nix/store/6bl62bwnb9ny9nb8sjv3bfzwj5brknp3-unbounded-delays-0.1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/acxc8p35wfs4qwhjmx3b2akj9lsv8s2c-unix-compat-0.7.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/06rvcj1v2inswv88bvsdf3458480cn7i-bifunctors-5.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6fi078iwp0bnf2cmp38rn63cyjw3f117-monad-control-1.0.3.1' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: compileBuildDriverPhase
Cabal-syntax> setupCompileFlags: -package-db=/build/tmp.xyE4wlo0N5/setup-package.conf.d -threaded
copying path '/nix/store/b56fmsg0kb68ln7nmxkkxvfv7br3zfja-unliftio-core-0.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iyani753r5ak51raxw4xds574xsjpbpd-uuid-types-1.0.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bklf7bsk95mwvhcxcmrwg54x1bqh9ips-utf8-string-1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s5g7jf0nksz7nbzvc6h90wyvxj1nkfiy-unordered-containers-0.2.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ik2w712jcgs9n45121m6f8dhhmrr3kah-validation-selective-0.2.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/525rr9izc62hzaqd6m382ffzpyyjqpmx-vector-stream-0.1.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/84l59pxppfi3grhi7bgbs14g96dpv5c9-filemanip-0.3.6.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mjgx67mmcp65dmiigw10fvvyf7258vy5-lifted-base-0.2.3.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pxiq1f2z48dw4h162hwh2kqxgyfvpzdd-wl-pprint-annotated-0.1.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ls9cvsgx2qbq6axak51q84m6nn24syk7-void-0.7.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bwh36sygq4k0yx7dnbqb9d3ricm4rvr8-wherefrom-compat-0.1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xgq1s3jcadwwiimw67cqgs0r72xymrwx-extensions-0.1.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9yldp9sxzi8bgsiffaxh080d0gp7lfrx-optparse-simple-0.1.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qz75a3jhqs7lzxx9i97kc75b20j7gmqg-pretty-simple-4.1.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/adj29y5x83ah5hrxc71zly9knxqyh2sy-resourcet-1.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m0dg0kwwr1dimdn97qjrqqqjb6cmza5y-tasty-1.5.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4ncdin24z5cc1kwy68f774qkx4aslrjh-trial-optparse-applicative-0.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6ayyddxh48zl9w5152dyf8ad0v4zsf4w-typed-process-0.2.13.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/igij0b49dymgkaryvq3vwayklc77q73f-lifted-async-0.10.2.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/05dn9zmnhbxhj1wqs9n9fjrk5dgbb3yz-unliftio-0.2.25.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/g02hirmx1b86nj46xfjfpf90nnwlm7g9-zlib-0.7.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/al73ihxc4hsj5pcma0ly1mpvmkfi4ii8-ChasingBottoms-1.3.1.15' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p2vr9qkjladbmw83iavkkj3vagandkcw-generic-arbitrary-1.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jwx6psrfazdhc594x8panawg1fbsl65v-quickcheck-io-0.2.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.xyE4wlo0N5/Main.o )
copying path '/nix/store/01avpw2x6y107vq8p9zcpim9s5zwmll2-hspec-core-2.11.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/czfqnd1k6pyp5n2ipgbslv622f3j5ri3-charset-0.3.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jg7r899q9in9ma0ixizsyfzwz0293x9n-regex-1.1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8p1hb3kwai3xcj5mmxc0bzr7jpkvjgj0-relude-1.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4a17c75yhfh3drqw9ldji8i8nprb8fjn-semirings-0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/129blsi86ngrzhrxxrpbq3i4p80avwz3-shake-0.19.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fs0ys8mahsjjrf0hl0nxdkrhfibk3why-uniplate-1.6.13' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w6jdnki0dksxaj8bb1xwiwdwsyzpx8s5-profunctors-5.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pbsv3vr6s0l31j582z2080r5zxyan7h3-neat-interpolation-0.5.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2949lhzs84qkv2bjkv46bxb90f48iicp-hedgehog-1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i6yr5blpyjfpn2isi2n1fnfmqn8qrv0f-semigroupoids-6.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8jkjmg5pgvdbmlcm06l0y296ggq10k9a-tomland-1.3.3.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p1lcnr10xkqj91qwrx7h2vwpl0n4bfcb-streaming-commons-0.2.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mzn32qnr4jnjd7dcwca7c68284ykzynf-tasty-golden-2.3.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/blbh66mv2p3hgk1g0r4s2l2cv2hawiz4-tasty-expected-failure-0.12.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4iq6m8v9d3mjx0560lgkwz1pm6hpshr0-tasty-hunit-0.10.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9kid16psxv3ac92gmvjwnfqncrfyyf2a-tasty-inspection-testing-0.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k6zy18mmkkw3mqnq74rmwd4rdi73dfr3-tasty-quickcheck-0.11' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rqqs2h20ms83lzal7w3vkx76ybbldzfq-tasty-rerun-1.1.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xcqd1qdp761cwvwzlcihz5raqvql3dbj-parsers-0.12.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f2yf6a3zxi4lpadcbq07jh4b1vz4gkma-vector-0.13.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dyyylggnf29qdcnkwihqg4g4yj3krs1q-apply-refact-0.15.0.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> [2 of 2] Linking Setup
copying path '/nix/store/973hmwrcpkp6r8c607j2j1dqddqnv9r8-generic-lens-2.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pv5a21l9dkx5y211z0y3pi2cvbiri7wl-invariant-0.6.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0h3w1l1lzkd9qyqryb5k12j6mbzjrjxp-free-5.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9bpvskhwpcwm2bkrfyb3kcqhxxydmrgi-row-types-1.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/axqhcyimnglv62khxx23b0fmsi0lyr5f-trial-tomland-0.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b8qfkszgly5i4xw6iy58aakykwizjp9r-stan-0.2.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1p5gmq9id6kq93vj95j6krkc2ac7vvi7-hspec-2.11.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2yn7sjhs9xls74p0dnbxkjhrfh1z4bad-tasty-hedgehog-1.4.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zk0g476bmrky6icd9bfh99s2lw1wcka9-adjunctions-4.4.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5lbz62bs2p1ppj65q7c2ibps8vvn0qdd-kan-extensions-5.2.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/55hzdra5a0njibzpz4dyqhpajf6z6llp-ListLike-4.7.8.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k7s2mwdz2vhcagn2dmvc0yh4bv9yb6j4-blaze-textual-0.2.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/65spavl1r49gbk14qx3p99xvh8db78f6-bitvec-1.1.5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/g0f9gbyfngcmllwglmqw9qdmakhlga1g-foldl-1.4.18' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fc7y8xli57v8m0i01d7kxnm20vfxr7is-hw-prim-0.6.3.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wjzkd918l3am84gfw61w9ds8l791hjwl-indexed-traversable-instances-0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6whdgqs1bxl3nj3p4pw7m7ygywv8dx6z-monoid-subclasses-1.2.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bjd354fpfl0ji9axfjhqv9vrzhgk1gvv-quickcheck-instances-0.3.32' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dpyq8cjszc5infx2v39y9z4ii8mv31fk-text-rope-0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nypv5clp5cjikf15hv4ssrzpwg0jn7d4-vector-binary-instances-0.2.5.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lsm3rsbkpkjpdvmn29z2gwbpk4jps93n-mod-0.2.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cvbl7cgisiywca874apc6qilahb5kr6d-lens-5.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3492k6ifj705qq3x8ni563mf8jsj2p0l-semialign-1.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dmkyccgzj2am8bavhg5bc958znvp2p0z-witherable-0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y7sfrsbbv1iiibldn6hmsa3c0xkxp9pk-sqlite-simple-0.4.19.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dji3867ykf0xlnmkgmcd0db4sarj4v2s-aeson-2.2.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2869410yhvnskxh8l9hmjvndvwi0j2nn-deferred-folds-0.9.18.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ainsif7pamzrmhjb65f8jfx7c3fd1fqm-list-t-1.0.5.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vhkra7z7g0v909d4s7wffgn78hc30q2j-hiedb-0.6.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zdc1rvy9asfymfmjrrdyfbvspa2rl86c-vector-algorithms-0.9.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hd3dvqf8jq3xyr607ccac4qby7dzvvd0-primitive-extras-0.10.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9dp94l0ndy2c3hi02s20kdiq1y7kj4kl-hw-fingertree-0.1.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hgcgnzi2hkb39qc67mc3yrm8gj1672fw-stm-hamt-1.2.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b41r12sz45kwihimbr0vppnv3pbwg869-stm-containers-1.2.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2rmx2zzck3l0vm4v3j91kbnynqz6mhsn-process-extras-0.7.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/62kigi0npspra72nq3wp1p8wbgvmxshr-fuzzy-0.1.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d62asgzspaa7336vpi8clck1531cwi1r-mono-traversable-1.0.21.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p0cfpkkkla7lxr8hfmjbqvcahx507n3h-conduit-1.3.6.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pd9lz1796m9f85rzhj6i1h58lcjcxvki-attoparsec-aeson-2.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nfgn6bwn72w25vi67gsjygwswji3iryx-constraints-extras-0.4.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hb1zdadjajqagsmlsc5ms46s9acfn2fq-deriving-aeson-0.2.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k7n86wrqm26jynf5yxfi8i5invpjlvys-binary-instances-1.0.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jnnyz04l7g8gdny8mp5ggpy1rf59r2qk-enummapset-0.7.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4nq74d4wbwy48jybkjsqdi2ncays8p7w-hls-graph-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iy6sagkp3ijsgvdy5fzyhw852gwngvx6-cabal-install-parsers-0.6.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cbrj8bi6yvrr878xfy1jzbgm88y1g8xi-dependent-sum-0.7.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/npfycc6a0s7lzc076rdahhfck045zfh1-aeson-pretty-0.8.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wvkqippf3b6f8jf9hqcr678fdq5nq57h-dependent-map-0.4.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xgkmj1q3w5qp7xg3ca48s9zsbdrw66k6-cabal-add-0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vbyfww2y9s8x8q80fj6wv464kz5izf6j-lens-aeson-1.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iblmmv16hig4rxkydysbrvybspjsj1c1-lsp-types-2.3.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ix4n2w112p09f32516gmxlh2dg68sq7v-conduit-extra-1.3.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/02qhxd2cicprw6ahfl3n2x3778kai4q7-conduit-parse-0.2.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6ckh2f3fjlcqw966x66wr042l67iia1g-libyaml-0.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/415vrrldwx6lkxp4wzabxmflrs375i8x-yaml-0.11.11.2' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: updateAutotoolsGnuConfigScriptsPhase
copying path '/nix/store/pvv66l1jj47vvknnsy9g9y8c7i8nrqix-hie-bios-0.14.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/idqybcji3xw8a2lli6whjjhhyra4k8yy-implicit-hie-0.1.4.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: configurePhase
Cabal-syntax> configureFlags: --verbose --prefix=/nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.xyE4wlo0N5/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
Cabal-syntax> Using Parsec parser
Cabal-syntax> Configuring Cabal-syntax-3.12.1.0...
Cabal-syntax> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
Cabal-syntax> 'ghc' version < 9.12):
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
Cabal-syntax> 9.12.1
Cabal-syntax> Dependency array >=0.4.0.1 && <0.6: using array-0.5.8.0
Cabal-syntax> Dependency base >=4.11 && <5: using base-4.21.0.0
Cabal-syntax> Dependency binary >=0.7 && <0.9: using binary-0.8.9.2
Cabal-syntax> Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.12.2.0
Cabal-syntax> Dependency containers >=0.5.0.0 && <0.8: using containers-0.7
Cabal-syntax> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
Cabal-syntax> Dependency directory >=1.2 && <1.4: using directory-1.3.9.0
Cabal-syntax> Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.5.4.0
Cabal-syntax> Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
Cabal-syntax> Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.17.0
Cabal-syntax> Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
Cabal-syntax> Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
Cabal-syntax> Dependency time >=1.4.0.1 && <1.15: using time-1.14
Cabal-syntax> Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
Cabal-syntax> transformers-0.6.1.2
Cabal-syntax> Source component graph: component lib
Cabal-syntax> Configured component graph:
Cabal-syntax>     component Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal-syntax>         include array-0.5.8.0-038b
Cabal-syntax>         include base-4.21.0.0-f068
Cabal-syntax>         include binary-0.8.9.2-4b0d
Cabal-syntax>         include bytestring-0.12.2.0-be6d
Cabal-syntax>         include containers-0.7-647d
Cabal-syntax>         include deepseq-1.5.1.0-b096
Cabal-syntax>         include directory-1.3.9.0-9eff
Cabal-syntax>         include filepath-1.5.4.0-7ce6
Cabal-syntax>         include mtl-2.3.1-9650
Cabal-syntax>         include parsec-3.1.17.0-9beb
Cabal-syntax>         include pretty-1.1.3.6-2a4e
Cabal-syntax>         include text-2.1.2-5eaa
Cabal-syntax>         include time-1.14-f7a8
Cabal-syntax>         include transformers-0.6.1.2-199f
Cabal-syntax> Linked component graph:
Cabal-syntax>     unit Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal-syntax>         include array-0.5.8.0-038b
Cabal-syntax>         include base-4.21.0.0-f068
Cabal-syntax>         include binary-0.8.9.2-4b0d
Cabal-syntax>         include bytestring-0.12.2.0-be6d
Cabal-syntax>         include containers-0.7-647d
Cabal-syntax>         include deepseq-1.5.1.0-b096
Cabal-syntax>         include directory-1.3.9.0-9eff
Cabal-syntax>         include filepath-1.5.4.0-7ce6
Cabal-syntax>         include mtl-2.3.1-9650
Cabal-syntax>         include parsec-3.1.17.0-9beb
Cabal-syntax>         include pretty-1.1.3.6-2a4e
Cabal-syntax>         include text-2.1.2-5eaa
Cabal-syntax>         include time-1.14-f7a8
Cabal-syntax>         include transformers-0.6.1.2-199f
Cabal-syntax>         Distribution.Backpack=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Backpack,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.CharParsing,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.DList,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Exception,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Graph,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Prelude,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Semigroup,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.License,Distribution.ModuleName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Pretty,Distribution.SPDX=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseReference,Distribution.System=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.System,Distribution.Text=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.AbiHash,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ComponentId,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.DependencyMap,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.LibraryVisibility,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageName,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageVersionConstraint,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SourceRepo.Lens,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Generic,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.MD5,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Path,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Structured,Distribution.Version=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Language.Haskell.Extension
Cabal-syntax> Ready component graph:
Cabal-syntax>     definite Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal-syntax>         depends array-0.5.8.0-038b
Cabal-syntax>         depends base-4.21.0.0-f068
Cabal-syntax>         depends binary-0.8.9.2-4b0d
Cabal-syntax>         depends bytestring-0.12.2.0-be6d
Cabal-syntax>         depends containers-0.7-647d
Cabal-syntax>         depends deepseq-1.5.1.0-b096
Cabal-syntax>         depends directory-1.3.9.0-9eff
Cabal-syntax>         depends filepath-1.5.4.0-7ce6
Cabal-syntax>         depends mtl-2.3.1-9650
Cabal-syntax>         depends parsec-3.1.17.0-9beb
Cabal-syntax>         depends pretty-1.1.3.6-2a4e
Cabal-syntax>         depends text-2.1.2-5eaa
Cabal-syntax>         depends time-1.14-f7a8
Cabal-syntax>         depends transformers-0.6.1.2-199f
Cabal-syntax> Using Cabal-3.14.1.0 compiled by ghc-9.12
Cabal-syntax> Using compiler: ghc-9.12.1
Cabal-syntax> Using install prefix:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0
Cabal-syntax> Executables installed in:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/bin
Cabal-syntax> Libraries installed in:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal-syntax> Dynamic Libraries installed in:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
Cabal-syntax> Private executables installed in:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/Cabal-syntax-3.12.1.0
Cabal-syntax> Data files installed in:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/share/x86_64-linux-ghc-9.12.1-f739/Cabal-syntax-3.12.1.0
Cabal-syntax> Documentation installed in:
Cabal-syntax> /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0
Cabal-syntax> Configuration files installed in:
Cabal-syntax> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/etc
Cabal-syntax> Using alex version 3.5.3.0 found on system at:
Cabal-syntax> /nix/store/qn8vf3mi55jykysjqcl2l519fb9v2f35-alex-3.5.3.0/bin/alex
Cabal-syntax> Using ar found on system at:
Cabal-syntax> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
Cabal-syntax> No c2hs found
Cabal-syntax> No cpphs found
Cabal-syntax> No doctest found
Cabal-syntax> Using gcc version 14.3.0 given by user at:
Cabal-syntax> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
Cabal-syntax> Using ghc version 9.12.1 found on system at:
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
Cabal-syntax> Using ghc-pkg version 9.12.1 found on system at:
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
Cabal-syntax> No ghcjs found
Cabal-syntax> No ghcjs-pkg found
Cabal-syntax> No greencard found
Cabal-syntax> Using haddock version 2.30.0 found on system at:
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
Cabal-syntax> No happy found
Cabal-syntax> No haskell-suite found
Cabal-syntax> No haskell-suite-pkg found
Cabal-syntax> No hmake found
Cabal-syntax> Using hpc version 0.69 found on system at:
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
Cabal-syntax> Using hsc2hs version 0.68.10 found on system at:
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
Cabal-syntax> Using hscolour version 1.25 found on system at:
Cabal-syntax> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
Cabal-syntax> No jhc found
Cabal-syntax> Using ld found on system at:
Cabal-syntax> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
Cabal-syntax> No pkg-config found
Cabal-syntax> Using runghc version 9.12.1 found on system at:
Cabal-syntax> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
Cabal-syntax> Using strip version 2.44 found on system at:
Cabal-syntax> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
Cabal-syntax> Using tar found on system at:
Cabal-syntax> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
Cabal-syntax> No uhc found
Cabal-syntax> Running phase: buildPhase
Cabal-syntax> Preprocessing library for Cabal-syntax-3.12.1.0...
Cabal-syntax> Building library for Cabal-syntax-3.12.1.0...
copying path '/nix/store/fichlly4xps5vgldgxspjg2i9915m8m5-lsp-2.7.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lscng9zsswc6krg0im81g7yzqb23gfrl-hls-plugin-api-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qanifwwivgj4zsfg6gihj0b2p912my2s-lsp-test-0.17.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5pa7r78r4pmqagfq71srmdkkwligwdb2-ghcide-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fhjm9szvdh1n2qsxi7n2l1j98a867gcz-fourmolu-0.18.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ncr785p6i6lyjihiixvv8k7jxnvlz3nv-ghc-lib-parser-ex-9.12.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f46cjw7zid58lbgn1acslmrprwdh5rfh-ormolu-0.8.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/68jqswsp2y81xxvdwggz8d2g4abrfqsk-hlint-3.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2hksmrgh9jqs5hsj3bkznwm55mlqmi71-hls-test-utils-2.10.0.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> [  1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.o, dist/build/Distribution/Compat/Binary.dyn_o )
Cabal-syntax> src/Distribution/Compat/Binary.hs:23:14: warning: [GHC-68441] [-Wdeprecations]
Cabal-syntax>     In the use of data constructor ‘ErrorCallWithLocation’
Cabal-syntax>     (imported from Control.Exception, but defined in GHC.Internal.Exception):
Cabal-syntax>     Deprecated: "ErrorCallWithLocation has been deprecated in favour of ErrorCall (which does not have a location). Backtraces are now handled by the backtrace exception mechanisms exclusively."
Cabal-syntax>    |
Cabal-syntax> 23 |     handler (ErrorCallWithLocation str _) = return $ Left str
Cabal-syntax>    |              ^^^^^^^^^^^^^^^^^^^^^
Cabal-syntax> 
copying path '/nix/store/pmg9r24613mp20p1k888img9jlqjm8p0-haskell-language-server-2.10.0.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> [  2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.o, dist/build/Distribution/Compat/Exception.dyn_o )
Cabal-syntax> [  3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.o, dist/build/Distribution/Compat/MonadFail.dyn_o )
Cabal-syntax> [  4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.o, dist/build/Distribution/Compat/Newtype.dyn_o )
Cabal-syntax> [  5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.o, dist/build/Distribution/Compat/Typeable.dyn_o )
Cabal-syntax> [  6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.o, dist/build/Distribution/PackageDescription/Utils.dyn_o )
Cabal-syntax> [  7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.o, dist/build/Distribution/Utils/Base62.dyn_o )
Cabal-syntax> [  8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.o, dist/build/Distribution/Utils/MD5.dyn_o )
Cabal-syntax> [  9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.o, dist/build/Distribution/Utils/String.dyn_o )
Cabal-syntax> [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.o, dist/build/Distribution/Utils/Structured.dyn_o )
Cabal-syntax> src/Distribution/Utils/Structured.hs:279:14: warning: [GHC-68441] [-Wdeprecations]
Cabal-syntax>     In the use of data constructor ‘ErrorCallWithLocation’
Cabal-syntax>     (imported from Control.Exception, but defined in GHC.Internal.Exception):
Cabal-syntax>     Deprecated: "ErrorCallWithLocation has been deprecated in favour of ErrorCall (which does not have a location). Backtraces are now handled by the backtrace exception mechanisms exclusively."
Cabal-syntax>     |
Cabal-syntax> 279 |     handler (ErrorCallWithLocation str _) = return $ Left str
Cabal-syntax>     |              ^^^^^^^^^^^^^^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.o, dist/build/Distribution/Compat/Semigroup.dyn_o )
Cabal-syntax> src/Distribution/Compat/Semigroup.hs:42:51: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘Last'’
Cabal-syntax>    |
Cabal-syntax> 42 |   deriving (Eq, Ord, Read, Show, Generic, Binary, Typeable)
Cabal-syntax>    |                                                   ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compat/Semigroup.hs:55:60: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘Option'’
Cabal-syntax>    |
Cabal-syntax> 55 |   deriving (Eq, Ord, Read, Show, Binary, Generic, Functor, Typeable)
Cabal-syntax>    |                                                            ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.o, dist/build/Distribution/Compat/NonEmptySet.dyn_o )
Cabal-syntax> src/Distribution/Compat/NonEmptySet.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘NonEmptySet’
Cabal-syntax>    |
Cabal-syntax> 51 |   deriving (Eq, Ord, Typeable, Data, Read)
Cabal-syntax>    |                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.o, dist/build/Distribution/Compat/Prelude.dyn_o )
Cabal-syntax> [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.o, dist/build/Distribution/Utils/ShortText.dyn_o )
Cabal-syntax> src/Distribution/Utils/ShortText.hs:96:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ShortText’
Cabal-syntax>    |
Cabal-syntax> 96 |                   deriving (Eq,Ord,Generic,Data,Typeable)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.o, dist/build/Distribution/Utils/Generic.dyn_o )
Cabal-syntax> [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.o, dist/build/Distribution/Types/Condition.dyn_o )
Cabal-syntax> src/Distribution/Types/Condition.hs:22:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Condition’
Cabal-syntax>    |
Cabal-syntax> 22 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.o, dist/build/Distribution/Parsec/Position.dyn_o )
Cabal-syntax> [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.o, dist/build/Distribution/Parsec/Warning.dyn_o )
Cabal-syntax> [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.o, dist/build/Distribution/Parsec/FieldLineStream.dyn_o )
Cabal-syntax> [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.o, dist/build/Distribution/Parsec/Error.dyn_o )
Cabal-syntax> [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.o, dist/build/Distribution/PackageDescription/Quirks.dyn_o )
Cabal-syntax> [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.o, dist/build/Distribution/Fields/LexerMonad.dyn_o )
Cabal-syntax> [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.o, dist/build/Distribution/Fields/Lexer.dyn_o )
Cabal-syntax> [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.o, dist/build/Distribution/Compat/Parsing.dyn_o )
Cabal-syntax> [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.o, dist/build/Distribution/Compat/DList.dyn_o )
Cabal-syntax> [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.o, dist/build/Distribution/Compat/Lens.dyn_o )
Cabal-syntax> [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.o, dist/build/Distribution/Types/CondTree.dyn_o )
Cabal-syntax> src/Distribution/Types/CondTree.hs:64:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CondTree’
Cabal-syntax>    |
Cabal-syntax> 64 |   deriving (Show, Eq, Typeable, Data, Generic, Functor, Foldable, Traversable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/CondTree.hs:85:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CondBranch’
Cabal-syntax>    |
Cabal-syntax> 85 |   deriving (Show, Eq, Typeable, Data, Generic, Functor, Traversable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.o, dist/build/Distribution/Compat/CharParsing.dyn_o )
Cabal-syntax> [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.o, dist/build/Distribution/CabalSpecVersion.dyn_o )
Cabal-syntax> src/Distribution/CabalSpecVersion.hs:37:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CabalSpecVersion’
Cabal-syntax>    |
Cabal-syntax> 37 |   deriving (Eq, Ord, Show, Read, Enum, Bounded, Typeable, Data, Generic)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.o, dist/build/Distribution/SPDX/LicenseListVersion.dyn_o )
Cabal-syntax> [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.o, dist/build/Distribution/Pretty.dyn_o )
Cabal-syntax> [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.o, dist/build/Distribution/Fields/Field.dyn_o )
Cabal-syntax> [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.o, dist/build/Distribution/Fields/Parser.dyn_o )
Cabal-syntax> [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.o, dist/build/Distribution/Fields/Pretty.dyn_o )
Cabal-syntax> [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.o, dist/build/Distribution/Parsec.dyn_o )
Cabal-syntax> [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.o, dist/build/Distribution/Utils/Path.dyn_o )
Cabal-syntax> src/Distribution/Utils/Path.hs:42:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘SymbolicPath’
Cabal-syntax>    |
Cabal-syntax> 42 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:104:27: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageDir’
Cabal-syntax>     |
Cabal-syntax> 104 | data PackageDir deriving (Typeable)
Cabal-syntax>     |                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:105:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SourceDir’
Cabal-syntax>     |
Cabal-syntax> 105 | data SourceDir deriving (Typeable)
Cabal-syntax>     |                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:107:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseFile’
Cabal-syntax>     |
Cabal-syntax> 107 | data LicenseFile deriving (Typeable)
Cabal-syntax>     |                            ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.o, dist/build/Distribution/Types/Version.dyn_o )
Cabal-syntax> src/Distribution/Types/Version.hs:50:32: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Version’
Cabal-syntax>    |
Cabal-syntax> 50 |   deriving (Data, Eq, Generic, Typeable)
Cabal-syntax>    |                                ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.o, dist/build/Distribution/Types/VersionRange/Internal.dyn_o )
Cabal-syntax> src/Distribution/Types/VersionRange/Internal.hs:61:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘VersionRange’
Cabal-syntax>    |
Cabal-syntax> 61 |   deriving (Data, Eq, Ord, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/VersionRange/Internal.hs:184:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘VersionRangeF’
Cabal-syntax>     |
Cabal-syntax> 184 |     , Typeable
Cabal-syntax>     |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.o, dist/build/Distribution/Types/VersionInterval/Legacy.dyn_o )
Cabal-syntax> src/Distribution/Types/VersionInterval/Legacy.hs:99:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘VersionIntervals’
Cabal-syntax>    |
Cabal-syntax> 99 |   deriving (Eq, Show, Typeable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.o, dist/build/Distribution/Types/VersionInterval.dyn_o )
Cabal-syntax> src/Distribution/Types/VersionInterval.hs:68:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘VersionIntervals’
Cabal-syntax>    |
Cabal-syntax> 68 |   deriving (Eq, Show, Typeable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.o, dist/build/Distribution/Types/VersionRange.dyn_o )
Cabal-syntax> [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.o, dist/build/Distribution/Types/SourceRepo.dyn_o )
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:80:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SourceRepo’
Cabal-syntax>    |
Cabal-syntax> 80 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:109:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘RepoKind’
Cabal-syntax>     |
Cabal-syntax> 109 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:129:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘KnownRepoType’
Cabal-syntax>     |
Cabal-syntax> 129 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data, Enum, Bounded)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:149:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘RepoType’
Cabal-syntax>     |
Cabal-syntax> 149 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.o, dist/build/Distribution/Types/SourceRepo/Lens.dyn_o )
Cabal-syntax> [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.o, dist/build/Distribution/Types/PkgconfigVersion.dyn_o )
Cabal-syntax> src/Distribution/Types/PkgconfigVersion.hs:29:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PkgconfigVersion’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.o, dist/build/Distribution/Types/PkgconfigVersionRange.dyn_o )
Cabal-syntax> src/Distribution/Types/PkgconfigVersionRange.hs:40:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PkgconfigVersionRange’
Cabal-syntax>    |
Cabal-syntax> 40 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.o, dist/build/Distribution/Types/PkgconfigName.dyn_o )
Cabal-syntax> src/Distribution/Types/PkgconfigName.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PkgconfigName’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.o, dist/build/Distribution/Types/PkgconfigDependency.dyn_o )
Cabal-syntax> src/Distribution/Types/PkgconfigDependency.hs:26:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PkgconfigDependency’
Cabal-syntax>    |
Cabal-syntax> 26 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.o, dist/build/Distribution/Types/PackageName.dyn_o )
Cabal-syntax> src/Distribution/Types/PackageName.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PackageName’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.o, dist/build/Distribution/Types/UnqualComponentName.dyn_o )
Cabal-syntax> src/Distribution/Types/UnqualComponentName.hs:36:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘UnqualComponentName’
Cabal-syntax>    |
Cabal-syntax> 36 |     , Typeable
Cabal-syntax>    |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.o, dist/build/Distribution/Types/LibraryVisibility.dyn_o )
Cabal-syntax> src/Distribution/Types/LibraryVisibility.hs:26:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibraryVisibility’
Cabal-syntax>    |
Cabal-syntax> 26 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.o, dist/build/Distribution/Types/LibraryName.dyn_o )
Cabal-syntax> src/Distribution/Types/LibraryName.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibraryName’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.o, dist/build/Distribution/Types/MungedPackageName.dyn_o )
Cabal-syntax> src/Distribution/Types/MungedPackageName.hs:34:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘MungedPackageName’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.o, dist/build/Distribution/Types/ForeignLibType.dyn_o )
Cabal-syntax> src/Distribution/Types/ForeignLibType.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLibType’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.o, dist/build/Distribution/Types/ForeignLibOption.dyn_o )
Cabal-syntax> src/Distribution/Types/ForeignLibOption.hs:25:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLibOption’
Cabal-syntax>    |
Cabal-syntax> 25 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.o, dist/build/Distribution/Types/Flag.dyn_o )
Cabal-syntax> src/Distribution/Types/Flag.hs:59:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageFlag’
Cabal-syntax>    |
Cabal-syntax> 59 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/Flag.hs:83:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘FlagName’
Cabal-syntax>    |
Cabal-syntax> 83 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data, NFData)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/Flag.hs:130:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘FlagAssignment’
Cabal-syntax>     |
Cabal-syntax> 130 |   deriving (Binary, Generic, NFData, Typeable)
Cabal-syntax>     |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.o, dist/build/Distribution/Types/ExecutableScope.dyn_o )
Cabal-syntax> src/Distribution/Types/ExecutableScope.hs:21:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExecutableScope’
Cabal-syntax>    |
Cabal-syntax> 21 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.o, dist/build/Distribution/Types/ComponentName.dyn_o )
Cabal-syntax> src/Distribution/Types/ComponentName.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ComponentName’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/ComponentName.hs:35:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘NotLibComponentName’
Cabal-syntax>    |
Cabal-syntax> 35 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.o, dist/build/Distribution/Types/ComponentId.dyn_o )
Cabal-syntax> src/Distribution/Types/ComponentId.hs:35:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ComponentId’
Cabal-syntax>    |
Cabal-syntax> 35 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.o, dist/build/Distribution/Types/BuildType.dyn_o )
Cabal-syntax> src/Distribution/Types/BuildType.hs:32:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BuildType’
Cabal-syntax>    |
Cabal-syntax> 32 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.o, dist/build/Distribution/Types/AbiHash.dyn_o )
Cabal-syntax> src/Distribution/Types/AbiHash.hs:30:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘AbiHash’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Show, Read, Generic, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.o, dist/build/Distribution/Text.dyn_o )
Cabal-syntax> [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.o, dist/build/Distribution/System.dyn_o )
Cabal-syntax> src/Distribution/System.hs:117:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OS’
Cabal-syntax>     |
Cabal-syntax> 117 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/System.hs:220:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Arch’
Cabal-syntax>     |
Cabal-syntax> 220 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/System.hs:291:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Platform’
Cabal-syntax>     |
Cabal-syntax> 291 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.o, dist/build/Distribution/SPDX/LicenseReference.dyn_o )
Cabal-syntax> src/Distribution/SPDX/LicenseReference.hs:27:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseRef’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.o, dist/build/Distribution/SPDX/LicenseId.dyn_o )
Cabal-syntax> src/Distribution/SPDX/LicenseId.hs:648:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseId’
Cabal-syntax>     |
Cabal-syntax> 648 |   deriving (Eq, Ord, Enum, Bounded, Show, Read, Typeable, Data)
Cabal-syntax>     |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.o, dist/build/Distribution/SPDX/LicenseExceptionId.dyn_o )
Cabal-syntax> src/Distribution/SPDX/LicenseExceptionId.hs:102:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseExceptionId’
Cabal-syntax>     |
Cabal-syntax> 102 |   deriving (Eq, Ord, Enum, Bounded, Show, Read, Typeable, Data, Generic)
Cabal-syntax>     |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.o, dist/build/Distribution/SPDX/LicenseExpression.dyn_o )
Cabal-syntax> src/Distribution/SPDX/LicenseExpression.hs:46:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseExpression’
Cabal-syntax>    |
Cabal-syntax> 46 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/SPDX/LicenseExpression.hs:56:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SimpleLicenseExpression’
Cabal-syntax>    |
Cabal-syntax> 56 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.o, dist/build/Distribution/SPDX/License.dyn_o )
Cabal-syntax> src/Distribution/SPDX/License.hs:44:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘License’
Cabal-syntax>    |
Cabal-syntax> 44 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.o, dist/build/Distribution/SPDX.dyn_o )
Cabal-syntax> [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.o, dist/build/Distribution/ModuleName.dyn_o )
Cabal-syntax> src/Distribution/ModuleName.hs:43:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ModuleName’
Cabal-syntax>    |
Cabal-syntax> 43 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.o, dist/build/Distribution/Types/ModuleRenaming.dyn_o )
Cabal-syntax> src/Distribution/Types/ModuleRenaming.hs:43:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ModuleRenaming’
Cabal-syntax>    |
Cabal-syntax> 43 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.o, dist/build/Distribution/Types/IncludeRenaming.dyn_o )
Cabal-syntax> src/Distribution/Types/IncludeRenaming.hs:29:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘IncludeRenaming’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.o, dist/build/Distribution/Types/Mixin.dyn_o )
Cabal-syntax> src/Distribution/Types/Mixin.hs:34:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Mixin’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.o, dist/build/Distribution/Types/ModuleReexport.dyn_o )
Cabal-syntax> src/Distribution/Types/ModuleReexport.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ModuleReexport’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.o, dist/build/Distribution/Compat/Graph.dyn_o )
Cabal-syntax> src/Distribution/Compat/Graph.hs:125:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Graph’
Cabal-syntax>     |
Cabal-syntax> 125 |   deriving (Typeable)
Cabal-syntax>     |             ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.o, dist/build/Distribution/Version.dyn_o )
Cabal-syntax> [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.o, dist/build/Distribution/Types/TestType.dyn_o )
Cabal-syntax> src/Distribution/Types/TestType.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestType’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.o, dist/build/Distribution/Types/TestSuiteInterface.dyn_o )
Cabal-syntax> src/Distribution/Types/TestSuiteInterface.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestSuiteInterface’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.o, dist/build/Distribution/Types/PackageId.dyn_o )
Cabal-syntax> src/Distribution/Types/PackageId.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageIdentifier’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.o, dist/build/Distribution/Types/UnitId.dyn_o )
Cabal-syntax> src/Distribution/Types/UnitId.hs:67:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘UnitId’
Cabal-syntax>    |
Cabal-syntax> 67 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data, NFData)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/UnitId.hs:121:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘DefUnitId’
Cabal-syntax>     |
Cabal-syntax> 121 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data, Binary, NFData, Pretty)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.o, dist/build/Distribution/Types/Module.dyn_o )
Cabal-syntax> src/Distribution/Types/Module.hs:29:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Module’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.o, dist/build/Distribution/Backpack.dyn_o )
Cabal-syntax> src/Distribution/Backpack.hs:94:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OpenUnitId’
Cabal-syntax>    |
Cabal-syntax> 94 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Backpack.hs:168:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OpenModule’
Cabal-syntax>     |
Cabal-syntax> 168 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.o, dist/build/Distribution/Types/ExposedModule.dyn_o )
Cabal-syntax> src/Distribution/Types/ExposedModule.hs:21:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExposedModule’
Cabal-syntax>    |
Cabal-syntax> 21 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.o, dist/build/Distribution/Types/PackageVersionConstraint.dyn_o )
Cabal-syntax> src/Distribution/Types/PackageVersionConstraint.hs:29:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageVersionConstraint’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Typeable, Data)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.o, dist/build/Distribution/Types/PackageId/Lens.dyn_o )
Cabal-syntax> [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.o, dist/build/Distribution/Types/MungedPackageId.dyn_o )
Cabal-syntax> src/Distribution/Types/MungedPackageId.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘MungedPackageId’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.o, dist/build/Distribution/Types/LegacyExeDependency.dyn_o )
Cabal-syntax> src/Distribution/Types/LegacyExeDependency.hs:29:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LegacyExeDependency’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.o, dist/build/Distribution/Types/ExeDependency.dyn_o )
Cabal-syntax> src/Distribution/Types/ExeDependency.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExeDependency’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.o, dist/build/Distribution/Types/Dependency.dyn_o )
Cabal-syntax> src/Distribution/Types/Dependency.hs:48:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Dependency’
Cabal-syntax>    |
Cabal-syntax> 48 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.o, dist/build/Distribution/Types/SetupBuildInfo.dyn_o )
Cabal-syntax> src/Distribution/Types/SetupBuildInfo.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SetupBuildInfo’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Show, Eq, Ord, Read, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.o, dist/build/Distribution/Types/SetupBuildInfo/Lens.dyn_o )
Cabal-syntax> [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.o, dist/build/Distribution/Types/DependencyMap.dyn_o )
Cabal-syntax> [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.o, dist/build/Distribution/Types/BenchmarkType.dyn_o )
Cabal-syntax> src/Distribution/Types/BenchmarkType.hs:25:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BenchmarkType’
Cabal-syntax>    |
Cabal-syntax> 25 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.o, dist/build/Distribution/Types/BenchmarkInterface.dyn_o )
Cabal-syntax> src/Distribution/Types/BenchmarkInterface.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BenchmarkInterface’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.o, dist/build/Distribution/Package.dyn_o )
Cabal-syntax> [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.o, dist/build/Distribution/Types/AbiDependency.dyn_o )
Cabal-syntax> src/Distribution/Types/AbiDependency.hs:30:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘AbiDependency’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.o, dist/build/Distribution/License.dyn_o )
Cabal-syntax> src/Distribution/License.hs:114:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘License’
Cabal-syntax>     |
Cabal-syntax> 114 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.o, dist/build/Distribution/Types/InstalledPackageInfo.dyn_o )
Cabal-syntax> src/Distribution/Types/InstalledPackageInfo.hs:98:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘InstalledPackageInfo’
Cabal-syntax>    |
Cabal-syntax> 98 |   deriving (Eq, Generic, Typeable, Read, Show)
Cabal-syntax>    |                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.o, dist/build/Distribution/Types/InstalledPackageInfo/Lens.dyn_o )
Cabal-syntax> [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.o, dist/build/Distribution/Fields/ParseResult.dyn_o )
Cabal-syntax> [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.o, dist/build/Distribution/Fields.dyn_o )
Cabal-syntax> [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.o, dist/build/Language/Haskell/Extension.dyn_o )
Cabal-syntax> src/Language/Haskell/Extension.hs:62:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Language’
Cabal-syntax>    |
Cabal-syntax> 62 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Language/Haskell/Extension.hs:118:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Extension’
Cabal-syntax>     |
Cabal-syntax> 118 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Language/Haskell/Extension.hs:551:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘KnownExtension’
Cabal-syntax>     |
Cabal-syntax> 551 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable, Data)
Cabal-syntax>     |                                                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.o, dist/build/Distribution/Compiler.dyn_o )
Cabal-syntax> src/Distribution/Compiler.hs:81:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CompilerFlavor’
Cabal-syntax>    |
Cabal-syntax> 81 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:146:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PerCompilerFlavor’
Cabal-syntax>     |
Cabal-syntax> 146 |     , Typeable
Cabal-syntax>     |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:177:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CompilerId’
Cabal-syntax>     |
Cabal-syntax> 177 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:227:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘AbiTag’
Cabal-syntax>     |
Cabal-syntax> 227 |   deriving (Eq, Generic, Show, Read, Typeable)
Cabal-syntax>     |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.o, dist/build/Distribution/Types/ConfVar.dyn_o )
Cabal-syntax> src/Distribution/Types/ConfVar.hs:22:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ConfVar’
Cabal-syntax>    |
Cabal-syntax> 22 |   deriving (Eq, Show, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.o, dist/build/Distribution/Fields/ConfVar.dyn_o )
Cabal-syntax> [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.o, dist/build/Distribution/Types/BuildInfo.dyn_o )
Cabal-syntax> src/Distribution/Types/BuildInfo.hs:142:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BuildInfo’
Cabal-syntax>     |
Cabal-syntax> 142 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.o, dist/build/Distribution/Types/HookedBuildInfo.dyn_o )
Cabal-syntax> [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.o, dist/build/Distribution/Types/BuildInfo/Lens.dyn_o )
Cabal-syntax> [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.o, dist/build/Distribution/Types/TestSuite.dyn_o )
Cabal-syntax> src/Distribution/Types/TestSuite.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestSuite’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.o, dist/build/Distribution/Types/TestSuite/Lens.dyn_o )
Cabal-syntax> [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.o, dist/build/Distribution/Types/Library.dyn_o )
Cabal-syntax> src/Distribution/Types/Library.hs:34:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Library’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Generic, Show, Eq, Ord, Read, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.o, dist/build/Distribution/Types/Library/Lens.dyn_o )
Cabal-syntax> [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.o, dist/build/Distribution/Types/ForeignLib.dyn_o )
Cabal-syntax> src/Distribution/Types/ForeignLib.hs:62:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLib’
Cabal-syntax>    |
Cabal-syntax> 62 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/ForeignLib.hs:64:79: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibVersionInfo’
Cabal-syntax>    |
Cabal-syntax> 64 | data LibVersionInfo = LibVersionInfo Int Int Int deriving (Data, Eq, Generic, Typeable)
Cabal-syntax>    |                                                                               ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.o, dist/build/Distribution/Types/ForeignLib/Lens.dyn_o )
Cabal-syntax> [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.o, dist/build/Distribution/Types/Executable.dyn_o )
Cabal-syntax> src/Distribution/Types/Executable.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Executable’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.o, dist/build/Distribution/Types/Executable/Lens.dyn_o )
Cabal-syntax> [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.o, dist/build/Distribution/Types/Benchmark.dyn_o )
Cabal-syntax> src/Distribution/Types/Benchmark.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Benchmark’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.o, dist/build/Distribution/Types/Component.dyn_o )
Cabal-syntax> [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.o, dist/build/Distribution/Types/ComponentRequestedSpec.dyn_o )
Cabal-syntax> src/Distribution/Types/ComponentRequestedSpec.hs:70:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ComponentRequestedSpec’
Cabal-syntax>    |
Cabal-syntax> 70 |   deriving (Generic, Read, Show, Eq, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.o, dist/build/Distribution/Types/PackageDescription.dyn_o )
Cabal-syntax> src/Distribution/Types/PackageDescription.hs:150:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageDescription’
Cabal-syntax>     |
Cabal-syntax> 150 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.o, dist/build/Distribution/Types/GenericPackageDescription.dyn_o )
Cabal-syntax> src/Distribution/Types/GenericPackageDescription.hs:74:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘GenericPackageDescription’
Cabal-syntax>    |
Cabal-syntax> 74 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.o, dist/build/Distribution/Types/GenericPackageDescription/Lens.dyn_o )
Cabal-syntax> [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.o, dist/build/Distribution/Types/Benchmark/Lens.dyn_o )
Cabal-syntax> [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.o, dist/build/Distribution/Types/PackageDescription/Lens.dyn_o )
Cabal-syntax> [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.o, dist/build/Distribution/Types/Lens.dyn_o )
Cabal-syntax> [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.o, dist/build/Distribution/PackageDescription.dyn_o )
Cabal-syntax> [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.o, dist/build/Distribution/PackageDescription/Configuration.dyn_o )
Cabal-syntax> [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.o, dist/build/Distribution/FieldGrammar/Newtypes.dyn_o )
Cabal-syntax> [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.o, dist/build/Distribution/FieldGrammar/Class.dyn_o )
Cabal-syntax> [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.o, dist/build/Distribution/FieldGrammar/Pretty.dyn_o )
Cabal-syntax> [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.o, dist/build/Distribution/FieldGrammar/Parsec.dyn_o )
Cabal-syntax> [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.o, dist/build/Distribution/FieldGrammar.dyn_o )
Cabal-syntax> [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.o, dist/build/Distribution/PackageDescription/FieldGrammar.dyn_o )
Cabal-syntax> [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.o, dist/build/Distribution/PackageDescription/PrettyPrint.dyn_o )
Cabal-syntax> [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.o, dist/build/Distribution/PackageDescription/Parsec.dyn_o )
Cabal-syntax> [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.o, dist/build/Distribution/FieldGrammar/FieldDescrs.dyn_o )
Cabal-syntax> [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.o, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.dyn_o )
Cabal-syntax> [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.o, dist/build/Distribution/InstalledPackageInfo.dyn_o )
Cabal-syntax> [  1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.p_o )
Cabal-syntax> src/Distribution/Compat/Binary.hs:23:14: warning: [GHC-68441] [-Wdeprecations]
Cabal-syntax>     In the use of data constructor ‘ErrorCallWithLocation’
Cabal-syntax>     (imported from Control.Exception, but defined in GHC.Internal.Exception):
Cabal-syntax>     Deprecated: "ErrorCallWithLocation has been deprecated in favour of ErrorCall (which does not have a location). Backtraces are now handled by the backtrace exception mechanisms exclusively."
Cabal-syntax>    |
Cabal-syntax> 23 |     handler (ErrorCallWithLocation str _) = return $ Left str
Cabal-syntax>    |              ^^^^^^^^^^^^^^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [  2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.p_o )
Cabal-syntax> [  3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.p_o )
Cabal-syntax> [  4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.p_o )
Cabal-syntax> [  5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.p_o )
Cabal-syntax> [  6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.p_o )
Cabal-syntax> [  7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.p_o )
Cabal-syntax> [  8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.p_o )
Cabal-syntax> [  9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.p_o )
Cabal-syntax> [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.p_o )
Cabal-syntax> src/Distribution/Utils/Structured.hs:279:14: warning: [GHC-68441] [-Wdeprecations]
Cabal-syntax>     In the use of data constructor ‘ErrorCallWithLocation’
Cabal-syntax>     (imported from Control.Exception, but defined in GHC.Internal.Exception):
Cabal-syntax>     Deprecated: "ErrorCallWithLocation has been deprecated in favour of ErrorCall (which does not have a location). Backtraces are now handled by the backtrace exception mechanisms exclusively."
Cabal-syntax>     |
Cabal-syntax> 279 |     handler (ErrorCallWithLocation str _) = return $ Left str
Cabal-syntax>     |              ^^^^^^^^^^^^^^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.p_o )
Cabal-syntax> src/Distribution/Compat/Semigroup.hs:42:51: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘Last'’
Cabal-syntax>    |
Cabal-syntax> 42 |   deriving (Eq, Ord, Read, Show, Generic, Binary, Typeable)
Cabal-syntax>    |                                                   ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compat/Semigroup.hs:55:60: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘Option'’
Cabal-syntax>    |
Cabal-syntax> 55 |   deriving (Eq, Ord, Read, Show, Binary, Generic, Functor, Typeable)
Cabal-syntax>    |                                                            ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.p_o )
Cabal-syntax> src/Distribution/Compat/NonEmptySet.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘NonEmptySet’
Cabal-syntax>    |
Cabal-syntax> 51 |   deriving (Eq, Ord, Typeable, Data, Read)
Cabal-syntax>    |                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.p_o )
Cabal-syntax> [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.p_o )
Cabal-syntax> src/Distribution/Utils/ShortText.hs:96:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ShortText’
Cabal-syntax>    |
Cabal-syntax> 96 |                   deriving (Eq,Ord,Generic,Data,Typeable)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.p_o )
Cabal-syntax> [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.p_o )
Cabal-syntax> src/Distribution/Types/Condition.hs:22:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Condition’
Cabal-syntax>    |
Cabal-syntax> 22 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.p_o )
Cabal-syntax> [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.p_o )
Cabal-syntax> [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.p_o )
Cabal-syntax> [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.p_o )
Cabal-syntax> [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.p_o )
Cabal-syntax> [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.p_o )
Cabal-syntax> [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.p_o )
Cabal-syntax> [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.p_o )
Cabal-syntax> [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.p_o )
Cabal-syntax> [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.p_o )
Cabal-syntax> [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.p_o )
Cabal-syntax> src/Distribution/Types/CondTree.hs:64:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CondTree’
Cabal-syntax>    |
Cabal-syntax> 64 |   deriving (Show, Eq, Typeable, Data, Generic, Functor, Foldable, Traversable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/CondTree.hs:85:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CondBranch’
Cabal-syntax>    |
Cabal-syntax> 85 |   deriving (Show, Eq, Typeable, Data, Generic, Functor, Traversable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.p_o )
Cabal-syntax> [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.p_o )
Cabal-syntax> src/Distribution/CabalSpecVersion.hs:37:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CabalSpecVersion’
Cabal-syntax>    |
Cabal-syntax> 37 |   deriving (Eq, Ord, Show, Read, Enum, Bounded, Typeable, Data, Generic)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.p_o )
Cabal-syntax> [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.p_o )
Cabal-syntax> [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.p_o )
Cabal-syntax> [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.p_o )
Cabal-syntax> [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.p_o )
Cabal-syntax> [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.p_o )
Cabal-syntax> [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.p_o )
Cabal-syntax> src/Distribution/Utils/Path.hs:42:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘SymbolicPath’
Cabal-syntax>    |
Cabal-syntax> 42 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:104:27: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageDir’
Cabal-syntax>     |
Cabal-syntax> 104 | data PackageDir deriving (Typeable)
Cabal-syntax>     |                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:105:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SourceDir’
Cabal-syntax>     |
Cabal-syntax> 105 | data SourceDir deriving (Typeable)
Cabal-syntax>     |                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:107:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseFile’
Cabal-syntax>     |
Cabal-syntax> 107 | data LicenseFile deriving (Typeable)
Cabal-syntax>     |                            ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.p_o )
Cabal-syntax> src/Distribution/Types/Version.hs:50:32: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Version’
Cabal-syntax>    |
Cabal-syntax> 50 |   deriving (Data, Eq, Generic, Typeable)
Cabal-syntax>    |                                ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.p_o )
Cabal-syntax> src/Distribution/Types/VersionRange/Internal.hs:61:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘VersionRange’
Cabal-syntax>    |
Cabal-syntax> 61 |   deriving (Data, Eq, Ord, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/VersionRange/Internal.hs:184:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘VersionRangeF’
Cabal-syntax>     |
Cabal-syntax> 184 |     , Typeable
Cabal-syntax>     |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.p_o )
Cabal-syntax> src/Distribution/Types/VersionInterval/Legacy.hs:99:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘VersionIntervals’
Cabal-syntax>    |
Cabal-syntax> 99 |   deriving (Eq, Show, Typeable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.p_o )
Cabal-syntax> src/Distribution/Types/VersionInterval.hs:68:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘VersionIntervals’
Cabal-syntax>    |
Cabal-syntax> 68 |   deriving (Eq, Show, Typeable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.p_o )
Cabal-syntax> [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.p_o )
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:80:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SourceRepo’
Cabal-syntax>    |
Cabal-syntax> 80 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:109:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘RepoKind’
Cabal-syntax>     |
Cabal-syntax> 109 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:129:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘KnownRepoType’
Cabal-syntax>     |
Cabal-syntax> 129 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data, Enum, Bounded)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:149:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘RepoType’
Cabal-syntax>     |
Cabal-syntax> 149 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.p_o )
Cabal-syntax> [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.p_o )
Cabal-syntax> src/Distribution/Types/PkgconfigVersion.hs:29:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PkgconfigVersion’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.p_o )
Cabal-syntax> src/Distribution/Types/PkgconfigVersionRange.hs:40:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PkgconfigVersionRange’
Cabal-syntax>    |
Cabal-syntax> 40 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.p_o )
Cabal-syntax> src/Distribution/Types/PkgconfigName.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PkgconfigName’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.p_o )
Cabal-syntax> src/Distribution/Types/PkgconfigDependency.hs:26:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PkgconfigDependency’
Cabal-syntax>    |
Cabal-syntax> 26 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.p_o )
Cabal-syntax> src/Distribution/Types/PackageName.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PackageName’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.p_o )
Cabal-syntax> src/Distribution/Types/UnqualComponentName.hs:36:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘UnqualComponentName’
Cabal-syntax>    |
Cabal-syntax> 36 |     , Typeable
Cabal-syntax>    |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.p_o )
Cabal-syntax> src/Distribution/Types/LibraryVisibility.hs:26:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibraryVisibility’
Cabal-syntax>    |
Cabal-syntax> 26 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.p_o )
Cabal-syntax> src/Distribution/Types/LibraryName.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibraryName’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.p_o )
Cabal-syntax> src/Distribution/Types/MungedPackageName.hs:34:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘MungedPackageName’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.p_o )
Cabal-syntax> src/Distribution/Types/ForeignLibType.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLibType’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.p_o )
Cabal-syntax> src/Distribution/Types/ForeignLibOption.hs:25:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLibOption’
Cabal-syntax>    |
Cabal-syntax> 25 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.p_o )
Cabal-syntax> src/Distribution/Types/Flag.hs:59:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageFlag’
Cabal-syntax>    |
Cabal-syntax> 59 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/Flag.hs:83:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘FlagName’
Cabal-syntax>    |
Cabal-syntax> 83 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data, NFData)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/Flag.hs:130:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘FlagAssignment’
Cabal-syntax>     |
Cabal-syntax> 130 |   deriving (Binary, Generic, NFData, Typeable)
Cabal-syntax>     |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.p_o )
Cabal-syntax> src/Distribution/Types/ExecutableScope.hs:21:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExecutableScope’
Cabal-syntax>    |
Cabal-syntax> 21 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.p_o )
Cabal-syntax> src/Distribution/Types/ComponentName.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ComponentName’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/ComponentName.hs:35:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘NotLibComponentName’
Cabal-syntax>    |
Cabal-syntax> 35 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.p_o )
Cabal-syntax> src/Distribution/Types/ComponentId.hs:35:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ComponentId’
Cabal-syntax>    |
Cabal-syntax> 35 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.p_o )
Cabal-syntax> src/Distribution/Types/BuildType.hs:32:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BuildType’
Cabal-syntax>    |
Cabal-syntax> 32 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.p_o )
Cabal-syntax> src/Distribution/Types/AbiHash.hs:30:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘AbiHash’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Show, Read, Generic, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.p_o )
Cabal-syntax> [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.p_o )
Cabal-syntax> src/Distribution/System.hs:117:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OS’
Cabal-syntax>     |
Cabal-syntax> 117 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/System.hs:220:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Arch’
Cabal-syntax>     |
Cabal-syntax> 220 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/System.hs:291:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Platform’
Cabal-syntax>     |
Cabal-syntax> 291 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.p_o )
Cabal-syntax> src/Distribution/SPDX/LicenseReference.hs:27:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseRef’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.p_o )
Cabal-syntax> src/Distribution/SPDX/LicenseId.hs:648:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseId’
Cabal-syntax>     |
Cabal-syntax> 648 |   deriving (Eq, Ord, Enum, Bounded, Show, Read, Typeable, Data)
Cabal-syntax>     |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.p_o )
Cabal-syntax> src/Distribution/SPDX/LicenseExceptionId.hs:102:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseExceptionId’
Cabal-syntax>     |
Cabal-syntax> 102 |   deriving (Eq, Ord, Enum, Bounded, Show, Read, Typeable, Data, Generic)
Cabal-syntax>     |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.p_o )
Cabal-syntax> src/Distribution/SPDX/LicenseExpression.hs:46:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseExpression’
Cabal-syntax>    |
Cabal-syntax> 46 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/SPDX/LicenseExpression.hs:56:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SimpleLicenseExpression’
Cabal-syntax>    |
Cabal-syntax> 56 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.p_o )
Cabal-syntax> src/Distribution/SPDX/License.hs:44:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘License’
Cabal-syntax>    |
Cabal-syntax> 44 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.p_o )
Cabal-syntax> [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.p_o )
Cabal-syntax> src/Distribution/ModuleName.hs:43:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ModuleName’
Cabal-syntax>    |
Cabal-syntax> 43 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.p_o )
Cabal-syntax> src/Distribution/Types/ModuleRenaming.hs:43:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ModuleRenaming’
Cabal-syntax>    |
Cabal-syntax> 43 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.p_o )
Cabal-syntax> src/Distribution/Types/IncludeRenaming.hs:29:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘IncludeRenaming’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.p_o )
Cabal-syntax> src/Distribution/Types/Mixin.hs:34:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Mixin’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.p_o )
Cabal-syntax> src/Distribution/Types/ModuleReexport.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ModuleReexport’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.p_o )
Cabal-syntax> src/Distribution/Compat/Graph.hs:125:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Graph’
Cabal-syntax>     |
Cabal-syntax> 125 |   deriving (Typeable)
Cabal-syntax>     |             ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.p_o )
Cabal-syntax> [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.p_o )
Cabal-syntax> src/Distribution/Types/TestType.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestType’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.p_o )
Cabal-syntax> src/Distribution/Types/TestSuiteInterface.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestSuiteInterface’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.p_o )
Cabal-syntax> src/Distribution/Types/PackageId.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageIdentifier’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.p_o )
Cabal-syntax> src/Distribution/Types/UnitId.hs:67:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘UnitId’
Cabal-syntax>    |
Cabal-syntax> 67 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data, NFData)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/UnitId.hs:121:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘DefUnitId’
Cabal-syntax>     |
Cabal-syntax> 121 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data, Binary, NFData, Pretty)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.p_o )
Cabal-syntax> src/Distribution/Types/Module.hs:29:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Module’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.p_o )
Cabal-syntax> src/Distribution/Backpack.hs:94:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OpenUnitId’
Cabal-syntax>    |
Cabal-syntax> 94 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Backpack.hs:168:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OpenModule’
Cabal-syntax>     |
Cabal-syntax> 168 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.p_o )
Cabal-syntax> src/Distribution/Types/ExposedModule.hs:21:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExposedModule’
Cabal-syntax>    |
Cabal-syntax> 21 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.p_o )
Cabal-syntax> src/Distribution/Types/PackageVersionConstraint.hs:29:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageVersionConstraint’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Typeable, Data)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.p_o )
Cabal-syntax> [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.p_o )
Cabal-syntax> src/Distribution/Types/MungedPackageId.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘MungedPackageId’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.p_o )
Cabal-syntax> src/Distribution/Types/LegacyExeDependency.hs:29:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LegacyExeDependency’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.p_o )
Cabal-syntax> src/Distribution/Types/ExeDependency.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExeDependency’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.p_o )
Cabal-syntax> src/Distribution/Types/Dependency.hs:48:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Dependency’
Cabal-syntax>    |
Cabal-syntax> 48 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.p_o )
Cabal-syntax> src/Distribution/Types/SetupBuildInfo.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SetupBuildInfo’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Show, Eq, Ord, Read, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.p_o )
Cabal-syntax> [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.p_o )
Cabal-syntax> [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.p_o )
Cabal-syntax> src/Distribution/Types/BenchmarkType.hs:25:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BenchmarkType’
Cabal-syntax>    |
Cabal-syntax> 25 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.p_o )
Cabal-syntax> src/Distribution/Types/BenchmarkInterface.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BenchmarkInterface’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.p_o )
Cabal-syntax> [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.p_o )
Cabal-syntax> src/Distribution/Types/AbiDependency.hs:30:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘AbiDependency’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.p_o )
Cabal-syntax> src/Distribution/License.hs:114:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘License’
Cabal-syntax>     |
Cabal-syntax> 114 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.p_o )
Cabal-syntax> src/Distribution/Types/InstalledPackageInfo.hs:98:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘InstalledPackageInfo’
Cabal-syntax>    |
Cabal-syntax> 98 |   deriving (Eq, Generic, Typeable, Read, Show)
Cabal-syntax>    |                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.p_o )
Cabal-syntax> [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.p_o )
Cabal-syntax> [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.p_o )
Cabal-syntax> [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.p_o )
Cabal-syntax> src/Language/Haskell/Extension.hs:62:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Language’
Cabal-syntax>    |
Cabal-syntax> 62 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Language/Haskell/Extension.hs:118:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Extension’
Cabal-syntax>     |
Cabal-syntax> 118 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Language/Haskell/Extension.hs:551:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘KnownExtension’
Cabal-syntax>     |
Cabal-syntax> 551 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable, Data)
Cabal-syntax>     |                                                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.p_o )
Cabal-syntax> src/Distribution/Compiler.hs:81:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CompilerFlavor’
Cabal-syntax>    |
Cabal-syntax> 81 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:146:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PerCompilerFlavor’
Cabal-syntax>     |
Cabal-syntax> 146 |     , Typeable
Cabal-syntax>     |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:177:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CompilerId’
Cabal-syntax>     |
Cabal-syntax> 177 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:227:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘AbiTag’
Cabal-syntax>     |
Cabal-syntax> 227 |   deriving (Eq, Generic, Show, Read, Typeable)
Cabal-syntax>     |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.p_o )
Cabal-syntax> src/Distribution/Types/ConfVar.hs:22:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ConfVar’
Cabal-syntax>    |
Cabal-syntax> 22 |   deriving (Eq, Show, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.p_o )
Cabal-syntax> [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.p_o )
Cabal-syntax> src/Distribution/Types/BuildInfo.hs:142:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BuildInfo’
Cabal-syntax>     |
Cabal-syntax> 142 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.p_o )
Cabal-syntax> [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.p_o )
Cabal-syntax> [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.p_o )
Cabal-syntax> src/Distribution/Types/TestSuite.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestSuite’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.p_o )
Cabal-syntax> [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.p_o )
Cabal-syntax> src/Distribution/Types/Library.hs:34:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Library’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Generic, Show, Eq, Ord, Read, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.p_o )
Cabal-syntax> [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.p_o )
Cabal-syntax> src/Distribution/Types/ForeignLib.hs:62:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLib’
Cabal-syntax>    |
Cabal-syntax> 62 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/ForeignLib.hs:64:79: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibVersionInfo’
Cabal-syntax>    |
Cabal-syntax> 64 | data LibVersionInfo = LibVersionInfo Int Int Int deriving (Data, Eq, Generic, Typeable)
Cabal-syntax>    |                                                                               ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.p_o )
Cabal-syntax> [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.p_o )
Cabal-syntax> src/Distribution/Types/Executable.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Executable’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.p_o )
Cabal-syntax> [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.p_o )
Cabal-syntax> src/Distribution/Types/Benchmark.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Benchmark’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.p_o )
Cabal-syntax> [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.p_o )
Cabal-syntax> src/Distribution/Types/ComponentRequestedSpec.hs:70:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ComponentRequestedSpec’
Cabal-syntax>    |
Cabal-syntax> 70 |   deriving (Generic, Read, Show, Eq, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.p_o )
Cabal-syntax> src/Distribution/Types/PackageDescription.hs:150:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageDescription’
Cabal-syntax>     |
Cabal-syntax> 150 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.p_o )
Cabal-syntax> src/Distribution/Types/GenericPackageDescription.hs:74:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘GenericPackageDescription’
Cabal-syntax>    |
Cabal-syntax> 74 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.p_o )
Cabal-syntax> [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.p_o )
Cabal-syntax> [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.p_o )
Cabal-syntax> [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.p_o )
Cabal-syntax> [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.p_o )
Cabal-syntax> [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.p_o )
Cabal-syntax> [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.p_o )
Cabal-syntax> [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.p_o )
Cabal-syntax> [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.p_o )
Cabal-syntax> [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.p_o )
Cabal-syntax> [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.p_o )
Cabal-syntax> [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.p_o )
Cabal-syntax> [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.p_o )
Cabal-syntax> [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.p_o )
Cabal-syntax> [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.p_o )
Cabal-syntax> [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.p_o )
Cabal-syntax> [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.p_o )
Cabal-syntax> buildPhase completed in 57 seconds
Cabal-syntax> Running phase: checkPhase
Cabal-syntax> Package has no test suites.
Cabal-syntax> Running phase: haddockPhase
Cabal-syntax> Preprocessing library for Cabal-syntax-3.12.1.0...
Cabal-syntax> Running Haddock on library for Cabal-syntax-3.12.1.0...
Cabal-syntax> [  1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Compat/Binary.hs:23:14: warning: [GHC-68441] [-Wdeprecations]
Cabal-syntax>     In the use of data constructor ‘ErrorCallWithLocation’
Cabal-syntax>     (imported from Control.Exception, but defined in GHC.Internal.Exception):
Cabal-syntax>     Deprecated: "ErrorCallWithLocation has been deprecated in favour of ErrorCall (which does not have a location). Backtraces are now handled by the backtrace exception mechanisms exclusively."
Cabal-syntax>    |
Cabal-syntax> 23 |     handler (ErrorCallWithLocation str _) = return $ Left str
Cabal-syntax>    |              ^^^^^^^^^^^^^^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [  2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, nothing ) [HIE file is missing]
Cabal-syntax> [  9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Utils/Structured.hs:279:14: warning: [GHC-68441] [-Wdeprecations]
Cabal-syntax>     In the use of data constructor ‘ErrorCallWithLocation’
Cabal-syntax>     (imported from Control.Exception, but defined in GHC.Internal.Exception):
Cabal-syntax>     Deprecated: "ErrorCallWithLocation has been deprecated in favour of ErrorCall (which does not have a location). Backtraces are now handled by the backtrace exception mechanisms exclusively."
Cabal-syntax>     |
Cabal-syntax> 279 |     handler (ErrorCallWithLocation str _) = return $ Left str
Cabal-syntax>     |              ^^^^^^^^^^^^^^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Compat/Semigroup.hs:42:51: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘Last'’
Cabal-syntax>    |
Cabal-syntax> 42 |   deriving (Eq, Ord, Read, Show, Generic, Binary, Typeable)
Cabal-syntax>    |                                                   ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compat/Semigroup.hs:55:60: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘Option'’
Cabal-syntax>    |
Cabal-syntax> 55 |   deriving (Eq, Ord, Read, Show, Binary, Generic, Functor, Typeable)
Cabal-syntax>    |                                                            ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Compat/NonEmptySet.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘NonEmptySet’
Cabal-syntax>    |
Cabal-syntax> 51 |   deriving (Eq, Ord, Typeable, Data, Read)
Cabal-syntax>    |                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Utils/ShortText.hs:96:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ShortText’
Cabal-syntax>    |
Cabal-syntax> 96 |                   deriving (Eq,Ord,Generic,Data,Typeable)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Condition.hs:22:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Condition’
Cabal-syntax>    |
Cabal-syntax> 22 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/CondTree.hs:64:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CondTree’
Cabal-syntax>    |
Cabal-syntax> 64 |   deriving (Show, Eq, Typeable, Data, Generic, Functor, Foldable, Traversable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/CondTree.hs:85:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CondBranch’
Cabal-syntax>    |
Cabal-syntax> 85 |   deriving (Show, Eq, Typeable, Data, Generic, Functor, Traversable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/CabalSpecVersion.hs:37:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CabalSpecVersion’
Cabal-syntax>    |
Cabal-syntax> 37 |   deriving (Eq, Ord, Show, Read, Enum, Bounded, Typeable, Data, Generic)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Utils/Path.hs:42:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘SymbolicPath’
Cabal-syntax>    |
Cabal-syntax> 42 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:104:27: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageDir’
Cabal-syntax>     |
Cabal-syntax> 104 | data PackageDir deriving (Typeable)
Cabal-syntax>     |                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:105:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SourceDir’
Cabal-syntax>     |
Cabal-syntax> 105 | data SourceDir deriving (Typeable)
Cabal-syntax>     |                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Utils/Path.hs:107:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseFile’
Cabal-syntax>     |
Cabal-syntax> 107 | data LicenseFile deriving (Typeable)
Cabal-syntax>     |                            ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Version.hs:50:32: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Version’
Cabal-syntax>    |
Cabal-syntax> 50 |   deriving (Data, Eq, Generic, Typeable)
Cabal-syntax>    |                                ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/VersionRange/Internal.hs:61:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘VersionRange’
Cabal-syntax>    |
Cabal-syntax> 61 |   deriving (Data, Eq, Ord, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/VersionRange/Internal.hs:184:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘VersionRangeF’
Cabal-syntax>     |
Cabal-syntax> 184 |     , Typeable
Cabal-syntax>     |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/VersionInterval/Legacy.hs:99:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘VersionIntervals’
Cabal-syntax>    |
Cabal-syntax> 99 |   deriving (Eq, Show, Typeable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/VersionInterval.hs:68:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘VersionIntervals’
Cabal-syntax>    |
Cabal-syntax> 68 |   deriving (Eq, Show, Typeable)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:80:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SourceRepo’
Cabal-syntax>    |
Cabal-syntax> 80 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:109:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘RepoKind’
Cabal-syntax>     |
Cabal-syntax> 109 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:129:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘KnownRepoType’
Cabal-syntax>     |
Cabal-syntax> 129 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data, Enum, Bounded)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/SourceRepo.hs:149:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘RepoType’
Cabal-syntax>     |
Cabal-syntax> 149 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PkgconfigVersion.hs:29:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PkgconfigVersion’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PkgconfigVersionRange.hs:40:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PkgconfigVersionRange’
Cabal-syntax>    |
Cabal-syntax> 40 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PkgconfigName.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PkgconfigName’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PkgconfigDependency.hs:26:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PkgconfigDependency’
Cabal-syntax>    |
Cabal-syntax> 26 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PackageName.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘PackageName’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/UnqualComponentName.hs:36:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘UnqualComponentName’
Cabal-syntax>    |
Cabal-syntax> 36 |     , Typeable
Cabal-syntax>    |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/LibraryVisibility.hs:26:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibraryVisibility’
Cabal-syntax>    |
Cabal-syntax> 26 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/LibraryName.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibraryName’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/MungedPackageName.hs:34:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘MungedPackageName’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ForeignLibType.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLibType’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ForeignLibOption.hs:25:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLibOption’
Cabal-syntax>    |
Cabal-syntax> 25 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Flag.hs:59:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageFlag’
Cabal-syntax>    |
Cabal-syntax> 59 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/Flag.hs:83:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘FlagName’
Cabal-syntax>    |
Cabal-syntax> 83 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data, NFData)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/Flag.hs:130:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘FlagAssignment’
Cabal-syntax>     |
Cabal-syntax> 130 |   deriving (Binary, Generic, NFData, Typeable)
Cabal-syntax>     |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ExecutableScope.hs:21:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExecutableScope’
Cabal-syntax>    |
Cabal-syntax> 21 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ComponentName.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ComponentName’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/ComponentName.hs:35:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘NotLibComponentName’
Cabal-syntax>    |
Cabal-syntax> 35 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ComponentId.hs:35:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ComponentId’
Cabal-syntax>    |
Cabal-syntax> 35 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/BuildType.hs:32:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BuildType’
Cabal-syntax>    |
Cabal-syntax> 32 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/AbiHash.hs:30:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘AbiHash’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Show, Read, Generic, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/System.hs:117:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OS’
Cabal-syntax>     |
Cabal-syntax> 117 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/System.hs:220:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Arch’
Cabal-syntax>     |
Cabal-syntax> 220 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/System.hs:291:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Platform’
Cabal-syntax>     |
Cabal-syntax> 291 |   deriving (Eq, Generic, Ord, Show, Read, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/SPDX/LicenseReference.hs:27:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseRef’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/SPDX/LicenseId.hs:648:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseId’
Cabal-syntax>     |
Cabal-syntax> 648 |   deriving (Eq, Ord, Enum, Bounded, Show, Read, Typeable, Data)
Cabal-syntax>     |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/SPDX/LicenseExceptionId.hs:102:49: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseExceptionId’
Cabal-syntax>     |
Cabal-syntax> 102 |   deriving (Eq, Ord, Enum, Bounded, Show, Read, Typeable, Data, Generic)
Cabal-syntax>     |                                                 ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/SPDX/LicenseExpression.hs:46:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LicenseExpression’
Cabal-syntax>    |
Cabal-syntax> 46 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/SPDX/LicenseExpression.hs:56:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SimpleLicenseExpression’
Cabal-syntax>    |
Cabal-syntax> 56 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/SPDX/License.hs:44:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘License’
Cabal-syntax>    |
Cabal-syntax> 44 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/ModuleName.hs:43:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘ModuleName’
Cabal-syntax>    |
Cabal-syntax> 43 |   deriving (Eq, Generic, Ord, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ModuleRenaming.hs:43:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ModuleRenaming’
Cabal-syntax>    |
Cabal-syntax> 43 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/IncludeRenaming.hs:29:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘IncludeRenaming’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Mixin.hs:34:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Mixin’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Show, Read, Eq, Ord, Typeable, Data, Generic)
Cabal-syntax>    |                                  ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ModuleReexport.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ModuleReexport’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Compat/Graph.hs:125:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Graph’
Cabal-syntax>     |
Cabal-syntax> 125 |   deriving (Typeable)
Cabal-syntax>     |             ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/TestType.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestType’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/TestSuiteInterface.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestSuiteInterface’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PackageId.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageIdentifier’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/UnitId.hs:67:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘UnitId’
Cabal-syntax>    |
Cabal-syntax> 67 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data, NFData)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/UnitId.hs:121:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the newtype declaration for ‘DefUnitId’
Cabal-syntax>     |
Cabal-syntax> 121 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data, Binary, NFData, Pretty)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Module.hs:29:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Module’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Backpack.hs:94:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OpenUnitId’
Cabal-syntax>    |
Cabal-syntax> 94 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Backpack.hs:168:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘OpenModule’
Cabal-syntax>     |
Cabal-syntax> 168 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ExposedModule.hs:21:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExposedModule’
Cabal-syntax>    |
Cabal-syntax> 21 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PackageVersionConstraint.hs:29:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageVersionConstraint’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Typeable, Data)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/MungedPackageId.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘MungedPackageId’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/LegacyExeDependency.hs:29:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LegacyExeDependency’
Cabal-syntax>    |
Cabal-syntax> 29 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ExeDependency.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ExeDependency’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Dependency.hs:48:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Dependency’
Cabal-syntax>    |
Cabal-syntax> 48 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/SetupBuildInfo.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘SetupBuildInfo’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Generic, Show, Eq, Ord, Read, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/BenchmarkType.hs:25:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BenchmarkType’
Cabal-syntax>    |
Cabal-syntax> 25 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/BenchmarkInterface.hs:28:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BenchmarkInterface’
Cabal-syntax>    |
Cabal-syntax> 28 |   deriving (Eq, Ord, Generic, Read, Show, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/AbiDependency.hs:30:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘AbiDependency’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/License.hs:114:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘License’
Cabal-syntax>     |
Cabal-syntax> 114 |   deriving (Generic, Read, Show, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/InstalledPackageInfo.hs:98:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘InstalledPackageInfo’
Cabal-syntax>    |
Cabal-syntax> 98 |   deriving (Eq, Generic, Typeable, Read, Show)
Cabal-syntax>    |                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, nothing ) [HIE file is missing]
Cabal-syntax> [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, nothing ) [HIE file is missing]
Cabal-syntax> [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Language/Haskell/Extension.hs:62:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Language’
Cabal-syntax>    |
Cabal-syntax> 62 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Language/Haskell/Extension.hs:118:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Extension’
Cabal-syntax>     |
Cabal-syntax> 118 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Language/Haskell/Extension.hs:551:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘KnownExtension’
Cabal-syntax>     |
Cabal-syntax> 551 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable, Data)
Cabal-syntax>     |                                                          ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Compiler.hs:81:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CompilerFlavor’
Cabal-syntax>    |
Cabal-syntax> 81 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:146:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PerCompilerFlavor’
Cabal-syntax>     |
Cabal-syntax> 146 |     , Typeable
Cabal-syntax>     |       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:177:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘CompilerId’
Cabal-syntax>     |
Cabal-syntax> 177 |   deriving (Eq, Generic, Ord, Read, Show, Typeable)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Compiler.hs:227:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘AbiTag’
Cabal-syntax>     |
Cabal-syntax> 227 |   deriving (Eq, Generic, Show, Read, Typeable)
Cabal-syntax>     |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ConfVar.hs:22:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ConfVar’
Cabal-syntax>    |
Cabal-syntax> 22 |   deriving (Eq, Show, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, nothing ) [HIE file is missing]
Cabal-syntax> [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/BuildInfo.hs:142:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘BuildInfo’
Cabal-syntax>     |
Cabal-syntax> 142 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, nothing ) [HIE file is missing]
Cabal-syntax> [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/TestSuite.hs:31:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘TestSuite’
Cabal-syntax>    |
Cabal-syntax> 31 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Library.hs:34:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Library’
Cabal-syntax>    |
Cabal-syntax> 34 |   deriving (Generic, Show, Eq, Ord, Read, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ForeignLib.hs:62:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ForeignLib’
Cabal-syntax>    |
Cabal-syntax> 62 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> src/Distribution/Types/ForeignLib.hs:64:79: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘LibVersionInfo’
Cabal-syntax>    |
Cabal-syntax> 64 | data LibVersionInfo = LibVersionInfo Int Int Int deriving (Data, Eq, Generic, Typeable)
Cabal-syntax>    |                                                                               ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Executable.hs:27:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Executable’
Cabal-syntax>    |
Cabal-syntax> 27 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/Benchmark.hs:30:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘Benchmark’
Cabal-syntax>    |
Cabal-syntax> 30 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>    |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, nothing ) [HIE file is missing]
Cabal-syntax> [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/ComponentRequestedSpec.hs:70:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘ComponentRequestedSpec’
Cabal-syntax>    |
Cabal-syntax> 70 |   deriving (Generic, Read, Show, Eq, Typeable)
Cabal-syntax>    |                                      ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/PackageDescription.hs:150:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘PackageDescription’
Cabal-syntax>     |
Cabal-syntax> 150 |   deriving (Generic, Show, Read, Eq, Ord, Typeable, Data)
Cabal-syntax>     |                                           ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, nothing ) [HIE file is missing]
Cabal-syntax> src/Distribution/Types/GenericPackageDescription.hs:74:23: warning: [GHC-90584] [-Wderiving-typeable]
Cabal-syntax>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal-syntax>     • In the data declaration for ‘GenericPackageDescription’
Cabal-syntax>    |
Cabal-syntax> 74 |   deriving (Show, Eq, Typeable, Data, Generic)
Cabal-syntax>    |                       ^^^^^^^^
Cabal-syntax> 
Cabal-syntax> [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, nothing ) [HIE file is missing]
Cabal-syntax> [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, nothing ) [HIE file is missing]
Cabal-syntax> [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, nothing ) [HIE file is missing]
Cabal-syntax> [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, nothing ) [HIE file is missing]
Cabal-syntax> [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, nothing ) [HIE file is missing]
Cabal-syntax> [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, nothing ) [HIE file is missing]
Cabal-syntax> [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, nothing ) [HIE file is missing]
Cabal-syntax> [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, nothing ) [HIE file is missing]
Cabal-syntax> [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, nothing ) [HIE file is missing]
Cabal-syntax> [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, nothing ) [HIE file is missing]
Cabal-syntax> [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, nothing ) [HIE file is missing]
Cabal-syntax> [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, nothing ) [HIE file is missing]
Cabal-syntax> [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, nothing ) [HIE file is missing]
Cabal-syntax> [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, nothing ) [HIE file is missing]
Cabal-syntax> Haddock coverage:
Cabal-syntax>   50% (  2 /  4) in 'Distribution.Compat.Binary'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     decodeOrFailIO (src/Distribution/Compat/Binary.hs:20)
Cabal-syntax> Warning: 'IOException' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   80% (  4 /  5) in 'Distribution.Compat.Exception'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>  100% (  2 /  2) in 'Distribution.Compat.MonadFail'
Cabal-syntax>  100% (  6 /  6) in 'Distribution.Compat.Newtype'
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Compat.Typeable'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.PackageDescription.Utils'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     cabalBug (src/Distribution/PackageDescription/Utils.hs:22)
Cabal-syntax>     userBug (src/Distribution/PackageDescription/Utils.hs:19)
Cabal-syntax>  100% (  2 /  2) in 'Distribution.Utils.Base62'
Cabal-syntax>   77% (  7 /  9) in 'Distribution.Utils.MD5'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     MD5 (src/Distribution/Utils/MD5.hs:26)
Cabal-syntax> Warning: 'decodeUtf8' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   60% (  3 /  5) in 'Distribution.Utils.String'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     trim (src/Distribution/Utils/String.hs:110)
Cabal-syntax> Warning: 'Binary' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Structure' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/Structured.hs:138:5
Cabal-syntax>     * at src/Distribution/Utils/Structured.hs:132:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/Structured.hs:132:1
Cabal-syntax>   74% ( 20 / 27) in 'Distribution.Utils.Structured'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     structuredDecodeOrFailIO (src/Distribution/Utils/Structured.hs:276)
Cabal-syntax>     MD5 (src/Distribution/Utils/MD5.hs:26)
Cabal-syntax>     containerStructure (src/Distribution/Utils/Structured.hs:322)
Cabal-syntax>     Tag (src/Distribution/Utils/Structured.hs:289)
Cabal-syntax>     TypeName (src/Distribution/Utils/Structured.hs:122)
Cabal-syntax>     ConstructorName (src/Distribution/Utils/Structured.hs:123)
Cabal-syntax>     SopStructure (src/Distribution/Utils/Structured.hs:141)
Cabal-syntax>  100% ( 10 / 10) in 'Distribution.Compat.Semigroup'
Cabal-syntax>   41% (  7 / 17) in 'Distribution.Compat.NonEmptySet'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     singleton (src/Distribution/Compat/NonEmptySet.hs:102)
Cabal-syntax>     insert (src/Distribution/Compat/NonEmptySet.hs:109)
Cabal-syntax>     delete (src/Distribution/Compat/NonEmptySet.hs:116)
Cabal-syntax>     toNonEmpty (src/Distribution/Compat/NonEmptySet.hs:130)
Cabal-syntax>     fromNonEmpty (src/Distribution/Compat/NonEmptySet.hs:127)
Cabal-syntax>     toList (src/Distribution/Compat/NonEmptySet.hs:135)
Cabal-syntax>     toSet (src/Distribution/Compat/NonEmptySet.hs:138)
Cabal-syntax>     member (src/Distribution/Compat/NonEmptySet.hs:145)
Cabal-syntax>     map (src/Distribution/Compat/NonEmptySet.hs:159)
Cabal-syntax>   96% (266 /277) in 'Distribution.Compat.Prelude'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     even
Cabal-syntax>     odd
Cabal-syntax>     Ordering
Cabal-syntax>     Bool
Cabal-syntax>     foldl1 (src/Distribution/Compat/Prelude.hs:330)
Cabal-syntax>     foldr1 (src/Distribution/Compat/Prelude.hs:326)
Cabal-syntax>     trace (src/Distribution/Compat/Prelude.hs:340)
Cabal-syntax>     traceShow (src/Distribution/Compat/Prelude.hs:348)
Cabal-syntax>     traceShowId (src/Distribution/Compat/Prelude.hs:344)
Cabal-syntax>     traceM (src/Distribution/Compat/Prelude.hs:352)
Cabal-syntax>     traceShowM (src/Distribution/Compat/Prelude.hs:356)
Cabal-syntax> Warning: 'Strings' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ByteString' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>  100% ( 12 / 12) in 'Distribution.Utils.ShortText'
Cabal-syntax> Warning: 'snoc' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'cons' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ByteString' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   96% ( 52 / 54) in 'Distribution.Utils.Generic'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     equating (src/Distribution/Utils/Generic.hs:414)
Cabal-syntax>     unintersperse (src/Distribution/Utils/Generic.hs:444)
Cabal-syntax>   83% (  5 /  6) in 'Distribution.Types.Condition'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   62% (  5 /  8) in 'Distribution.Parsec.Position'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     showPos (src/Distribution/Parsec/Position.hs:35)
Cabal-syntax>     zeroPos (src/Distribution/Parsec/Position.hs:38)
Cabal-syntax>   50% (  2 /  4) in 'Distribution.Parsec.Warning'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     showPWarning (src/Distribution/Parsec/Warning.hs:77)
Cabal-syntax>   40% (  2 /  5) in 'Distribution.Parsec.FieldLineStream'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     fieldLineStreamFromBS (src/Distribution/Parsec/FieldLineStream.hs:39)
Cabal-syntax>     fieldLineStreamEnd (src/Distribution/Parsec/FieldLineStream.hs:30)
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Parsec.Error'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     showPError (src/Distribution/Parsec/Error.hs:21)
Cabal-syntax>  100% (  2 /  2) in 'Distribution.PackageDescription.Quirks'
Cabal-syntax>   22% (  4 / 18) in 'Distribution.Fields.LexerMonad'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     InputStream (src/Distribution/Fields/LexerMonad.hs:124)
Cabal-syntax>     LexState (src/Distribution/Fields/LexerMonad.hs:102)
Cabal-syntax>     LexResult (src/Distribution/Fields/LexerMonad.hs:61)
Cabal-syntax>     Lex (src/Distribution/Fields/LexerMonad.hs:48)
Cabal-syntax>     getPos (src/Distribution/Fields/LexerMonad.hs:158)
Cabal-syntax>     setPos (src/Distribution/Fields/LexerMonad.hs:155)
Cabal-syntax>     adjustPos (src/Distribution/Fields/LexerMonad.hs:161)
Cabal-syntax>     getInput (src/Distribution/Fields/LexerMonad.hs:164)
Cabal-syntax>     setInput (src/Distribution/Fields/LexerMonad.hs:167)
Cabal-syntax>     getStartCode (src/Distribution/Fields/LexerMonad.hs:170)
Cabal-syntax>     setStartCode (src/Distribution/Fields/LexerMonad.hs:173)
Cabal-syntax>     LexWarning (src/Distribution/Fields/LexerMonad.hs:76)
Cabal-syntax>     LexWarningType (src/Distribution/Fields/LexerMonad.hs:63)
Cabal-syntax>     toPWarnings (src/Distribution/Fields/LexerMonad.hs:83)
Cabal-syntax>   20% (  2 / 10) in 'Distribution.Fields.Lexer'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     ltest (dist/build/Distribution/Fields/Lexer.hs:546)
Cabal-syntax>     lexToken (src/Distribution/Fields/Lexer.x:209)
Cabal-syntax>     LToken (src/Distribution/Fields/Lexer.x:166)
Cabal-syntax>     bol_section (dist/build/Distribution/Fields/Lexer.hs:159)
Cabal-syntax>     in_section (dist/build/Distribution/Fields/Lexer.hs:162)
Cabal-syntax>     in_field_layout (dist/build/Distribution/Fields/Lexer.hs:161)
Cabal-syntax>     in_field_braces (dist/build/Distribution/Fields/Lexer.hs:160)
Cabal-syntax>     mkLexState (dist/build/Distribution/Fields/Lexer.hs:552)
Cabal-syntax>  100% ( 23 / 23) in 'Distribution.Compat.Parsing'
Cabal-syntax> Warning: 'DList' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/DList.hs:27:19
Cabal-syntax>     * at src/Distribution/Compat/DList.hs:27:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/DList.hs:27:1
Cabal-syntax>   50% (  4 /  8) in 'Distribution.Compat.DList'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     runDList (src/Distribution/Compat/DList.hs:30)
Cabal-syntax>     fromList (src/Distribution/Compat/DList.hs:41)
Cabal-syntax>     toList (src/Distribution/Compat/DList.hs:44)
Cabal-syntax>     snoc (src/Distribution/Compat/DList.hs:47)
Cabal-syntax>   33% ( 16 / 48) in 'Distribution.Compat.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Lens (src/Distribution/Compat/Lens.hs:82)
Cabal-syntax>     Lens' (src/Distribution/Compat/Lens.hs:85)
Cabal-syntax>     Traversal (src/Distribution/Compat/Lens.hs:83)
Cabal-syntax>     Traversal' (src/Distribution/Compat/Lens.hs:86)
Cabal-syntax>     LensLike (src/Distribution/Compat/Lens.hs:79)
Cabal-syntax>     LensLike' (src/Distribution/Compat/Lens.hs:80)
Cabal-syntax>     Getting (src/Distribution/Compat/Lens.hs:88)
Cabal-syntax>     AGetter (src/Distribution/Compat/Lens.hs:90)
Cabal-syntax>     ASetter (src/Distribution/Compat/Lens.hs:91)
Cabal-syntax>     ALens (src/Distribution/Compat/Lens.hs:92)
Cabal-syntax>     ALens' (src/Distribution/Compat/Lens.hs:94)
Cabal-syntax>     view (src/Distribution/Compat/Lens.hs:101)
Cabal-syntax>     use (src/Distribution/Compat/Lens.hs:105)
Cabal-syntax>     set (src/Distribution/Compat/Lens.hs:121)
Cabal-syntax>     over (src/Distribution/Compat/Lens.hs:124)
Cabal-syntax>     toDListOf (src/Distribution/Compat/Lens.hs:131)
Cabal-syntax>     toListOf (src/Distribution/Compat/Lens.hs:134)
Cabal-syntax>     toSetOf (src/Distribution/Compat/Lens.hs:137)
Cabal-syntax>     cloneLens (src/Distribution/Compat/Lens.hs:234)
Cabal-syntax>     aview (src/Distribution/Compat/Lens.hs:144)
Cabal-syntax>     _1 (src/Distribution/Compat/Lens.hs:157)
Cabal-syntax>     _2 (src/Distribution/Compat/Lens.hs:160)
Cabal-syntax>     ^. (src/Distribution/Compat/Lens.hs:179)
Cabal-syntax>     .~ (src/Distribution/Compat/Lens.hs:183)
Cabal-syntax>     ?~ (src/Distribution/Compat/Lens.hs:187)
Cabal-syntax>     %~ (src/Distribution/Compat/Lens.hs:191)
Cabal-syntax>     .= (src/Distribution/Compat/Lens.hs:195)
Cabal-syntax>     ?= (src/Distribution/Compat/Lens.hs:199)
Cabal-syntax>     %= (src/Distribution/Compat/Lens.hs:203)
Cabal-syntax>     ^# (src/Distribution/Compat/Lens.hs:207)
Cabal-syntax>     #~ (src/Distribution/Compat/Lens.hs:210)
Cabal-syntax>     #%~ (src/Distribution/Compat/Lens.hs:214)
Cabal-syntax> Warning: 'CondBranch' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/CondTree.hs:80:25
Cabal-syntax>     * at src/Distribution/Types/CondTree.hs:80:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/CondTree.hs:80:1
Cabal-syntax> Warning: 'ConfVar' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Dependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'BuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'targetBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   61% ( 11 / 18) in 'Distribution.Types.CondTree'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     condIfThen (src/Distribution/Types/CondTree.hs:99)
Cabal-syntax>     condIfThenElse (src/Distribution/Types/CondTree.hs:102)
Cabal-syntax>     mapCondTree (src/Distribution/Types/CondTree.hs:110)
Cabal-syntax>     mapTreeConstrs (src/Distribution/Types/CondTree.hs:120)
Cabal-syntax>     mapTreeConds (src/Distribution/Types/CondTree.hs:123)
Cabal-syntax>     mapTreeData (src/Distribution/Types/CondTree.hs:126)
Cabal-syntax>   88% ( 22 / 25) in 'Distribution.Compat.CharParsing'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     satisfyRange (src/Distribution/Compat/CharParsing.hs:148)
Cabal-syntax>     integral (src/Distribution/Compat/CharParsing.hs:321)
Cabal-syntax>     skipSpaces1 (src/Distribution/Compat/CharParsing.hs:359)
Cabal-syntax>   41% (  5 / 12) in 'Distribution.CabalSpecVersion'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     cabalSpecLatest (src/Distribution/CabalSpecVersion.hs:68)
Cabal-syntax>     specHasCommonStanzas (src/Distribution/CabalSpecVersion.hs:138)
Cabal-syntax>     specHasElif (src/Distribution/CabalSpecVersion.hs:144)
Cabal-syntax>     HasElif (src/Distribution/CabalSpecVersion.hs:154)
Cabal-syntax>     HasCommonStanzas (src/Distribution/CabalSpecVersion.hs:157)
Cabal-syntax>     HasGlobstar (src/Distribution/CabalSpecVersion.hs:160)
Cabal-syntax>   33% (  1 /  3) in 'Distribution.SPDX.LicenseListVersion'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:20)
Cabal-syntax>   46% (  6 / 13) in 'Distribution.Pretty'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Pretty (src/Distribution/Pretty.hs:24)
Cabal-syntax>     prettyShow (src/Distribution/Pretty.hs:44)
Cabal-syntax>     showFilePath (src/Distribution/Pretty.hs:82)
Cabal-syntax>     showToken (src/Distribution/Pretty.hs:85)
Cabal-syntax>     showTokenStr (src/Distribution/Pretty.hs:88)
Cabal-syntax>     Separator (src/Distribution/Pretty.hs:79)
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: 'FieldLine' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:77:22
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:77:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:77:1
Cabal-syntax>   75% ( 15 / 20) in 'Distribution.Fields.Field'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     fieldAnn (src/Distribution/Fields/Field.hs:64)
Cabal-syntax>     FieldName (src/Distribution/Fields/Field.hs:114)
Cabal-syntax>     mkName (src/Distribution/Fields/Field.hs:126)
Cabal-syntax>     getName (src/Distribution/Fields/Field.hs:129)
Cabal-syntax>     nameAnn (src/Distribution/Fields/Field.hs:132)
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: 'LexState'' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Parser.hs:66:18
Cabal-syntax>     * at src/Distribution/Fields/Parser.hs:66:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Parser.hs:66:1
Cabal-syntax> Warning: 'LexState' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/LexerMonad.hs:102:17
Cabal-syntax>     * at src/Distribution/Fields/LexerMonad.hs:102:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/LexerMonad.hs:102:1
Cabal-syntax> Warning: ':' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>  100% ( 10 / 10) in 'Distribution.Fields.Parser'
Cabal-syntax> Warning: 'Field' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Section' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'genericFromParsecField' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   81% (  9 / 11) in 'Distribution.Fields.Pretty'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     PrettyField (src/Distribution/Fields/Pretty.hs:44)
Cabal-syntax>     genericFromParsecFields (src/Distribution/Fields/Pretty.hs:184)
Cabal-syntax> Warning: 'sepBy' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   73% ( 31 / 42) in 'Distribution.Parsec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ParsecParser (src/Distribution/Parsec.hs:101)
Cabal-syntax>     showPWarning (src/Distribution/Parsec/Warning.hs:77)
Cabal-syntax>     showPError (src/Distribution/Parsec/Error.hs:21)
Cabal-syntax>     showPos (src/Distribution/Parsec/Position.hs:35)
Cabal-syntax>     zeroPos (src/Distribution/Parsec/Position.hs:38)
Cabal-syntax>     parsecFilePath (src/Distribution/Parsec.hs:284)
Cabal-syntax>     parsecCommaList (src/Distribution/Parsec.hs:302)
Cabal-syntax>     parsecCommaNonEmpty (src/Distribution/Parsec.hs:305)
Cabal-syntax>     parsecOptCommaList (src/Distribution/Parsec.hs:338)
Cabal-syntax>     parsecUnqualComponentName (src/Distribution/Parsec.hs:381)
Cabal-syntax> Warning: 'SymbolicPath' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/Path.hs:41:32
Cabal-syntax>     * at src/Distribution/Utils/Path.hs:41:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/Path.hs:41:1
Cabal-syntax>   54% (  6 / 11) in 'Distribution.Utils.Path'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     sameDirectory (src/Distribution/Utils/Path.hs:55)
Cabal-syntax>     PackageDir (src/Distribution/Utils/Path.hs:104)
Cabal-syntax>     SourceDir (src/Distribution/Utils/Path.hs:105)
Cabal-syntax>     LicenseFile (src/Distribution/Utils/Path.hs:107)
Cabal-syntax> Warning: 'Version' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Version.hs:42:1
Cabal-syntax>     * in ‘GHC.Internal.Data.Version’
Cabal-syntax>     * in ‘GHC.Internal.Data.Version’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Version.hs:42:1
Cabal-syntax>   83% ( 10 / 12) in 'Distribution.Types.Version'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     validVersion (src/Distribution/Types/Version.hs:261)
Cabal-syntax> Warning: 'PkgConfigVersionRange' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   95% ( 22 / 23) in 'Distribution.Types.VersionRange.Internal'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
Cabal-syntax> Warning: 'foldVersionRange' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'VersionIntervals' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/VersionInterval/Legacy.hs:98:28
Cabal-syntax>     * at src/Distribution/Types/VersionInterval/Legacy.hs:98:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/VersionInterval/Legacy.hs:98:1
Cabal-syntax>   84% ( 16 / 19) in 'Distribution.Types.VersionInterval.Legacy'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     LowerBound (src/Distribution/Types/VersionInterval/Legacy.hs:115)
Cabal-syntax>     UpperBound (src/Distribution/Types/VersionInterval/Legacy.hs:120)
Cabal-syntax>     Bound (src/Distribution/Types/VersionInterval/Legacy.hs:127)
Cabal-syntax> Warning: 'foldVersionRange' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'VersionIntervals' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:67:28
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:67:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/VersionInterval.hs:67:1
Cabal-syntax>   71% ( 15 / 21) in 'Distribution.Types.VersionInterval'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     relaxLastInterval (src/Distribution/Types/VersionInterval.hs:334)
Cabal-syntax>     relaxHeadInterval (src/Distribution/Types/VersionInterval.hs:341)
Cabal-syntax>     VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
Cabal-syntax>     LowerBound (src/Distribution/Types/VersionInterval.hs:81)
Cabal-syntax>     UpperBound (src/Distribution/Types/VersionInterval.hs:82)
Cabal-syntax>     Bound (src/Distribution/Types/VersionInterval.hs:83)
Cabal-syntax> Warning: 'AnyVersion' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'VersionRangeParens' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   89% ( 33 / 37) in 'Distribution.Types.VersionRange'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
Cabal-syntax>     isAnyVersionLight (src/Distribution/Types/VersionRange.hs:158)
Cabal-syntax>     isWildcardRange (src/Distribution/Types/VersionRange.hs:166)
Cabal-syntax> Warning: 'SourceRepo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/SourceRepo.hs:48:19
Cabal-syntax>     * at src/Distribution/Types/SourceRepo.hs:48:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/SourceRepo.hs:48:1
Cabal-syntax> Warning: 'ReopKind' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   33% (  3 /  9) in 'Distribution.Types.SourceRepo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     RepoType (src/Distribution/Types/SourceRepo.hs:146)
Cabal-syntax>     knownRepoTypes (src/Distribution/Types/SourceRepo.hs:156)
Cabal-syntax>     emptySourceRepo (src/Distribution/Types/SourceRepo.hs:83)
Cabal-syntax>     classifyRepoType (src/Distribution/Types/SourceRepo.hs:186)
Cabal-syntax>     classifyRepoKind (src/Distribution/Types/SourceRepo.hs:173)
Cabal-syntax> Warning: Distribution.Types.SourceRepo.Lens: Could not find documentation for exported module: Distribution.Types.SourceRepo.Lens
Cabal-syntax>   11% (  1 /  9) in 'Distribution.Types.SourceRepo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     repoBranch (src/Distribution/Types/SourceRepo/Lens.hs:30)
Cabal-syntax>     repoKind (src/Distribution/Types/SourceRepo/Lens.hs:14)
Cabal-syntax>     repoLocation (src/Distribution/Types/SourceRepo/Lens.hs:22)
Cabal-syntax>     repoModule (src/Distribution/Types/SourceRepo/Lens.hs:26)
Cabal-syntax>     repoSubdir (src/Distribution/Types/SourceRepo/Lens.hs:38)
Cabal-syntax>     repoTag (src/Distribution/Types/SourceRepo/Lens.hs:34)
Cabal-syntax>     repoType (src/Distribution/Types/SourceRepo/Lens.hs:18)
Cabal-syntax>   66% (  2 /  3) in 'Distribution.Types.PkgconfigVersion'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   37% (  3 /  8) in 'Distribution.Types.PkgconfigVersionRange'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     anyPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:125)
Cabal-syntax>     withinPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:132)
Cabal-syntax>     versionToPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:148)
Cabal-syntax>     versionRangeToPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:151)
Cabal-syntax> Warning: 'PkgconfigName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PkgconfigName.hs:26:25
Cabal-syntax>     * at src/Distribution/Types/PkgconfigName.hs:26:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PkgconfigName.hs:26:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.PkgconfigName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.PkgconfigDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'PackageName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageName.hs:29:23
Cabal-syntax>     * at src/Distribution/Types/PackageName.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageName.hs:29:1
Cabal-syntax>   83% (  5 /  6) in 'Distribution.Types.PackageName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'UnqualComponentName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/UnqualComponentName.hs:29:31
Cabal-syntax>     * at src/Distribution/Types/UnqualComponentName.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/UnqualComponentName.hs:29:1
Cabal-syntax> Warning: 'ComponentName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ComponentId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   87% (  7 /  8) in 'Distribution.Types.UnqualComponentName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.LibraryVisibility'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   30% (  3 / 10) in 'Distribution.Types.LibraryName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     LibraryName (src/Distribution/Types/LibraryName.hs:27)
Cabal-syntax>     defaultLibName (src/Distribution/Types/LibraryName.hs:56)
Cabal-syntax>     showLibraryName (src/Distribution/Types/LibraryName.hs:59)
Cabal-syntax>     libraryNameStanza (src/Distribution/Types/LibraryName.hs:63)
Cabal-syntax>     libraryNameString (src/Distribution/Types/LibraryName.hs:67)
Cabal-syntax>     parsecLibraryNameComponent (src/Distribution/Types/LibraryName.hs:46)
Cabal-syntax> Warning: 'MungedPackageId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'UnitId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'mkMungedPackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'unMungedPackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'foo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.MungedPackageName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.ForeignLibType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownForeignLibTypes (src/Distribution/Types/ForeignLibType.hs:59)
Cabal-syntax>     foreignLibTypeIsShared (src/Distribution/Types/ForeignLibType.hs:65)
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ForeignLibOption'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ForeignLibOption (src/Distribution/Types/ForeignLibOption.hs:18)
Cabal-syntax> Warning: 'FlagAssignment' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:129:26
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:129:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Flag.hs:129:1
Cabal-syntax> Warning: 'FlagName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:82:20
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:82:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Flag.hs:82:1
Cabal-syntax> Warning: 'null' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/ShortText.hs:115:1
Cabal-syntax>     * in ‘GHC.Internal.Data.Foldable’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/ShortText.hs:115:1
Cabal-syntax>   96% ( 25 / 26) in 'Distribution.Types.Flag'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Any' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ExecutableScope'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ExecutableScope (src/Distribution/Types/ExecutableScope.hs:18)
Cabal-syntax>   16% (  1 /  6) in 'Distribution.Types.ComponentName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ComponentName (src/Distribution/Types/ComponentName.hs:25)
Cabal-syntax>     showComponentName (src/Distribution/Types/ComponentName.hs:80)
Cabal-syntax>     componentNameRaw (src/Distribution/Types/ComponentName.hs:87)
Cabal-syntax>     componentNameStanza (src/Distribution/Types/ComponentName.hs:91)
Cabal-syntax> Warning: 'ComponentId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ComponentId.hs:34:23
Cabal-syntax>     * at src/Distribution/Types/ComponentId.hs:34:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ComponentId.hs:34:1
Cabal-syntax> Warning: 'UnitId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.ComponentId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.BuildType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownBuildTypes (src/Distribution/Types/BuildType.hs:39)
Cabal-syntax> Warning: 'AbiHash' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/AbiHash.hs:29:19
Cabal-syntax>     * at src/Distribution/Types/AbiHash.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/AbiHash.hs:29:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.AbiHash'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>    0% (  0 /  3) in 'Distribution.Text'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     display (src/Distribution/Text.hs:10)
Cabal-syntax>     simpleParse (src/Distribution/Text.hs:13)
Cabal-syntax>   55% ( 10 / 18) in 'Distribution.System'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     buildOS (src/Distribution/System.hs:176)
Cabal-syntax>     buildArch (src/Distribution/System.hs:282)
Cabal-syntax>     Platform (src/Distribution/System.hs:290)
Cabal-syntax>     platformFromTriple (src/Distribution/System.hs:336)
Cabal-syntax>     knownOSs (src/Distribution/System.hs:124)
Cabal-syntax>     knownArches (src/Distribution/System.hs:227)
Cabal-syntax>     classifyOS (src/Distribution/System.hs:166)
Cabal-syntax>     classifyArch (src/Distribution/System.hs:272)
Cabal-syntax> Warning: 'LicenseRef' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/SPDX/LicenseReference.hs:23:19
Cabal-syntax>     * at src/Distribution/SPDX/LicenseReference.hs:23:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/SPDX/LicenseReference.hs:23:1
Cabal-syntax>   83% (  5 /  6) in 'Distribution.SPDX.LicenseReference'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'License' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'BSD2' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'BSD3' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'OtherLicense' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'AllRightsReserved' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PublicDomain' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   80% (  8 / 10) in 'Distribution.SPDX.LicenseId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     licenseIdList (src/Distribution/SPDX/LicenseId.hs:2216)
Cabal-syntax>   66% (  4 /  6) in 'Distribution.SPDX.LicenseExceptionId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:278)
Cabal-syntax>   50% (  2 /  4) in 'Distribution.SPDX.LicenseExpression'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:59)
Cabal-syntax> Warning: 'License' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:43:5
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax> Warning: 'LicenseRef' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  1 /  2) in 'Distribution.SPDX.License'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   86% ( 25 / 29) in 'Distribution.SPDX'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:59)
Cabal-syntax>     licenseIdList (src/Distribution/SPDX/LicenseId.hs:2216)
Cabal-syntax>     licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:278)
Cabal-syntax>     cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:20)
Cabal-syntax> Warning: 'ModuleName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/ModuleName.hs:42:22
Cabal-syntax>     * at src/Distribution/ModuleName.hs:42:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/ModuleName.hs:42:1
Cabal-syntax>   77% (  7 /  9) in 'Distribution.ModuleName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     fromString
Cabal-syntax>     validModuleComponent (src/Distribution/ModuleName.hs:91)
Cabal-syntax> Warning: 'ModuleRenaming' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ModuleRenaming.hs:36:5
Cabal-syntax>     * at src/Distribution/Types/ModuleRenaming.hs:33:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ModuleRenaming.hs:33:1
Cabal-syntax>   80% (  4 /  5) in 'Distribution.Types.ModuleRenaming'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'IncludeRenaming' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/IncludeRenaming.hs:25:24
Cabal-syntax>     * at src/Distribution/Types/IncludeRenaming.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/IncludeRenaming.hs:25:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.IncludeRenaming'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Mixin' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Mixin.hs:29:14
Cabal-syntax>     * at src/Distribution/Types/Mixin.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Mixin.hs:29:1
Cabal-syntax> Warning: 'Dependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.Mixin'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ModuleReexport'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ModuleReexport (src/Distribution/Types/ModuleReexport.hs:22)
Cabal-syntax> Warning: 'fromList' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>  100% ( 42 / 42) in 'Distribution.Compat.Graph'
Cabal-syntax> Warning: 'VersionInterval' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:80:24
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:80:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/VersionInterval.hs:80:1
Cabal-syntax>   92% ( 58 / 63) in 'Distribution.Version'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
Cabal-syntax>     VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
Cabal-syntax>     LowerBound (src/Distribution/Types/VersionInterval.hs:81)
Cabal-syntax>     UpperBound (src/Distribution/Types/VersionInterval.hs:82)
Cabal-syntax>     Bound (src/Distribution/Types/VersionInterval.hs:83)
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.TestType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownTestTypes (src/Distribution/Types/TestType.hs:36)
Cabal-syntax>     testTypeExe (src/Distribution/Types/TestType.hs:42)
Cabal-syntax>     testTypeLib (src/Distribution/Types/TestType.hs:45)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.TestSuiteInterface'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Text' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   66% (  2 /  3) in 'Distribution.Types.PackageId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'display' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'DefUnitId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:120:21
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:120:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/UnitId.hs:120:1
Cabal-syntax> Warning: 'UnitId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:66:18
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:66:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/UnitId.hs:66:1
Cabal-syntax> Warning: 'unitIdHash' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'OpenUnitId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   70% (  7 / 10) in 'Distribution.Types.UnitId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     mkUnitId (src/Distribution/Types/UnitId.hs:95)
Cabal-syntax>     unDefUnitId
Cabal-syntax> Warning: 'InstalledPackageInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.Module'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Module' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Module.hs:28:5
Cabal-syntax>     * at src/Distribution/Types/Module.hs:27:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Module.hs:27:1
Cabal-syntax> Warning: 'OpenModule' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Backpack.hs:166:5
Cabal-syntax>     * at src/Distribution/Backpack.hs:165:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Backpack.hs:165:1
Cabal-syntax> Warning: 'ModuleVar' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'dispModSubst' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'dispModSubstEntry' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ModuleSubst' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   95% ( 21 / 22) in 'Distribution.Backpack'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     unDefUnitId
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ExposedModule'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
Cabal-syntax> Warning: 'ExeDependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Dependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PackageVersionConstraint' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageVersionConstraint.hs:28:33
Cabal-syntax>     * at src/Distribution/Types/PackageVersionConstraint.hs:28:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageVersionConstraint.hs:28:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.PackageVersionConstraint'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: Distribution.Types.PackageId.Lens: Could not find documentation for exported module: Distribution.Types.PackageId.Lens
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.PackageId.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     pkgName (src/Distribution/Types/PackageId/Lens.hs:17)
Cabal-syntax>     pkgVersion (src/Distribution/Types/PackageId/Lens.hs:21)
Cabal-syntax> Warning: 'MungedPackageName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/MungedPackageName.hs:33:26
Cabal-syntax>     * at src/Distribution/Types/MungedPackageName.hs:33:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/MungedPackageName.hs:33:1
Cabal-syntax> Warning: 'MungedPackageId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/MungedPackageId.hs:24:24
Cabal-syntax>     * at src/Distribution/Types/MungedPackageId.hs:24:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/MungedPackageId.hs:24:1
Cabal-syntax> Warning: 'PackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.MungedPackageId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     computeCompatPackageId (src/Distribution/Types/MungedPackageId.hs:76)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.LegacyExeDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.ExeDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     qualifiedExeName (src/Distribution/Types/ExeDependency.hs:72)
Cabal-syntax> Warning: 'Dependency' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:44:5
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax> Warning: 'DependencyMap' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  4 /  8) in 'Distribution.Types.Dependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     depPkgName (src/Distribution/Types/Dependency.hs:51)
Cabal-syntax>     depVerRange (src/Distribution/Types/Dependency.hs:54)
Cabal-syntax>     depLibraries (src/Distribution/Types/Dependency.hs:57)
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.SetupBuildInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
Cabal-syntax> Warning: Distribution.Types.SetupBuildInfo.Lens: Could not find documentation for exported module: Distribution.Types.SetupBuildInfo.Lens
Cabal-syntax>    0% (  0 /  4) in 'Distribution.Types.SetupBuildInfo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
Cabal-syntax>     defaultSetupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:20)
Cabal-syntax>     setupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:16)
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.DependencyMap'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     toDepMap (src/Distribution/Types/DependencyMap.hs:40)
Cabal-syntax>     fromDepMap (src/Distribution/Types/DependencyMap.hs:44)
Cabal-syntax>     constrainBy (src/Distribution/Types/DependencyMap.hs:54)
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.BenchmarkType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownBenchmarkTypes (src/Distribution/Types/BenchmarkType.hs:32)
Cabal-syntax>     benchmarkTypeExe (src/Distribution/Types/BenchmarkType.hs:35)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.BenchmarkInterface'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'PackageIdentifier' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageId.hs:25:26
Cabal-syntax>     * at src/Distribution/Types/PackageId.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageId.hs:25:1
Cabal-syntax> Warning: 'Dependency' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:44:5
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax> Warning: 'InstalledPackageInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   70% ( 12 / 17) in 'Distribution.Package'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     packageName (src/Distribution/Package.hs:81)
Cabal-syntax>     packageVersion (src/Distribution/Package.hs:84)
Cabal-syntax>     HasMungedPackageId (src/Distribution/Package.hs:74)
Cabal-syntax>     mungedName' (src/Distribution/Package.hs:69)
Cabal-syntax>     mungedVersion' (src/Distribution/Package.hs:72)
Cabal-syntax> Warning: 'abiHash' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.AbiDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'License' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/License.hs:67:1
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:43:5
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax>  100% (  5 /  5) in 'Distribution.License'
Cabal-syntax>   28% (  2 /  7) in 'Distribution.Types.InstalledPackageInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
Cabal-syntax>     emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:132)
Cabal-syntax>     mungedPackageId (src/Distribution/Types/InstalledPackageInfo.hs:123)
Cabal-syntax>     ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo.Lens: Could not find documentation for exported module: Distribution.Types.InstalledPackageInfo.Lens
Cabal-syntax>    0% (  0 / 46) in 'Distribution.Types.InstalledPackageInfo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
Cabal-syntax>     abiDepends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:159)
Cabal-syntax>     abiHash (src/Distribution/Types/InstalledPackageInfo/Lens.hs:87)
Cabal-syntax>     author (src/Distribution/Types/InstalledPackageInfo/Lens.hs:59)
Cabal-syntax>     category (src/Distribution/Types/InstalledPackageInfo/Lens.hs:83)
Cabal-syntax>     ccOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:163)
Cabal-syntax>     compatPackageKey (src/Distribution/Types/InstalledPackageInfo/Lens.hs:43)
Cabal-syntax>     copyright (src/Distribution/Types/InstalledPackageInfo/Lens.hs:51)
Cabal-syntax>     cxxOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:167)
Cabal-syntax>     dataDir (src/Distribution/Types/InstalledPackageInfo/Lens.hs:127)
Cabal-syntax>     depends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:155)
Cabal-syntax>     description (src/Distribution/Types/InstalledPackageInfo/Lens.hs:79)
Cabal-syntax>     exposed (src/Distribution/Types/InstalledPackageInfo/Lens.hs:95)
Cabal-syntax>     exposedModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:99)
Cabal-syntax>     extraGHCiLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:143)
Cabal-syntax>     extraLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:135)
Cabal-syntax>     extraLibrariesStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:139)
Cabal-syntax>     frameworkDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:175)
Cabal-syntax>     frameworks (src/Distribution/Types/InstalledPackageInfo/Lens.hs:179)
Cabal-syntax>     haddockHTMLs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:187)
Cabal-syntax>     haddockInterfaces (src/Distribution/Types/InstalledPackageInfo/Lens.hs:183)
Cabal-syntax>     hiddenModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:103)
Cabal-syntax>     homepage (src/Distribution/Types/InstalledPackageInfo/Lens.hs:67)
Cabal-syntax>     hsLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:131)
Cabal-syntax>     importDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:111)
Cabal-syntax>     includeDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:147)
Cabal-syntax>     includes (src/Distribution/Types/InstalledPackageInfo/Lens.hs:151)
Cabal-syntax>     indefinite (src/Distribution/Types/InstalledPackageInfo/Lens.hs:91)
Cabal-syntax>     installedComponentId_ (src/Distribution/Types/InstalledPackageInfo/Lens.hs:31)
Cabal-syntax>     installedUnitId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:27)
Cabal-syntax>     instantiatedWith (src/Distribution/Types/InstalledPackageInfo/Lens.hs:35)
Cabal-syntax>     ldOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:171)
Cabal-syntax>     libVisibility (src/Distribution/Types/InstalledPackageInfo/Lens.hs:195)
Cabal-syntax>     libraryDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:115)
Cabal-syntax>     libraryDirsStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:119)
Cabal-syntax>     libraryDynDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:123)
Cabal-syntax>     license (src/Distribution/Types/InstalledPackageInfo/Lens.hs:47)
Cabal-syntax>     maintainer (src/Distribution/Types/InstalledPackageInfo/Lens.hs:55)
Cabal-syntax>     pkgRoot (src/Distribution/Types/InstalledPackageInfo/Lens.hs:191)
Cabal-syntax>     pkgUrl (src/Distribution/Types/InstalledPackageInfo/Lens.hs:71)
Cabal-syntax>     sourceLibName (src/Distribution/Types/InstalledPackageInfo/Lens.hs:39)
Cabal-syntax>     sourcePackageId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:23)
Cabal-syntax>     stability (src/Distribution/Types/InstalledPackageInfo/Lens.hs:63)
Cabal-syntax>     synopsis (src/Distribution/Types/InstalledPackageInfo/Lens.hs:75)
Cabal-syntax>     trusted (src/Distribution/Types/InstalledPackageInfo/Lens.hs:107)
Cabal-syntax>  100% ( 12 / 12) in 'Distribution.Fields.ParseResult'
Cabal-syntax>   83% ( 26 / 31) in 'Distribution.Fields'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     FieldName (src/Distribution/Fields/Field.hs:114)
Cabal-syntax>     showPWarning (src/Distribution/Parsec/Warning.hs:77)
Cabal-syntax>     showPError (src/Distribution/Parsec/Error.hs:21)
Cabal-syntax>     PrettyField (src/Distribution/Fields/Pretty.hs:44)
Cabal-syntax>     genericFromParsecFields (src/Distribution/Fields/Pretty.hs:184)
Cabal-syntax> Warning: 'IsList' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'A' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Z' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   66% (  6 /  9) in 'Language.Haskell.Extension'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     classifyLanguage (src/Language/Haskell/Extension.hs:81)
Cabal-syntax>     classifyExtension (src/Language/Haskell/Extension.hs:585)
Cabal-syntax>     knownExtensions (src/Language/Haskell/Extension.hs:623)
Cabal-syntax> Warning: 'Compiler' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'UserHooks' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PerCompilerFlavor' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compiler.hs:139:28
Cabal-syntax>     * at src/Distribution/Compiler.hs:139:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compiler.hs:139:1
Cabal-syntax>   50% (  9 / 18) in 'Distribution.Compiler'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     CompilerFlavor (src/Distribution/Compiler.hs:66)
Cabal-syntax>     buildCompilerId (src/Distribution/Compiler.hs:120)
Cabal-syntax>     buildCompilerFlavor (src/Distribution/Compiler.hs:114)
Cabal-syntax>     classifyCompilerFlavor (src/Distribution/Compiler.hs:105)
Cabal-syntax>     knownCompilerFlavors (src/Distribution/Compiler.hs:88)
Cabal-syntax>     perCompilerFlavorToList (src/Distribution/Compiler.hs:158)
Cabal-syntax>     CompilerId (src/Distribution/Compiler.hs:176)
Cabal-syntax>     AbiTag (src/Distribution/Compiler.hs:224)
Cabal-syntax>     abiTagString (src/Distribution/Compiler.hs:242)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.ConfVar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Fields.ConfVar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     parseConditionConfVarFromClause (src/Distribution/Fields/ConfVar.hs:36)
Cabal-syntax> Warning: 'Extensions' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'rts' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   45% (  5 / 11) in 'Distribution.Types.BuildInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
Cabal-syntax>     emptyBuildInfo (src/Distribution/Types/BuildInfo.hs:256)
Cabal-syntax>     hcProfOptions (src/Distribution/Types/BuildInfo.hs:290)
Cabal-syntax>     hcSharedOptions (src/Distribution/Types/BuildInfo.hs:293)
Cabal-syntax>     hcStaticOptions (src/Distribution/Types/BuildInfo.hs:296)
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax> Warning: 'PackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'sanityCheckHookedBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'LocalBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'updatePackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'localPkgDescr' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'confHook' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.HookedBuildInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     emptyHookedBuildInfo (src/Distribution/Types/HookedBuildInfo.hs:66)
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.BuildInfo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
Cabal-syntax>     HasBuildInfos (src/Distribution/Types/BuildInfo/Lens.hs:354)
Cabal-syntax>   50% (  3 /  6) in 'Distribution.Types.TestSuite'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     emptyTestSuite (src/Distribution/Types/TestSuite.hs:63)
Cabal-syntax>     testType (src/Distribution/Types/TestSuite.hs:66)
Cabal-syntax> Warning: Distribution.Types.TestSuite.Lens: Could not find documentation for exported module: Distribution.Types.TestSuite.Lens
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.TestSuite.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     testBuildInfo (src/Distribution/Types/TestSuite/Lens.hs:26)
Cabal-syntax>     testInterface (src/Distribution/Types/TestSuite/Lens.hs:22)
Cabal-syntax>     testName (src/Distribution/Types/TestSuite/Lens.hs:18)
Cabal-syntax> Warning: 'libModules' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'addBuildableCondition' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   40% (  2 /  5) in 'Distribution.Types.Library'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Library (src/Distribution/Types/Library.hs:22)
Cabal-syntax>     emptyLibrary (src/Distribution/Types/Library.hs:44)
Cabal-syntax> Warning: Distribution.Types.Library.Lens: Could not find documentation for exported module: Distribution.Types.Library.Lens
Cabal-syntax>    0% (  0 /  9) in 'Distribution.Types.Library.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Library (src/Distribution/Types/Library.hs:22)
Cabal-syntax>     exposedModules (src/Distribution/Types/Library/Lens.hs:24)
Cabal-syntax>     libBuildInfo (src/Distribution/Types/Library/Lens.hs:44)
Cabal-syntax>     libExposed (src/Distribution/Types/Library/Lens.hs:36)
Cabal-syntax>     libName (src/Distribution/Types/Library/Lens.hs:20)
Cabal-syntax>     libVisibility (src/Distribution/Types/Library/Lens.hs:40)
Cabal-syntax>     reexportedModules (src/Distribution/Types/Library/Lens.hs:28)
Cabal-syntax>     signatures (src/Distribution/Types/Library/Lens.hs:32)
Cabal-syntax> Warning: 'LibVersionInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:64:23
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:64:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ForeignLib.hs:64:1
Cabal-syntax>   83% ( 10 / 12) in 'Distribution.Types.ForeignLib'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     LibVersionInfo (src/Distribution/Types/ForeignLib.hs:64)
Cabal-syntax> Warning: Distribution.Types.ForeignLib.Lens: Could not find documentation for exported module: Distribution.Types.ForeignLib.Lens
Cabal-syntax>   11% (  1 /  9) in 'Distribution.Types.ForeignLib.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     foreignLibBuildInfo (src/Distribution/Types/ForeignLib/Lens.hs:32)
Cabal-syntax>     foreignLibModDefFile (src/Distribution/Types/ForeignLib/Lens.hs:44)
Cabal-syntax>     foreignLibName (src/Distribution/Types/ForeignLib/Lens.hs:20)
Cabal-syntax>     foreignLibOptions (src/Distribution/Types/ForeignLib/Lens.hs:28)
Cabal-syntax>     foreignLibType (src/Distribution/Types/ForeignLib/Lens.hs:24)
Cabal-syntax>     foreignLibVersionInfo (src/Distribution/Types/ForeignLib/Lens.hs:36)
Cabal-syntax>     foreignLibVersionLinux (src/Distribution/Types/ForeignLib/Lens.hs:40)
Cabal-syntax>   40% (  2 /  5) in 'Distribution.Types.Executable'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Executable (src/Distribution/Types/Executable.hs:21)
Cabal-syntax>     emptyExecutable (src/Distribution/Types/Executable.hs:52)
Cabal-syntax> Warning: Distribution.Types.Executable.Lens: Could not find documentation for exported module: Distribution.Types.Executable.Lens
Cabal-syntax>    0% (  0 /  6) in 'Distribution.Types.Executable.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Executable (src/Distribution/Types/Executable.hs:21)
Cabal-syntax>     exeBuildInfo (src/Distribution/Types/Executable/Lens.hs:30)
Cabal-syntax>     exeName (src/Distribution/Types/Executable/Lens.hs:18)
Cabal-syntax>     exeScope (src/Distribution/Types/Executable/Lens.hs:26)
Cabal-syntax>     modulePath (src/Distribution/Types/Executable/Lens.hs:22)
Cabal-syntax>   50% (  3 /  6) in 'Distribution.Types.Benchmark'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     emptyBenchmark (src/Distribution/Types/Benchmark.hs:59)
Cabal-syntax>     benchmarkType (src/Distribution/Types/Benchmark.hs:62)
Cabal-syntax>   14% (  1 /  7) in 'Distribution.Types.Component'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Component (src/Distribution/Types/Component.hs:26)
Cabal-syntax>     foldComponent (src/Distribution/Types/Component.hs:60)
Cabal-syntax>     componentBuildInfo (src/Distribution/Types/Component.hs:67)
Cabal-syntax>     componentName (src/Distribution/Types/Component.hs:79)
Cabal-syntax>     partitionComponents (src/Distribution/Types/Component.hs:90)
Cabal-syntax> Warning: 'PackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ComponentRequestedSpec' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ComponentRequestedSpec.hs:65:5
Cabal-syntax>     * at src/Distribution/Types/ComponentRequestedSpec.hs:64:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ComponentRequestedSpec.hs:64:1
Cabal-syntax> Warning: 'LocalBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'flattenPD' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   87% (  7 /  8) in 'Distribution.Types.ComponentRequestedSpec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Library' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Library.hs:22:16
Cabal-syntax>     * at src/Distribution/Types/Library.hs:22:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Library.hs:22:1
Cabal-syntax> Warning: 'Executable' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Executable.hs:21:19
Cabal-syntax>     * at src/Distribution/Types/Executable.hs:21:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Executable.hs:21:1
Cabal-syntax> Warning: 'TestSuite' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax> Warning: 'Benchmark' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:27
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax> Warning: 'GenericPackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'LicenseExpression' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withBenchLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'LocalBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withExeLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ForeignLib' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:40:19
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ForeignLib.hs:40:1
Cabal-syntax> Warning: 'withLibLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withTestLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   82% ( 23 / 28) in 'Distribution.Types.PackageDescription'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     emptyPackageDescription (src/Distribution/Types/PackageDescription.hs:200)
Cabal-syntax>     allLibraries (src/Distribution/Types/PackageDescription.hs:252)
Cabal-syntax>     updatePackageDescription (src/Distribution/Types/PackageDescription.hs:371)
Cabal-syntax>     lookupComponent (src/Distribution/Types/PackageDescription.hs:431)
Cabal-syntax>     getComponent (src/Distribution/Types/PackageDescription.hs:443)
Cabal-syntax>    0% (  0 /  3) in 'Distribution.Types.GenericPackageDescription'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
Cabal-syntax>     emptyGenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:84)
Cabal-syntax> Warning: Distribution.Types.GenericPackageDescription.Lens: Could not find documentation for exported module: Distribution.Types.GenericPackageDescription.Lens
Cabal-syntax>   13% (  3 / 23) in 'Distribution.Types.GenericPackageDescription.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
Cabal-syntax>     _Arch (src/Distribution/Types/GenericPackageDescription/Lens.hs:125)
Cabal-syntax>     _Impl (src/Distribution/Types/GenericPackageDescription/Lens.hs:133)
Cabal-syntax>     _OS (src/Distribution/Types/GenericPackageDescription/Lens.hs:121)
Cabal-syntax>     _PackageFlag (src/Distribution/Types/GenericPackageDescription/Lens.hs:129)
Cabal-syntax>     allCondTrees (src/Distribution/Types/GenericPackageDescription/Lens.hs:84)
Cabal-syntax>     condBenchmarks (src/Distribution/Types/GenericPackageDescription/Lens.hs:73)
Cabal-syntax>     condExecutables (src/Distribution/Types/GenericPackageDescription/Lens.hs:65)
Cabal-syntax>     condForeignLibs (src/Distribution/Types/GenericPackageDescription/Lens.hs:61)
Cabal-syntax>     condLibrary (src/Distribution/Types/GenericPackageDescription/Lens.hs:53)
Cabal-syntax>     condSubLibraries (src/Distribution/Types/GenericPackageDescription/Lens.hs:57)
Cabal-syntax>     condTestSuites (src/Distribution/Types/GenericPackageDescription/Lens.hs:69)
Cabal-syntax>     flagDefault (src/Distribution/Types/GenericPackageDescription/Lens.hs:109)
Cabal-syntax>     flagDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:105)
Cabal-syntax>     flagManual (src/Distribution/Types/GenericPackageDescription/Lens.hs:113)
Cabal-syntax>     flagName (src/Distribution/Types/GenericPackageDescription/Lens.hs:101)
Cabal-syntax>     genPackageFlags (src/Distribution/Types/GenericPackageDescription/Lens.hs:49)
Cabal-syntax>     gpdScannedVersion (src/Distribution/Types/GenericPackageDescription/Lens.hs:45)
Cabal-syntax>     packageDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:41)
Cabal-syntax> Warning: Distribution.Types.Benchmark.Lens: Could not find documentation for exported module: Distribution.Types.Benchmark.Lens
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.Benchmark.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     benchmarkBuildInfo (src/Distribution/Types/Benchmark/Lens.hs:26)
Cabal-syntax>     benchmarkInterface (src/Distribution/Types/Benchmark/Lens.hs:22)
Cabal-syntax>     benchmarkName (src/Distribution/Types/Benchmark/Lens.hs:18)
Cabal-syntax> Warning: Distribution.Types.PackageDescription.Lens: Could not find documentation for exported module: Distribution.Types.PackageDescription.Lens
Cabal-syntax>   11% (  4 / 35) in 'Distribution.Types.PackageDescription.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     author (src/Distribution/Types/PackageDescription/Lens.hs:62)
Cabal-syntax>     benchmarks (src/Distribution/Types/PackageDescription/Lens.hs:138)
Cabal-syntax>     bugReports (src/Distribution/Types/PackageDescription/Lens.hs:82)
Cabal-syntax>     buildTypeRaw (src/Distribution/Types/PackageDescription/Lens.hs:110)
Cabal-syntax>     category (src/Distribution/Types/PackageDescription/Lens.hs:98)
Cabal-syntax>     copyright (src/Distribution/Types/PackageDescription/Lens.hs:54)
Cabal-syntax>     customFieldsPD (src/Distribution/Types/PackageDescription/Lens.hs:102)
Cabal-syntax>     dataDir (src/Distribution/Types/PackageDescription/Lens.hs:146)
Cabal-syntax>     dataFiles (src/Distribution/Types/PackageDescription/Lens.hs:142)
Cabal-syntax>     description (src/Distribution/Types/PackageDescription/Lens.hs:94)
Cabal-syntax>     executables (src/Distribution/Types/PackageDescription/Lens.hs:126)
Cabal-syntax>     extraDocFiles (src/Distribution/Types/PackageDescription/Lens.hs:158)
Cabal-syntax>     extraSrcFiles (src/Distribution/Types/PackageDescription/Lens.hs:150)
Cabal-syntax>     extraTmpFiles (src/Distribution/Types/PackageDescription/Lens.hs:154)
Cabal-syntax>     foreignLibs (src/Distribution/Types/PackageDescription/Lens.hs:130)
Cabal-syntax>     homepage (src/Distribution/Types/PackageDescription/Lens.hs:74)
Cabal-syntax>     library (src/Distribution/Types/PackageDescription/Lens.hs:118)
Cabal-syntax>     licenseFiles (src/Distribution/Types/PackageDescription/Lens.hs:50)
Cabal-syntax>     licenseRaw (src/Distribution/Types/PackageDescription/Lens.hs:46)
Cabal-syntax>     maintainer (src/Distribution/Types/PackageDescription/Lens.hs:58)
Cabal-syntax>     package (src/Distribution/Types/PackageDescription/Lens.hs:42)
Cabal-syntax>     pkgUrl (src/Distribution/Types/PackageDescription/Lens.hs:78)
Cabal-syntax>     setupBuildInfo (src/Distribution/Types/PackageDescription/Lens.hs:114)
Cabal-syntax>     sourceRepos (src/Distribution/Types/PackageDescription/Lens.hs:86)
Cabal-syntax>     specVersion (src/Distribution/Types/PackageDescription/Lens.hs:106)
Cabal-syntax>     stability (src/Distribution/Types/PackageDescription/Lens.hs:66)
Cabal-syntax>     subLibraries (src/Distribution/Types/PackageDescription/Lens.hs:122)
Cabal-syntax>     synopsis (src/Distribution/Types/PackageDescription/Lens.hs:90)
Cabal-syntax>     testSuites (src/Distribution/Types/PackageDescription/Lens.hs:134)
Cabal-syntax>     testedWith (src/Distribution/Types/PackageDescription/Lens.hs:70)
Cabal-syntax>   91% ( 11 / 12) in 'Distribution.Types.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>  100% ( 56 / 56) in 'Distribution.PackageDescription'
Cabal-syntax> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:34
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:27
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax> Warning: 'Arch' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/System.hs:195:1
Cabal-syntax>     * at src/Distribution/Types/ConfVar.hs:19:5
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/System.hs:195:1
Cabal-syntax> Warning: 'OS' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/System.hs:97:1
Cabal-syntax>     * at src/Distribution/Types/ConfVar.hs:18:5
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/System.hs:97:1
Cabal-syntax>   62% ( 10 / 16) in 'Distribution.PackageDescription.Configuration'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     freeVars (src/Distribution/PackageDescription/Configuration.hs:348)
Cabal-syntax>     mapCondTree (src/Distribution/Types/CondTree.hs:110)
Cabal-syntax>     mapTreeData (src/Distribution/Types/CondTree.hs:126)
Cabal-syntax>     mapTreeConds (src/Distribution/Types/CondTree.hs:123)
Cabal-syntax>     mapTreeConstrs (src/Distribution/Types/CondTree.hs:120)
Cabal-syntax>     transformAllBuildInfos (src/Distribution/PackageDescription/Configuration.hs:644)
Cabal-syntax> Warning: 'List' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:132:24
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:132:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:132:1
Cabal-syntax> Warning: 'NonEmpty'' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:199:29
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:199:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:199:1
Cabal-syntax> Warning: 'Set'' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:162:24
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:162:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:162:1
Cabal-syntax> Warning: 'Token' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:233:17
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:233:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:233:1
Cabal-syntax>   96% ( 29 / 30) in 'Distribution.FieldGrammar.Newtypes'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Sep (src/Distribution/FieldGrammar/Newtypes.hs:91)
Cabal-syntax> Warning: 'Last' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'pack' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   85% (  6 /  7) in 'Distribution.FieldGrammar.Class'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.FieldGrammar.Pretty'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
Cabal-syntax> Warning: 'FieldGrammarParser' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'GeneralPackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: 'Section' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Parsec.hs:105:1
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:52:5
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Parsec.hs:105:1
Cabal-syntax>   33% (  4 / 12) in 'Distribution.FieldGrammar.Parsec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
Cabal-syntax>     parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:120)
Cabal-syntax>     fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:135)
Cabal-syntax>     Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
Cabal-syntax>     namelessFieldAnn (src/Distribution/FieldGrammar/Parsec.hs:102)
Cabal-syntax>     runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:382)
Cabal-syntax>     runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:353)
Cabal-syntax>     fieldLinesToStream (src/Distribution/FieldGrammar/Parsec.hs:442)
Cabal-syntax>   65% ( 17 / 26) in 'Distribution.FieldGrammar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
Cabal-syntax>     ParsecFieldGrammar' (src/Distribution/FieldGrammar.hs:49)
Cabal-syntax>     parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:120)
Cabal-syntax>     fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:135)
Cabal-syntax>     PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
Cabal-syntax>     PrettyFieldGrammar' (src/Distribution/FieldGrammar.hs:50)
Cabal-syntax>     Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
Cabal-syntax>     runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:382)
Cabal-syntax>     runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:353)
Cabal-syntax> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:34
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax> Warning: 'Benchmark' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax> Warning: 'TestSuite' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax>   36% ( 17 / 47) in 'Distribution.PackageDescription.FieldGrammar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     packageDescriptionFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:114)
Cabal-syntax>     CompatLicenseFile (src/Distribution/PackageDescription/FieldGrammar.hs:852)
Cabal-syntax>     libraryFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:192)
Cabal-syntax>     foreignLibFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:242)
Cabal-syntax>     executableFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:280)
Cabal-syntax>     testSuiteFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:351)
Cabal-syntax>     validateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:361)
Cabal-syntax>     unvalidateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:425)
Cabal-syntax>     testStanzaTestType (src/Distribution/PackageDescription/FieldGrammar.hs:308)
Cabal-syntax>     testStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:312)
Cabal-syntax>     testStanzaTestModule (src/Distribution/PackageDescription/FieldGrammar.hs:316)
Cabal-syntax>     testStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:320)
Cabal-syntax>     benchmarkFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:494)
Cabal-syntax>     validateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:502)
Cabal-syntax>     unvalidateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:555)
Cabal-syntax>     formatDependencyList (src/Distribution/PackageDescription/FieldGrammar.hs:795)
Cabal-syntax>     formatExposedModules (src/Distribution/PackageDescription/FieldGrammar.hs:804)
Cabal-syntax>     formatExtraSourceFiles (src/Distribution/PackageDescription/FieldGrammar.hs:801)
Cabal-syntax>     formatHsSourceDirs (src/Distribution/PackageDescription/FieldGrammar.hs:807)
Cabal-syntax>     formatMixinList (src/Distribution/PackageDescription/FieldGrammar.hs:798)
Cabal-syntax>     formatOtherExtensions (src/Distribution/PackageDescription/FieldGrammar.hs:810)
Cabal-syntax>     formatOtherModules (src/Distribution/PackageDescription/FieldGrammar.hs:813)
Cabal-syntax>     benchmarkStanzaBenchmarkType (src/Distribution/PackageDescription/FieldGrammar.hs:456)
Cabal-syntax>     benchmarkStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:460)
Cabal-syntax>     benchmarkStanzaBenchmarkModule (src/Distribution/PackageDescription/FieldGrammar.hs:464)
Cabal-syntax>     benchmarkStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:468)
Cabal-syntax>     flagFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:749)
Cabal-syntax>     sourceRepoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:765)
Cabal-syntax>     setupBInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:784)
Cabal-syntax>     buildInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:592)
Cabal-syntax> Warning: 'PrettyField' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Pretty.hs:45:5
Cabal-syntax>     * at src/Distribution/Fields/Pretty.hs:44:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Pretty.hs:44:1
Cabal-syntax>  100% ( 11 / 11) in 'Distribution.PackageDescription.PrettyPrint'
Cabal-syntax> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:34
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>   90% ( 10 / 11) in 'Distribution.PackageDescription.Parsec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     parseHookedBuildInfo (src/Distribution/PackageDescription/Parsec.hs:926)
Cabal-syntax>   60% (  3 /  5) in 'Distribution.FieldGrammar.FieldDescrs'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     fieldDescrsToList (src/Distribution/FieldGrammar/FieldDescrs.hs:58)
Cabal-syntax> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:29
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.InstalledPackageInfo.FieldGrammar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ipiFieldGrammar (src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs:78)
Cabal-syntax> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:29
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>   57% (  8 / 14) in 'Distribution.InstalledPackageInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
Cabal-syntax>     installedComponentId (src/Distribution/InstalledPackageInfo.hs:66)
Cabal-syntax>     sourceComponentName (src/Distribution/InstalledPackageInfo.hs:89)
Cabal-syntax>     ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
Cabal-syntax>     emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:132)
Cabal-syntax>     showSimpleInstalledPackageInfoField (src/Distribution/InstalledPackageInfo.hs:138)
Cabal-syntax> Warning: Distribution.Compat.MonadFail: could not find link destinations for:
Cabal-syntax>   - GHC.Internal.Text.ParserCombinators.ReadP.P
Cabal-syntax> Warning: Distribution.Utils.Structured: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Rep_Structure
Cabal-syntax>   - Distribution.Utils.Structured.gstructured
Cabal-syntax>   - Distribution.Utils.Structured.GStructuredSum
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax> Warning: Distribution.Compat.Semigroup: could not find link destinations for:
Cabal-syntax>   - Data.Foldable1.JoinWith
Cabal-syntax>   - Data.Foldable1.FromMaybe
Cabal-syntax>   - Data.Foldable1.NonEmptyDList
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Any
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_All
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Data.Set.Internal.MergeSet
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Last'
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Option'
Cabal-syntax>   - Distribution.Compat.Semigroup.GMonoid
Cabal-syntax>   - Distribution.Compat.Semigroup.GSemigroup
Cabal-syntax> Warning: Distribution.Compat.NonEmptySet: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax> Warning: Distribution.Compat.Prelude: could not find link destinations for:
Cabal-syntax>   - GHC.Prim.~#
Cabal-syntax>   - Control.Applicative.Rep_WrappedArrow
Cabal-syntax>   - Control.Applicative.Rep_WrappedMonad
Cabal-syntax>   - Data.Complex.Rep_Complex
Cabal-syntax>   - Data.Functor.Sum.Rep_Sum
Cabal-syntax>   - Data.Functor.Product.Rep_Product
Cabal-syntax>   - Data.Functor.Compose.Rep_Compose
Cabal-syntax>   - Data.Semigroup.Rep_WrappedMonoid
Cabal-syntax>   - Data.Semigroup.Rep_Last
Cabal-syntax>   - Data.Semigroup.Rep_First
Cabal-syntax>   - Data.Semigroup.Rep_Arg
Cabal-syntax>   - Data.Semigroup.Rep_Max
Cabal-syntax>   - Data.Semigroup.Rep_Min
Cabal-syntax>   - Data.Foldable1.JoinWith
Cabal-syntax>   - Data.Foldable1.FromMaybe
Cabal-syntax>   - Data.Foldable1.NonEmptyDList
Cabal-syntax>   - Data.ByteString.Builder.RealFloat.FormatMode
Cabal-syntax>   - Data.Sequence.Internal.Rep_ViewR
Cabal-syntax>   - Data.Sequence.Internal.Rep_ViewL
Cabal-syntax>   - Data.Sequence.Internal.Rep_Elem
Cabal-syntax>   - Data.Sequence.Internal.Rep_Node
Cabal-syntax>   - Data.Sequence.Internal.Rep_Digit
Cabal-syntax>   - Data.Sequence.Internal.Rep_FingerTree
Cabal-syntax>   - Data.Tree.Rep_Tree
Cabal-syntax>   - Data.Graph.Rep_SCC
Cabal-syntax>   - Control.DeepSeq.GNFData
Cabal-syntax>   - GHC.Internal.Generics.SingKind
Cabal-syntax>   - GHC.Internal.Generics.DemoteRep
Cabal-syntax>   - GHC.Internal.Generics.fromSing
Cabal-syntax>   - GHC.Internal.Generics.SingI
Cabal-syntax>   - GHC.Internal.Generics.sing
Cabal-syntax>   - GHC.Internal.Generics.Sing
Cabal-syntax>   - GHC.Internal.Generics.D:R:UReckWordp0
Cabal-syntax>   - GHC.Internal.Generics.D:R:UReckIntp0
Cabal-syntax>   - GHC.Internal.Generics.D:R:UReckFloatp0
Cabal-syntax>   - GHC.Internal.Generics.D:R:UReckDoublep0
Cabal-syntax>   - GHC.Internal.Generics.D:R:UReckCharp0
Cabal-syntax>   - GHC.Internal.Generics.Rep1_Proxy
Cabal-syntax>   - GHC.Internal.Generics.Rep1_Either
Cabal-syntax>   - GHC.Internal.Generics.Rep1_Maybe
Cabal-syntax>   - GHC.Internal.Generics.Rep1_NonEmpty
Cabal-syntax>   - GHC.Internal.Generics.Rep_Fingerprint
Cabal-syntax>   - GHC.Internal.Generics.Rep_GeneralCategory
Cabal-syntax>   - GHC.Internal.Generics.Rep_SrcLoc
Cabal-syntax>   - GHC.Internal.Generics.Rep_Down
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple15
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple14
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple13
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple12
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple11
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple10
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple9
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple8
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple7
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple6
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple5
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple4
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple3
Cabal-syntax>   - GHC.Internal.Generics.Rep_Tuple2
Cabal-syntax>   - GHC.Internal.Generics.Rep_Solo
Cabal-syntax>   - GHC.Internal.Generics.Rep_Unit
Cabal-syntax>   - GHC.Internal.Generics.Rep_Proxy
Cabal-syntax>   - GHC.Internal.Generics.Rep_Ordering
Cabal-syntax>   - GHC.Internal.Generics.Rep_Bool
Cabal-syntax>   - GHC.Internal.Generics.Rep_Either
Cabal-syntax>   - GHC.Internal.Generics.Rep_Maybe
Cabal-syntax>   - GHC.Internal.Generics.Rep_NonEmpty
Cabal-syntax>   - GHC.Internal.Generics.Rep_List
Cabal-syntax>   - GHC.Internal.Generics.Rep_Void
Cabal-syntax>   - GHC.Internal.Generics.Rep_M1
Cabal-syntax>   - GHC.Internal.Generics.Rep_V1
Cabal-syntax>   - GHC.Internal.Generics.Rep_U1
Cabal-syntax>   - GHC.Internal.Generics.Rep_Par1
Cabal-syntax>   - GHC.Internal.Generics.Rep_Rec1
Cabal-syntax>   - GHC.Internal.Generics.Rep_K1
Cabal-syntax>   - GHC.Internal.Generics.Rep_:+:
Cabal-syntax>   - GHC.Internal.Generics.Rep_:*:
Cabal-syntax>   - GHC.Internal.Generics.Rep_:.:
Cabal-syntax>   - GHC.Internal.Generics.Rep_R:UReckWordp
Cabal-syntax>   - GHC.Internal.Generics.Rep1_R:UReckWordp
Cabal-syntax>   - GHC.Internal.Generics.Rep_R:UReckIntp
Cabal-syntax>   - GHC.Internal.Generics.Rep1_R:UReckIntp
Cabal-syntax>   - GHC.Internal.Generics.Rep1_R:UReckFloatp
Cabal-syntax>   - GHC.Internal.Generics.Rep_R:UReckDoublep
Cabal-syntax>   - GHC.Internal.Generics.Rep1_R:UReckDoublep
Cabal-syntax>   - GHC.Internal.Generics.Rep_R:UReckCharp
Cabal-syntax>   - GHC.Internal.Generics.Rep1_R:UReckCharp
Cabal-syntax>   - GHC.Internal.Generics.Rep_R:UReckPtrp
Cabal-syntax>   - GHC.Internal.Generics.Rep_Fixity
Cabal-syntax>   - GHC.Internal.Generics.Rep_Associativity
Cabal-syntax>   - GHC.Internal.Generics.Rep_SourceUnpackedness
Cabal-syntax>   - GHC.Internal.Generics.Rep_SourceStrictness
Cabal-syntax>   - GHC.Internal.Generics.Rep_DecidedStrictness
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Alt
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Product
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Sum
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Any
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_All
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Endo
Cabal-syntax>   - GHC.Internal.Data.Semigroup.Internal.Rep_Dual
Cabal-syntax>   - GHC.Internal.Data.Monoid.Rep_Ap
Cabal-syntax>   - GHC.Internal.Data.Monoid.Rep_Last
Cabal-syntax>   - GHC.Internal.Data.Monoid.Rep_First
Cabal-syntax>   - GHC.Internal.ByteOrder.Rep_ByteOrder
Cabal-syntax>   - GHC.Internal.Data.Functor.Const.Rep_Const
Cabal-syntax>   - GHC.Internal.Data.Functor.Const.Rep1_Const
Cabal-syntax>   - GHC.Internal.Data.Functor.Identity.Rep_Identity
Cabal-syntax>   - GHC.Internal.Data.Functor.Identity.Rep1_Identity
Cabal-syntax>   - GHC.Internal.Data.Version.Rep_Version
Cabal-syntax>   - GHC.Internal.Functor.ZipList.Rep_ZipList
Cabal-syntax>   - GHC.Internal.Control.Arrow.Rep_Kleisli
Cabal-syntax>   - Data.Text.Internal.Encoding.PartialUtf8CodePoint
Cabal-syntax>   - Data.Time.Calendar.CalendarDiffDays.Rep_CalendarDiffDays
Cabal-syntax>   - GHC.Internal.Text.ParserCombinators.ReadP.P
Cabal-syntax>   - GHC.Internal.IO.Exception.Rep_ExitCode
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Rep_Structure
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Control.Monad.Trans.State.Strict.Rep_StateT
Cabal-syntax>   - Data.Time.LocalTime.Internal.LocalTime.Rep_LocalTime
Cabal-syntax>   - Data.Time.LocalTime.Internal.ZonedTime.Rep_ZonedTime
Cabal-syntax>   - GHC.Internal.IsList.D:R:ItemNonEmpty
Cabal-syntax>   - Data.ByteString.Short.Internal.Rep_ShortByteString
Cabal-syntax>   - GHC.Internal.Generics.D:R:SingBoola0
Cabal-syntax>   - GHC.Internal.Generics.STrue
Cabal-syntax>   - GHC.Internal.Generics.D:R:DemoteRepBool
Cabal-syntax>   - GHC.Internal.Generics.SFalse
Cabal-syntax>   - GHC.Internal.Generics.Rep_R:UReckFloatp
Cabal-syntax>   - GHC.Internal.Generics.D:R:SingMaybeb0
Cabal-syntax>   - GHC.Internal.Generics.SNothing
Cabal-syntax>   - GHC.Internal.Generics.SJust
Cabal-syntax>   - GHC.Internal.Generics.D:R:DemoteRepMaybe
Cabal-syntax>   - Data.Map.Internal.D:R:ItemMap
Cabal-syntax>   - Data.Set.Internal.D:R:ItemSet
Cabal-syntax>   - Data.Set.Internal.MergeSet
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_Doc
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_Mode
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_Style
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_TextDetails
Cabal-syntax>   - Text.PrettyPrint.HughesPJ.Rep_Doc
Cabal-syntax>   - Data.Time.Calendar.Days.Rep_Day
Cabal-syntax>   - Data.Time.Calendar.Month.Rep_Month
Cabal-syntax>   - Data.Time.Calendar.Week.Rep_DayOfWeek
Cabal-syntax>   - Data.Time.Clock.Internal.SystemTime.Rep_SystemTime
Cabal-syntax>   - Data.Time.Clock.Internal.UTCTime.Rep_UTCTime
Cabal-syntax>   - Data.Time.Clock.Internal.UniversalTime.Rep_UniversalTime
Cabal-syntax>   - Data.Time.LocalTime.Internal.CalendarDiffTime.Rep_CalendarDiffTime
Cabal-syntax>   - Data.Time.LocalTime.Internal.TimeOfDay.Rep_TimeOfDay
Cabal-syntax>   - Data.Time.LocalTime.Internal.TimeZone.Rep_TimeZone
Cabal-syntax>   - Control.DeepSeq.Zero
Cabal-syntax>   - GHC.Internal.ForeignSrcLang.Rep_ForeignSrcLang
Cabal-syntax>   - GHC.Internal.LanguageExtensions.Rep_Extension
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_AnnLookup
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_AnnTarget
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Bang
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_BndrVis
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Body
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Bytes
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Callconv
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Clause
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Con
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Dec
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_DecidedStrictness
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_DerivClause
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_DerivStrategy
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_DocLoc
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Exp
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_FamilyResultSig
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_FixityDirection
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Fixity
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Foreign
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_FunDep
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Guard
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Info
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_InjectivityAnn
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Inline
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Lit
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Loc
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Match
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_ModName
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_ModuleInfo
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Module
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_NameFlavour
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_NameSpace
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Name
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_NamespaceSpecifier
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_OccName
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Overlap
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Pat
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_PatSynArgs
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_PatSynDir
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Phases
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_PkgName
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Pragma
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Range
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Role
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_RuleBndr
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_RuleMatch
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Safety
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_SourceStrictness
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_SourceUnpackedness
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Specificity
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Stmt
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_TyLit
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_TySynEqn
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_TyVarBndr
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_Type
Cabal-syntax>   - GHC.Internal.TH.Syntax.Rep_TypeFamilyHead
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Last'
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Option'
Cabal-syntax>   - Distribution.Compat.Semigroup.GMonoid
Cabal-syntax>   - Distribution.Compat.Semigroup.GSemigroup
Cabal-syntax>   - Distribution.Compat.Prelude.GNFData
Cabal-syntax>   - Distribution.Utils.ShortText.Rep_ShortText
Cabal-syntax>   - System.OsString.Internal.Types.Rep_OsChar
Cabal-syntax>   - System.OsString.Internal.Types.Rep_OsString
Cabal-syntax>   - System.OsString.Internal.Types.Rep_PosixChar
Cabal-syntax>   - System.OsString.Internal.Types.Rep_PosixString
Cabal-syntax>   - System.OsString.Internal.Types.Rep_WindowsChar
Cabal-syntax>   - System.OsString.Internal.Types.Rep_WindowsString
Cabal-syntax>   - Control.Monad.Trans.Cont.Rep_ContT
Cabal-syntax>   - Control.Monad.Trans.Except.Rep_ExceptT
Cabal-syntax>   - Control.Monad.Trans.Identity.Rep_IdentityT
Cabal-syntax>   - Control.Monad.Trans.Maybe.Rep_MaybeT
Cabal-syntax>   - Control.Monad.Trans.RWS.Lazy.Rep_RWST
Cabal-syntax>   - Control.Monad.Trans.RWS.Strict.Rep_RWST
Cabal-syntax>   - Control.Monad.Trans.Reader.Rep_ReaderT
Cabal-syntax>   - Control.Monad.Trans.State.Lazy.Rep_StateT
Cabal-syntax>   - Control.Monad.Trans.Writer.Lazy.Rep_WriterT
Cabal-syntax>   - Control.Monad.Trans.Writer.Strict.Rep_WriterT
Cabal-syntax>   - Distribution.Types.Condition.Rep_Condition
Cabal-syntax>   - Distribution.Parsec.Position.Rep_Position
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Control.Monad.Trans.Accum.Rep_AccumT
Cabal-syntax>   - Control.Monad.Trans.RWS.CPS.Rep_RWST
Cabal-syntax>   - Control.Monad.Trans.Select.Rep_SelectT
Cabal-syntax>   - Control.Monad.Trans.Writer.CPS.Rep_WriterT
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondBranch
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondTree
Cabal-syntax>   - Distribution.CabalSpecVersion.Rep_CabalSpecVersion
Cabal-syntax>   - Distribution.Utils.Path.Rep_SymbolicPath
Cabal-syntax>   - Distribution.Types.Version.Rep_Version
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_KnownRepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoKind
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_SourceRepo
Cabal-syntax>   - Distribution.Types.PkgconfigVersion.Rep_PkgconfigVersion
Cabal-syntax>   - Distribution.Types.PkgconfigVersionRange.Rep_PkgconfigVersionRange
Cabal-syntax>   - Distribution.Types.PkgconfigName.Rep_PkgconfigName
Cabal-syntax>   - Distribution.Types.PkgconfigDependency.Rep_PkgconfigDependency
Cabal-syntax>   - Distribution.Types.PackageName.Rep_PackageName
Cabal-syntax>   - Distribution.Types.UnqualComponentName.Rep_UnqualComponentName
Cabal-syntax>   - Distribution.Types.LibraryVisibility.Rep_LibraryVisibility
Cabal-syntax>   - Distribution.Types.LibraryName.Rep_LibraryName
Cabal-syntax>   - Distribution.Types.MungedPackageName.Rep_MungedPackageName
Cabal-syntax>   - Distribution.Types.ForeignLibType.Rep_ForeignLibType
Cabal-syntax>   - Distribution.Types.ForeignLibOption.Rep_ForeignLibOption
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagName
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagAssignment
Cabal-syntax>   - Distribution.Types.Flag.Rep_PackageFlag
Cabal-syntax>   - Distribution.Types.ExecutableScope.Rep_ExecutableScope
Cabal-syntax>   - Distribution.Types.ComponentName.Rep_ComponentName
Cabal-syntax>   - Distribution.Types.ComponentId.Rep_ComponentId
Cabal-syntax>   - Distribution.Types.BuildType.Rep_BuildType
Cabal-syntax>   - Distribution.Types.AbiHash.Rep_AbiHash
Cabal-syntax>   - Distribution.System.Rep_Arch
Cabal-syntax>   - Distribution.System.Rep_OS
Cabal-syntax>   - Distribution.System.Rep_Platform
Cabal-syntax>   - Distribution.SPDX.LicenseReference.Rep_LicenseRef
Cabal-syntax>   - Distribution.SPDX.LicenseExceptionId.Rep_LicenseExceptionId
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_SimpleLicenseExpression
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_LicenseExpression
Cabal-syntax>   - Distribution.SPDX.License.Rep_License
Cabal-syntax>   - Distribution.ModuleName.Rep_ModuleName
Cabal-syntax>   - Distribution.Types.ModuleRenaming.Rep_ModuleRenaming
Cabal-syntax>   - Distribution.Types.IncludeRenaming.Rep_IncludeRenaming
Cabal-syntax>   - Distribution.Types.Mixin.Rep_Mixin
Cabal-syntax>   - Distribution.Types.ModuleReexport.Rep_ModuleReexport
Cabal-syntax>   - Distribution.Compat.Graph.D:R:KeyEither
Cabal-syntax>   - Data.Graph.SetM
Cabal-syntax>   - Distribution.Types.TestType.Rep_TestType
Cabal-syntax>   - Distribution.Types.TestSuiteInterface.Rep_TestSuiteInterface
Cabal-syntax>   - Distribution.Types.PackageId.Rep_PackageIdentifier
Cabal-syntax>   - Distribution.Types.UnitId.Rep_DefUnitId
Cabal-syntax>   - Distribution.Types.UnitId.Rep_UnitId
Cabal-syntax>   - Distribution.Types.Module.Rep_Module
Cabal-syntax>   - Distribution.Backpack.Rep_OpenUnitId
Cabal-syntax>   - Distribution.Backpack.Rep_OpenModule
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax>   - Distribution.Types.PackageVersionConstraint.Rep_PackageVersionConstraint
Cabal-syntax>   - Distribution.Types.MungedPackageId.Rep_MungedPackageId
Cabal-syntax>   - Distribution.Types.LegacyExeDependency.Rep_LegacyExeDependency
Cabal-syntax>   - Distribution.Types.ExeDependency.Rep_ExeDependency
Cabal-syntax>   - Distribution.Types.Dependency.Rep_Dependency
Cabal-syntax>   - Distribution.Types.SetupBuildInfo.Rep_SetupBuildInfo
Cabal-syntax>   - Distribution.Types.BenchmarkType.Rep_BenchmarkType
Cabal-syntax>   - Distribution.Types.BenchmarkInterface.Rep_BenchmarkInterface
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax>   - Distribution.License.Rep_License
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax>   - Language.Haskell.Extension.Rep_Extension
Cabal-syntax>   - Language.Haskell.Extension.Rep_KnownExtension
Cabal-syntax>   - Language.Haskell.Extension.Rep_Language
Cabal-syntax>   - Distribution.Compiler.Rep_AbiTag
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerFlavor
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerId
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerInfo
Cabal-syntax>   - Distribution.Compiler.Rep_PerCompilerFlavor
Cabal-syntax>   - Distribution.Types.ConfVar.Rep_ConfVar
Cabal-syntax>   - Distribution.Types.BuildInfo.Rep_BuildInfo
Cabal-syntax>   - Distribution.Types.TestSuite.Rep_TestSuite
Cabal-syntax>   - Distribution.Types.Library.Rep_Library
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_ForeignLib
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_LibVersionInfo
Cabal-syntax>   - Distribution.Types.Executable.Rep_Executable
Cabal-syntax>   - Distribution.Types.Benchmark.Rep_Benchmark
Cabal-syntax>   - Distribution.Types.Component.Rep_Component
Cabal-syntax>   - Distribution.Types.ComponentRequestedSpec.Rep_ComponentRequestedSpec
Cabal-syntax>   - Distribution.Types.PackageDescription.Rep_PackageDescription
Cabal-syntax>   - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
Cabal-syntax>   - Text.Printf.hspr
Cabal-syntax>   - Text.Printf.spr
Cabal-syntax>   - Text.Printf.UPrintf
Cabal-syntax>   - Data.Time.Calendar.Quarter.Rep_QuarterOfYear
Cabal-syntax>   - Data.Time.Calendar.Quarter.Rep_Quarter
Cabal-syntax>   - Control.Applicative.Backwards.Rep_Backwards
Cabal-syntax>   - Control.Applicative.Lift.Rep_Lift
Cabal-syntax>   - Data.Functor.Constant.Rep_Constant
Cabal-syntax>   - Data.Functor.Reverse.Rep_Reverse
Cabal-syntax> Warning: Distribution.Utils.ShortText: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.ShortText.Rep_ShortText
Cabal-syntax> Warning: Distribution.Types.Condition: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Condition.Rep_Condition
Cabal-syntax> Warning: Distribution.Parsec.Position: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Position.Rep_Position
Cabal-syntax> Warning: Distribution.Parsec.Warning: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax> Warning: Distribution.Parsec.Error: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax> Warning: Distribution.Fields.LexerMonad: could not find link destinations for:
Cabal-syntax>   - Distribution.Fields.LexerMonad.StartCode
Cabal-syntax> Warning: Distribution.Types.CondTree: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondBranch
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondTree
Cabal-syntax> Warning: Distribution.CabalSpecVersion: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.CabalSpecVersion.Rep_CabalSpecVersion
Cabal-syntax> Warning: Distribution.Parsec: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Position.Rep_Position
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax> Warning: Distribution.Utils.Path: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Path.Rep_SymbolicPath
Cabal-syntax> Warning: Distribution.Types.Version: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Version.Rep_Version
Cabal-syntax> Warning: Distribution.Types.VersionRange.Internal: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax> Warning: Distribution.Types.VersionRange: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax> Warning: Distribution.Types.SourceRepo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_KnownRepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoKind
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_SourceRepo
Cabal-syntax> Warning: Distribution.Types.SourceRepo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_SourceRepo
Cabal-syntax> Warning: Distribution.Types.PkgconfigVersion: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PkgconfigVersion.Rep_PkgconfigVersion
Cabal-syntax> Warning: Distribution.Types.PkgconfigVersionRange: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PkgconfigVersionRange.Rep_PkgconfigVersionRange
Cabal-syntax> Warning: Distribution.Types.PkgconfigName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PkgconfigName.Rep_PkgconfigName
Cabal-syntax> Warning: Distribution.Types.PkgconfigDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PkgconfigDependency.Rep_PkgconfigDependency
Cabal-syntax> Warning: Distribution.Types.PackageName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PackageName.Rep_PackageName
Cabal-syntax> Warning: Distribution.Types.UnqualComponentName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.UnqualComponentName.Rep_UnqualComponentName
Cabal-syntax> Warning: Distribution.Types.LibraryVisibility: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.LibraryVisibility.Rep_LibraryVisibility
Cabal-syntax> Warning: Distribution.Types.LibraryName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.LibraryName.Rep_LibraryName
Cabal-syntax> Warning: Distribution.Types.MungedPackageName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.MungedPackageName.Rep_MungedPackageName
Cabal-syntax> Warning: Distribution.Types.ForeignLibType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ForeignLibType.Rep_ForeignLibType
Cabal-syntax> Warning: Distribution.Types.ForeignLibOption: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ForeignLibOption.Rep_ForeignLibOption
Cabal-syntax> Warning: Distribution.Types.Flag: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagName
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagAssignment
Cabal-syntax>   - Distribution.Types.Flag.Rep_PackageFlag
Cabal-syntax> Warning: Distribution.Types.ExecutableScope: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ExecutableScope.Rep_ExecutableScope
Cabal-syntax> Warning: Distribution.Types.ComponentName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ComponentName.Rep_ComponentName
Cabal-syntax>   - Distribution.Types.ComponentName.NotLibComponentName
Cabal-syntax> Warning: Distribution.Types.ComponentId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ComponentId.Rep_ComponentId
Cabal-syntax> Warning: Distribution.Types.BuildType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.BuildType.Rep_BuildType
Cabal-syntax> Warning: Distribution.Types.AbiHash: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.AbiHash.Rep_AbiHash
Cabal-syntax> Warning: Distribution.System: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.System.Rep_Arch
Cabal-syntax>   - Distribution.System.Rep_OS
Cabal-syntax>   - Distribution.System.Rep_Platform
Cabal-syntax> Warning: Distribution.SPDX.LicenseReference: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.SPDX.LicenseReference.Rep_LicenseRef
Cabal-syntax> Warning: Distribution.SPDX.LicenseId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax> Warning: Distribution.SPDX.LicenseExceptionId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.SPDX.LicenseExceptionId.Rep_LicenseExceptionId
Cabal-syntax> Warning: Distribution.SPDX.LicenseExpression: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_SimpleLicenseExpression
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_LicenseExpression
Cabal-syntax> Warning: Distribution.SPDX.License: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.SPDX.License.Rep_License
Cabal-syntax> Warning: Distribution.SPDX: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.SPDX.LicenseReference.Rep_LicenseRef
Cabal-syntax>   - Distribution.SPDX.LicenseExceptionId.Rep_LicenseExceptionId
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_SimpleLicenseExpression
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_LicenseExpression
Cabal-syntax>   - Distribution.SPDX.License.Rep_License
Cabal-syntax> Warning: Distribution.ModuleName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.ModuleName.Rep_ModuleName
Cabal-syntax> Warning: Distribution.Types.ModuleRenaming: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ModuleRenaming.Rep_ModuleRenaming
Cabal-syntax> Warning: Distribution.Types.IncludeRenaming: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.IncludeRenaming.Rep_IncludeRenaming
Cabal-syntax> Warning: Distribution.Types.Mixin: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Mixin.Rep_Mixin
Cabal-syntax> Warning: Distribution.Types.ModuleReexport: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ModuleReexport.Rep_ModuleReexport
Cabal-syntax> Warning: Distribution.Compat.Graph: could not find link destinations for:
Cabal-syntax>   - Data.Graph.Rep_SCC
Cabal-syntax>   - Data.Graph.Rep1_SCC
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Compat.Graph.D:R:KeyEither
Cabal-syntax>   - Distribution.Compat.Graph.D:R:KeyNode
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax> Warning: Distribution.Version: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Version.Rep_Version
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax> Warning: Distribution.Types.TestType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.TestType.Rep_TestType
Cabal-syntax> Warning: Distribution.Types.TestSuiteInterface: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.TestSuiteInterface.Rep_TestSuiteInterface
Cabal-syntax> Warning: Distribution.Types.PackageId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PackageId.Rep_PackageIdentifier
Cabal-syntax> Warning: Distribution.Types.UnitId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.UnitId.Rep_DefUnitId
Cabal-syntax>   - Distribution.Types.UnitId.Rep_UnitId
Cabal-syntax> Warning: Distribution.Types.Module: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Module.Rep_Module
Cabal-syntax> Warning: Distribution.Backpack: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.UnitId.Rep_DefUnitId
Cabal-syntax>   - Distribution.Backpack.Rep_OpenUnitId
Cabal-syntax>   - Distribution.Backpack.Rep_OpenModule
Cabal-syntax> Warning: Distribution.Types.ExposedModule: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax> Warning: Distribution.Types.PackageVersionConstraint: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PackageVersionConstraint.Rep_PackageVersionConstraint
Cabal-syntax> Warning: Distribution.Types.PackageId.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PackageId.Rep_PackageIdentifier
Cabal-syntax> Warning: Distribution.Types.MungedPackageId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.MungedPackageId.Rep_MungedPackageId
Cabal-syntax> Warning: Distribution.Types.LegacyExeDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.LegacyExeDependency.Rep_LegacyExeDependency
Cabal-syntax> Warning: Distribution.Types.ExeDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ExeDependency.Rep_ExeDependency
Cabal-syntax> Warning: Distribution.Types.Dependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Dependency.Rep_Dependency
Cabal-syntax> Warning: Distribution.Types.SetupBuildInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.SetupBuildInfo.Rep_SetupBuildInfo
Cabal-syntax> Warning: Distribution.Types.SetupBuildInfo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.SetupBuildInfo.Rep_SetupBuildInfo
Cabal-syntax> Warning: Distribution.Types.BenchmarkType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.BenchmarkType.Rep_BenchmarkType
Cabal-syntax> Warning: Distribution.Types.BenchmarkInterface: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.BenchmarkInterface.Rep_BenchmarkInterface
Cabal-syntax> Warning: Distribution.Types.AbiDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax> Warning: Distribution.License: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.License.Rep_License
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax> Warning: Distribution.Fields: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax> Warning: Language.Haskell.Extension: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Language.Haskell.Extension.Rep_Extension
Cabal-syntax>   - Language.Haskell.Extension.Rep_KnownExtension
Cabal-syntax>   - Language.Haskell.Extension.Rep_Language
Cabal-syntax> Warning: Distribution.Compiler: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Compiler.Rep_AbiTag
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerFlavor
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerId
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerInfo
Cabal-syntax>   - Distribution.Compiler.Rep_PerCompilerFlavor
Cabal-syntax> Warning: Distribution.Types.ConfVar: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ConfVar.Rep_ConfVar
Cabal-syntax> Warning: Distribution.Types.BuildInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.BuildInfo.Rep_BuildInfo
Cabal-syntax> Warning: Distribution.Types.BuildInfo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.BuildInfo.Rep_BuildInfo
Cabal-syntax> Warning: Distribution.Types.TestSuite: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.TestSuite.Rep_TestSuite
Cabal-syntax> Warning: Distribution.Types.TestSuite.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.TestSuite.Rep_TestSuite
Cabal-syntax> Warning: Distribution.Types.Library: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Library.Rep_Library
Cabal-syntax> Warning: Distribution.Types.Library.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Library.Rep_Library
Cabal-syntax> Warning: Distribution.Types.ForeignLib: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_ForeignLib
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_LibVersionInfo
Cabal-syntax> Warning: Distribution.Types.ForeignLib.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_ForeignLib
Cabal-syntax> Warning: Distribution.Types.Executable: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Executable.Rep_Executable
Cabal-syntax> Warning: Distribution.Types.Executable.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Executable.Rep_Executable
Cabal-syntax> Warning: Distribution.Types.Benchmark: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Benchmark.Rep_Benchmark
Cabal-syntax> Warning: Distribution.Types.Component: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Component.Rep_Component
Cabal-syntax> Warning: Distribution.Types.ComponentRequestedSpec: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ComponentRequestedSpec.Rep_ComponentRequestedSpec
Cabal-syntax> Warning: Distribution.Types.PackageDescription: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PackageDescription.Rep_PackageDescription
Cabal-syntax> Warning: Distribution.Types.GenericPackageDescription: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
Cabal-syntax> Warning: Distribution.Types.GenericPackageDescription.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagName
Cabal-syntax>   - Distribution.Types.Flag.Rep_PackageFlag
Cabal-syntax>   - Distribution.Types.ConfVar.Rep_ConfVar
Cabal-syntax>   - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
Cabal-syntax> Warning: Distribution.Types.Benchmark.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.Benchmark.Rep_Benchmark
Cabal-syntax> Warning: Distribution.Types.PackageDescription.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.PackageDescription.Rep_PackageDescription
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo.FieldGrammar: could not find link destinations for:
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.Basic
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.CompatPackageKey
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.ExposedModules
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.InstWith
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
Cabal-syntax> Warning: Distribution.InstalledPackageInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax> Documentation created: dist/doc/html/Cabal-syntax,
Cabal-syntax> dist/doc/html/Cabal-syntax/Cabal-syntax.txt
Cabal-syntax> Running phase: installPhase
Cabal-syntax> Installing library in /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal-syntax> Running phase: fixupPhase
Cabal-syntax> shrinking RPATHs of ELF executables and libraries in /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0
Cabal-syntax> shrinking /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSCabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP-ghc9.12.1.so
Cabal-syntax> checking for references to /build/ in /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0...
Cabal-syntax> patching script interpreter paths in /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0
Cabal-syntax> stripping (with command strip and flags -S -p) in  /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/lib
Cabal-syntax> shrinking RPATHs of ELF executables and libraries in /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax> checking for references to /build/ in /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc...
Cabal-syntax> patching script interpreter paths in /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0 /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
Cabal-syntax (post)> 
Cabal-syntax (post)> Pushing /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0 (161.53 MiB)
Cabal-syntax (post)> Pushing /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc (47.54 MiB)
Cabal-syntax (post)> 
Cabal-syntax (post)> All done.
Cabal-syntax (post)> added 2 signatures
Cabal-syntax (post)> added 136 signatures
Cabal-syntax (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0 /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> copying 2 paths...
Cabal-syntax (post)> copying path '/nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
Cabal-syntax (post)> copying path '/nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0' to 'https://cache.nix-ci.com'...
Cabal-syntax (post)> copying 1 paths...
Cabal-syntax (post)> copying path '/nix/store/pkw24jpz4qr4dqkm81z8k8nbq11fni8v-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
Cabal-syntax (post)> added 0 signatures
Cabal-syntax (post)> added 0 signatures
Cabal-syntax (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0 /nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> copying 2 paths...
Cabal-syntax (post)> copying path '/nix/store/m9gz55cn86kqckhkiz3zgl7kp6w4kkv7-Cabal-syntax-3.12.1.0-doc' to 'ssh-ng://worker.nix-ci.com'...
Cabal-syntax (post)> copying path '/nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0' to 'ssh-ng://worker.nix-ci.com'...
Cabal-syntax (post)> copying 1 paths...
Cabal-syntax (post)> copying path '/nix/store/pkw24jpz4qr4dqkm81z8k8nbq11fni8v-Cabal-syntax-3.12.1.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/v6z49mmb26012avqkyq76n57pzxxjmnf-Cabal-3.12.1.0.drv'...
Cabal> Running phase: setupCompilerEnvironmentPhase
Cabal> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
Cabal> Running phase: unpackPhase
Cabal> unpacking source archive /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
Cabal> source root is Cabal-3.12.1.0
Cabal> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-3.12.1.0/src/Distribution/ZinzaPrelude.hs"
Cabal> Running phase: patchPhase
Cabal> Running phase: compileBuildDriverPhase
Cabal> setupCompileFlags: -package-db=/build/tmp.eeQBG3gMIv/setup-package.conf.d -threaded
Cabal> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.eeQBG3gMIv/Main.o )
Cabal> [2 of 2] Linking Setup
Cabal> Running phase: updateAutotoolsGnuConfigScriptsPhase
Cabal> Running phase: configurePhase
Cabal> configureFlags: --verbose --prefix=/nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.eeQBG3gMIv/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
Cabal> Using Parsec parser
Cabal> Configuring Cabal-3.12.1.0...
Cabal> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
Cabal> 'ghc' version < 9.12):
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
Cabal> 9.12.1
Cabal> Dependency Cabal-syntax >=3.12.1.0 && <3.13: using Cabal-syntax-3.12.1.0
Cabal> Dependency array >=0.4.0.1 && <0.6: using array-0.5.8.0
Cabal> Dependency base >=4.11 && <5: using base-4.21.0.0
Cabal> Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.12.2.0
Cabal> Dependency containers >=0.5.0.0 && <0.8: using containers-0.7
Cabal> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
Cabal> Dependency directory >=1.2 && <1.4: using directory-1.3.9.0
Cabal> Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.5.4.0
Cabal> Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
Cabal> Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.17.0
Cabal> Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
Cabal> Dependency process >=1.2.1.0 && <1.7: using process-1.6.25.0
Cabal> Dependency time >=1.4.0.1 && <1.15: using time-1.14
Cabal> Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
Cabal> transformers-0.6.1.2
Cabal> Dependency unix >=2.6.0.0 && <2.9: using unix-2.8.6.0
Cabal> Source component graph: component lib
Cabal> Configured component graph:
Cabal>     component Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0
Cabal>         include Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal>         include array-0.5.8.0-038b
Cabal>         include base-4.21.0.0-f068
Cabal>         include bytestring-0.12.2.0-be6d
Cabal>         include containers-0.7-647d
Cabal>         include deepseq-1.5.1.0-b096
Cabal>         include directory-1.3.9.0-9eff
Cabal>         include filepath-1.5.4.0-7ce6
Cabal>         include mtl-2.3.1-9650
Cabal>         include parsec-3.1.17.0-9beb
Cabal>         include pretty-1.1.3.6-2a4e
Cabal>         include process-1.6.25.0-4623
Cabal>         include time-1.14-f7a8
Cabal>         include transformers-0.6.1.2-199f
Cabal>         include unix-2.8.6.0-6369
Cabal> Linked component graph:
Cabal>     unit Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0
Cabal>         include Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal>         include array-0.5.8.0-038b
Cabal>         include base-4.21.0.0-f068
Cabal>         include bytestring-0.12.2.0-be6d
Cabal>         include containers-0.7-647d
Cabal>         include deepseq-1.5.1.0-b096
Cabal>         include directory-1.3.9.0-9eff
Cabal>         include filepath-1.5.4.0-7ce6
Cabal>         include mtl-2.3.1-9650
Cabal>         include parsec-3.1.17.0-9beb
Cabal>         include pretty-1.1.3.6-2a4e
Cabal>         include process-1.6.25.0-4623
Cabal>         include time-1.14-f7a8
Cabal>         include transformers-0.6.1.2-199f
Cabal>         include unix-2.8.6.0-6369
Cabal>         Distribution.Backpack=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.License,Distribution.Make=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP:Language.Haskell.Extension
Cabal> Ready component graph:
Cabal>     definite Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0
Cabal>         depends Cabal-syntax-3.12.1.0-3DL7ZN8lDjfId1XDrKHnXP
Cabal>         depends array-0.5.8.0-038b
Cabal>         depends base-4.21.0.0-f068
Cabal>         depends bytestring-0.12.2.0-be6d
Cabal>         depends containers-0.7-647d
Cabal>         depends deepseq-1.5.1.0-b096
Cabal>         depends directory-1.3.9.0-9eff
Cabal>         depends filepath-1.5.4.0-7ce6
Cabal>         depends mtl-2.3.1-9650
Cabal>         depends parsec-3.1.17.0-9beb
Cabal>         depends pretty-1.1.3.6-2a4e
Cabal>         depends process-1.6.25.0-4623
Cabal>         depends time-1.14-f7a8
Cabal>         depends transformers-0.6.1.2-199f
Cabal>         depends unix-2.8.6.0-6369
Cabal> Using Cabal-3.14.1.0 compiled by ghc-9.12
Cabal> Using compiler: ghc-9.12.1
Cabal> Using install prefix:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0
Cabal> Executables installed in:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/bin
Cabal> Libraries installed in:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0
Cabal> Dynamic Libraries installed in:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
Cabal> Private executables installed in:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/Cabal-3.12.1.0
Cabal> Data files installed in:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.12.1-f739/Cabal-3.12.1.0
Cabal> Documentation installed in:
Cabal> /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
Cabal> Configuration files installed in:
Cabal> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/etc
Cabal> No alex found
Cabal> Using ar found on system at:
Cabal> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
Cabal> No c2hs found
Cabal> No cpphs found
Cabal> No doctest found
Cabal> Using gcc version 14.3.0 given by user at:
Cabal> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
Cabal> Using ghc version 9.12.1 found on system at:
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
Cabal> Using ghc-pkg version 9.12.1 found on system at:
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
Cabal> No ghcjs found
Cabal> No ghcjs-pkg found
Cabal> No greencard found
Cabal> Using haddock version 2.30.0 found on system at:
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
Cabal> No happy found
Cabal> No haskell-suite found
Cabal> No haskell-suite-pkg found
Cabal> No hmake found
Cabal> Using hpc version 0.69 found on system at:
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
Cabal> Using hsc2hs version 0.68.10 found on system at:
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
Cabal> Using hscolour version 1.25 found on system at:
Cabal> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
Cabal> No jhc found
Cabal> Using ld found on system at:
Cabal> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
Cabal> No pkg-config found
Cabal> Using runghc version 9.12.1 found on system at:
Cabal> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
Cabal> Using strip version 2.44 found on system at:
Cabal> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
Cabal> Using tar found on system at:
Cabal> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
Cabal> No uhc found
Cabal> Running phase: buildPhase
Cabal> Preprocessing library for Cabal-3.12.1.0...
Cabal> Building library for Cabal-3.12.1.0...
Cabal> [  1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.o, dist/build/Distribution/Backpack/FullUnitId.dyn_o )
Cabal> [  2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.o, dist/build/Distribution/Backpack/ModSubst.dyn_o )
Cabal> [  3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.o, dist/build/Distribution/Backpack/ModuleScope.dyn_o )
Cabal> [  4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.o, dist/build/Distribution/Backpack/ModuleShape.dyn_o )
Cabal> src/Distribution/Backpack/ModuleShape.hs:34:32: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ModuleShape’
Cabal>    |
Cabal> 34 |   deriving (Eq, Show, Generic, Typeable)
Cabal>    |                                ^^^^^^^^
Cabal> 
Cabal> [  5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.o, dist/build/Distribution/Backpack/PreModuleShape.dyn_o )
Cabal> [  6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.o, dist/build/Distribution/Compat/Async.dyn_o )
Cabal> src/Distribution/Compat/Async.hs:148:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘AsyncCancelled’
Cabal>     |
Cabal> 148 |     , Typeable
Cabal>     |       ^^^^^^^^
Cabal> 
Cabal> [  7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.o, dist/build/Distribution/Compat/CreatePipe.dyn_o )
Cabal> [  8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.o, dist/build/Distribution/Compat/Directory.dyn_o )
Cabal> [  9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.o, dist/build/Distribution/Compat/FilePath.dyn_o )
Cabal> [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.o, dist/build/Distribution/Compat/GetShortPathName.dyn_o )
Cabal> [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.o, dist/build/Distribution/Compat/Internal/TempFile.dyn_o )
Cabal> [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.o, dist/build/Distribution/Compat/CopyFile.dyn_o )
Cabal> [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.o, dist/build/Distribution/Compat/Prelude/Internal.dyn_o )
Cabal> [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.o, dist/build/Distribution/Compat/Process.dyn_o )
Cabal> [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.o, dist/build/Distribution/Compat/ResponseFile.dyn_o )
Cabal> [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.o, dist/build/Distribution/Compat/SnocList.dyn_o )
Cabal> [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.o, dist/build/Distribution/Compat/Stack.dyn_o )
Cabal> [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.o, dist/build/Distribution/Compat/Environment.dyn_o )
Cabal> [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
Cabal> [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
Cabal> [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.o, dist/build/Distribution/PackageDescription/Check/Warning.dyn_o )
Cabal> [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
Cabal> [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.o, dist/build/Distribution/Simple/BuildToolDepends.dyn_o )
Cabal> [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.o, dist/build/Distribution/Simple/CCompiler.dyn_o )
Cabal> [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.o, dist/build/Distribution/Simple/Flag.dyn_o )
Cabal> src/Distribution/Simple/Flag.hs:65:66: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Flag’
Cabal>    |
Cabal> 65 | data Flag a = Flag a | NoFlag deriving (Eq, Generic, Show, Read, Typeable, Foldable, Traversable)
Cabal>    |                                                                  ^^^^^^^^
Cabal> 
Cabal> [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.o, dist/build/Distribution/Simple/InstallDirs/Internal.dyn_o )
Cabal> src/Distribution/Simple/InstallDirs/Internal.hs:15:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PathComponent’
Cabal>    |
Cabal> 15 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>    |                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/InstallDirs/Internal.hs:68:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PathTemplateVariable’
Cabal>    |
Cabal> 68 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>    |                               ^^^^^^^^
Cabal> 
Cabal> [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.o, dist/build/Distribution/Simple/InstallDirs.dyn_o )
Cabal> src/Distribution/Simple/InstallDirs.hs:104:47: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘InstallDirs’
Cabal>     |
Cabal> 104 |   deriving (Eq, Read, Show, Functor, Generic, Typeable)
Cabal>     |                                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/InstallDirs.hs:390:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘PathTemplate’
Cabal>     |
Cabal> 390 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>     |                               ^^^^^^^^
Cabal> 
Cabal> [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.o, dist/build/Distribution/Simple/Program/Internal.dyn_o )
Cabal> [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
Cabal> [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.o, dist/build/Distribution/Types/AnnotatedId.dyn_o )
Cabal> [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.o, dist/build/Distribution/Backpack/PreExistingComponent.dyn_o )
Cabal> [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.o, dist/build/Distribution/Types/ComponentInclude.dyn_o )
Cabal> [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.o, dist/build/Distribution/Types/ComponentLocalBuildInfo.dyn_o )
Cabal> src/Distribution/Types/ComponentLocalBuildInfo.hs:111:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ComponentLocalBuildInfo’
Cabal>     |
Cabal> 111 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.o, dist/build/Distribution/Types/DumpBuildInfo.dyn_o )
Cabal> src/Distribution/Types/DumpBuildInfo.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘DumpBuildInfo’
Cabal>    |
Cabal> 13 |   deriving (Read, Show, Eq, Ord, Enum, Bounded, Generic, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.o, dist/build/Distribution/Types/GivenComponent.dyn_o )
Cabal> src/Distribution/Types/GivenComponent.hs:26:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘GivenComponent’
Cabal>    |
Cabal> 26 |   deriving (Generic, Read, Show, Eq, Typeable)
Cabal>    |                                      ^^^^^^^^
Cabal> 
Cabal> [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.o, dist/build/Distribution/Types/PackageName/Magic.dyn_o )
Cabal> [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.o, dist/build/Distribution/Types/ParStrat.dyn_o )
Cabal> [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.o, dist/build/Distribution/Types/TargetInfo.dyn_o )
Cabal> [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.o, dist/build/Distribution/Utils/IOData.dyn_o )
Cabal> [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.o, dist/build/Distribution/Utils/Json.dyn_o )
Cabal> [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.o, dist/build/Distribution/Utils/MapAccum.dyn_o )
Cabal> [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.o, dist/build/Distribution/Utils/Progress.dyn_o )
Cabal> [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.o, dist/build/Distribution/Utils/UnionFind.dyn_o )
Cabal> [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.o, dist/build/Distribution/Verbosity/Internal.dyn_o )
Cabal> src/Distribution/Verbosity/Internal.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerbosityLevel’
Cabal>    |
Cabal> 13 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Verbosity/Internal.hs:27:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerbosityFlag’
Cabal>    |
Cabal> 27 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
Cabal> src/Distribution/Verbosity.hs:95:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Verbosity’
Cabal>    |
Cabal> 95 |   deriving (Generic, Show, Read, Typeable)
Cabal>    |                                  ^^^^^^^^
Cabal> 
Cabal> [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.o, dist/build/Distribution/Simple/Program/Types.dyn_o )
Cabal> src/Distribution/Simple/Program/Types.hs:110:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramSearchPathEntry’
Cabal>     |
Cabal> 110 |   deriving (Eq, Generic, Typeable)
Cabal>     |                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Program/Types.hs:150:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfiguredProgram’
Cabal>     |
Cabal> 150 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Program/Types.hs:163:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramLocation’
Cabal>     |
Cabal> 163 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.o, dist/build/Distribution/Simple/PreProcess/Types.dyn_o )
Cabal> [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.o, dist/build/Distribution/Simple/Errors.dyn_o )
Cabal> src/Distribution/Simple/Errors.hs:176:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘CabalException’
Cabal>     |
Cabal> 176 |   deriving (Show, Typeable)
Cabal>     |                   ^^^^^^^^
Cabal> 
Cabal> [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.o, dist/build/Distribution/Simple/PreProcess/Unlit.dyn_o )
Cabal> [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.o, dist/build/Distribution/Backpack/UnifyM.dyn_o )
Cabal> [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.o, dist/build/Distribution/Backpack/MixLink.dyn_o )
Cabal> [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
Cabal> [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.o, dist/build/Distribution/Simple/Build/PathsModule/Z.dyn_o )
Cabal> [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.o, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.dyn_o )
Cabal> [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.o, dist/build/Distribution/Simple/Build/Macros/Z.dyn_o )
Cabal> [ 56 of 146] Compiling Paths_Cabal      ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.o, dist/build/Paths_Cabal.dyn_o )
Cabal> [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.o, dist/build/Distribution/Simple/Utils.dyn_o )
Cabal> src/Distribution/Simple/Utils.hs:385:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerboseException’
Cabal>     |
Cabal> 385 |   deriving (Show, Typeable)
Cabal>     |                   ^^^^^^^^
Cabal> 
Cabal> [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.o, dist/build/Distribution/Utils/NubList.dyn_o )
Cabal> src/Distribution/Utils/NubList.hs:25:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘NubList’
Cabal>    |
Cabal> 25 |   deriving (Eq, Generic, Typeable)
Cabal>    |                          ^^^^^^^^
Cabal> 
Cabal> [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.o, dist/build/Distribution/Utils/LogProgress.dyn_o )
Cabal> [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.o, dist/build/Distribution/Simple/Program/Run.dyn_o )
Cabal> [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.o, dist/build/Distribution/Simple/Program/Script.dyn_o )
Cabal> [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.o, dist/build/Distribution/Simple/Program/ResponseFile.dyn_o )
Cabal> [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.o, dist/build/Distribution/Simple/Program/Hpc.dyn_o )
Cabal> [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.o, dist/build/Distribution/Simple/Program/Find.dyn_o )
Cabal> [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.o, dist/build/Distribution/Simple/PackageIndex.dyn_o )
Cabal> src/Distribution/Simple/PackageIndex.hs:145:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PackageIndex’
Cabal>     |
Cabal> 145 |   deriving (Eq, Generic, Show, Read, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.o, dist/build/Distribution/Simple/PackageDescription.dyn_o )
Cabal> [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.o, dist/build/Distribution/Simple/Glob/Internal.dyn_o )
Cabal> [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.o, dist/build/Distribution/Simple/Glob.dyn_o )
Cabal> [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.o, dist/build/Distribution/PackageDescription/Check/Monad.dyn_o )
Cabal> [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.o, dist/build/Distribution/PackageDescription/Check/Conditional.dyn_o )
Cabal> [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.o, dist/build/Distribution/PackageDescription/Check/Common.dyn_o )
Cabal> [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.o, dist/build/Distribution/Simple/Compiler.dyn_o )
Cabal> src/Distribution/Simple/Compiler.hs:107:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Compiler’
Cabal>     |
Cabal> 107 |   deriving (Eq, Generic, Typeable, Show, Read)
Cabal>     |                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:179:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PackageDB’
Cabal>     |
Cabal> 179 |   deriving (Eq, Generic, Ord, Show, Read, Typeable)
Cabal>     |                                           ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:231:53: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘OptimisationLevel’
Cabal>     |
Cabal> 231 |   deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
Cabal>     |                                                     ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:264:53: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘DebugInfoLevel’
Cabal>     |
Cabal> 264 |   deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
Cabal>     |                                                     ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:458:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProfDetailLevel’
Cabal>     |
Cabal> 458 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.o, dist/build/Distribution/Simple/Program/HcPkg.dyn_o )
Cabal> [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.o, dist/build/Distribution/Simple/GHC/ImplInfo.dyn_o )
Cabal> [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.o, dist/build/Distribution/Simple/Program/GHC.dyn_o )
Cabal> [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.o, dist/build/Distribution/Simple/Program/Builtin.dyn_o )
Cabal> [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.o, dist/build/Distribution/Simple/Program/Db.dyn_o )
Cabal> src/Distribution/Simple/Program/Db.hs:100:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramDb’
Cabal>     |
Cabal> 100 |   deriving (Typeable)
Cabal>     |             ^^^^^^^^
Cabal> 
Cabal> [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.o, dist/build/Distribution/Simple/Program.dyn_o )
Cabal> [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.o, dist/build/Distribution/Simple/Program/Strip.dyn_o )
Cabal> [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.o, dist/build/Distribution/Simple/Command.dyn_o )
Cabal> [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.o, dist/build/Distribution/Simple/Setup/Common.dyn_o )
Cabal> [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.o, dist/build/Distribution/Simple/Setup/Test.dyn_o )
Cabal> src/Distribution/Simple/Setup/Test.hs:52:52: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘TestShowDetails’
Cabal>    |
Cabal> 52 |   deriving (Eq, Ord, Enum, Bounded, Generic, Show, Typeable)
Cabal>    |                                                    ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Test.hs:94:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘TestFlags’
Cabal>    |
Cabal> 94 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.o, dist/build/Distribution/Simple/Setup/SDist.dyn_o )
Cabal> src/Distribution/Simple/Setup/SDist.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘SDistFlags’
Cabal>    |
Cabal> 50 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.o, dist/build/Distribution/Simple/Setup/Repl.dyn_o )
Cabal> src/Distribution/Simple/Setup/Repl.hs:51:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ReplOptions’
Cabal>    |
Cabal> 51 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Repl.hs:71:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ReplFlags’
Cabal>    |
Cabal> 71 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.o, dist/build/Distribution/Simple/Setup/Register.dyn_o )
Cabal> src/Distribution/Simple/Setup/Register.hs:58:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘RegisterFlags’
Cabal>    |
Cabal> 58 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.o, dist/build/Distribution/Simple/Setup/Install.dyn_o )
Cabal> [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.o, dist/build/Distribution/Simple/Setup/Hscolour.dyn_o )
Cabal> src/Distribution/Simple/Setup/Hscolour.hs:52:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HscolourFlags’
Cabal>    |
Cabal> 52 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.o, dist/build/Distribution/Simple/Setup/Haddock.dyn_o )
Cabal> src/Distribution/Simple/Setup/Haddock.hs:67:79: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockTarget’
Cabal>    |
Cabal> 67 | data HaddockTarget = ForHackage | ForDevelopment deriving (Eq, Show, Generic, Typeable)
Cabal>    |                                                                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Haddock.hs:110:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockFlags’
Cabal>     |
Cabal> 110 |   deriving (Show, Generic, Typeable)
Cabal>     |                            ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Haddock.hs:419:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockProjectFlags’
Cabal>     |
Cabal> 419 |   deriving (Show, Generic, Typeable)
Cabal>     |                            ^^^^^^^^
Cabal> 
Cabal> [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.o, dist/build/Distribution/Simple/Setup/Global.dyn_o )
Cabal> src/Distribution/Simple/Setup/Global.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘GlobalFlags’
Cabal>    |
Cabal> 51 |   deriving (Generic, Typeable)
Cabal>    |                      ^^^^^^^^
Cabal> 
Cabal> [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.o, dist/build/Distribution/Simple/Setup/Copy.dyn_o )
Cabal> [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.o, dist/build/Distribution/Simple/Setup/Config.dyn_o )
Cabal> src/Distribution/Simple/Setup/Config.hs:230:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfigFlags’
Cabal>     |
Cabal> 230 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.o, dist/build/Distribution/Types/LocalBuildConfig.dyn_o )
Cabal> [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.o, dist/build/Distribution/Types/LocalBuildInfo.dyn_o )
Cabal> src/Distribution/Types/LocalBuildInfo.hs:137:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘LocalBuildInfo’
Cabal>     |
Cabal> 137 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.o, dist/build/Distribution/Simple/LocalBuildInfo.dyn_o )
Cabal> [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.o, dist/build/Distribution/Simple/Test/Log.dyn_o )
Cabal> [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.o, dist/build/Distribution/Simple/Hpc.dyn_o )
Cabal> [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.o, dist/build/Distribution/Simple/Build/PackageInfoModule.dyn_o )
Cabal> [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.o, dist/build/Distribution/Simple/Build/Macros.dyn_o )
Cabal> [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.o, dist/build/Distribution/Backpack/Id.dyn_o )
Cabal> [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.o, dist/build/Distribution/Backpack/ConfiguredComponent.dyn_o )
Cabal> [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.o, dist/build/Distribution/Backpack/LinkedComponent.dyn_o )
Cabal> [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.o, dist/build/Distribution/Backpack/ComponentsGraph.dyn_o )
Cabal> [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.o, dist/build/Distribution/Simple/Program/Ld.dyn_o )
Cabal> [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.o, dist/build/Distribution/Simple/Program/Ar.dyn_o )
Cabal> [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.o, dist/build/Distribution/Simple/ConfigureScript.dyn_o )
Cabal> [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.o, dist/build/Distribution/Simple/Setup/Clean.dyn_o )
Cabal> src/Distribution/Simple/Setup/Clean.hs:48:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘CleanFlags’
Cabal>    |
Cabal> 48 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.o, dist/build/Distribution/Simple/Setup/Build.dyn_o )
Cabal> src/Distribution/Simple/Setup/Build.hs:59:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘BuildFlags’
Cabal>    |
Cabal> 59 |   deriving (Read, Show, Generic, Typeable)
Cabal>    |                                  ^^^^^^^^
Cabal> 
Cabal> [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.o, dist/build/Distribution/Simple/Setup/Benchmark.dyn_o )
Cabal> src/Distribution/Simple/Setup/Benchmark.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘BenchmarkFlags’
Cabal>    |
Cabal> 50 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.o, dist/build/Distribution/Simple/Setup.dyn_o )
Cabal> [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.o, dist/build/Distribution/Simple/Build/Inputs.dyn_o )
Cabal> [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.o, dist/build/Distribution/Simple/BuildTarget.dyn_o )
Cabal> [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.o, dist/build/Distribution/Simple/BuildPaths.dyn_o )
Cabal> [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.o, dist/build/Distribution/Simple/UHC.dyn_o )
Cabal> [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.o, dist/build/Distribution/Simple/HaskellSuite.dyn_o )
Cabal> [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.o, dist/build/Distribution/Simple/GHC/Internal.dyn_o )
Cabal> [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.o, dist/build/Distribution/Simple/GHC/EnvironmentParser.dyn_o )
Cabal> src/Distribution/Simple/GHC/EnvironmentParser.hs:49:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘ParseErrorExc’
Cabal>    |
Cabal> 49 |   deriving (Show, Typeable)
Cabal>    |                   ^^^^^^^^
Cabal> 
Cabal> [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.o, dist/build/Distribution/Simple/GHCJS.dyn_o )
Cabal> [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.o, dist/build/Distribution/Simple/GHC/Build/Utils.dyn_o )
Cabal> [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.o, dist/build/Distribution/Simple/GHC/Build/Modules.dyn_o )
Cabal> [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.o, dist/build/Distribution/Simple/GHC/Build/ExtraSources.dyn_o )
Cabal> [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.o, dist/build/Distribution/Simple/GHC/Build/Link.dyn_o )
Cabal> [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.o, dist/build/Distribution/Simple/GHC/Build.dyn_o )
Cabal> [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.o, dist/build/Distribution/Simple/GHC.dyn_o )
Cabal> [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.o, dist/build/Distribution/Simple/ShowBuildInfo.dyn_o )
Cabal> [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.o, dist/build/Distribution/Simple/Install.dyn_o )
Cabal> [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.o, dist/build/Distribution/Simple/Build/PathsModule.dyn_o )
Cabal> [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.o, dist/build/Distribution/Simple/Test/LibV09.dyn_o )
Cabal> [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.o, dist/build/Distribution/Simple/Test/ExeV10.dyn_o )
Cabal> [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.o, dist/build/Distribution/PackageDescription/Check/Paths.dyn_o )
Cabal> [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.o, dist/build/Distribution/PackageDescription/Check/Target.dyn_o )
Cabal> [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.o, dist/build/Distribution/PackageDescription/Check.dyn_o )
Cabal> [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
Cabal> [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.o, dist/build/Distribution/Compat/Time.dyn_o )
Cabal> src/Distribution/Compat/Time.hs:61:48: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘ModTime’
Cabal>    |
Cabal> 61 |   deriving (Binary, Generic, Bounded, Eq, Ord, Typeable)
Cabal>    |                                                ^^^^^^^^
Cabal> 
Cabal> [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.o, dist/build/Distribution/Backpack/ReadyComponent.dyn_o )
Cabal> [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.o, dist/build/Distribution/Backpack/Configure.dyn_o )
Cabal> [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.o, dist/build/Distribution/Backpack/DescribeUnitId.dyn_o )
Cabal> [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.o, dist/build/Distribution/Simple/Register.dyn_o )
Cabal> [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.o, dist/build/Distribution/Simple/PreProcess.dyn_o )
Cabal> [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.o, dist/build/Distribution/Simple/UserHooks.dyn_o )
Cabal> [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.o, dist/build/Distribution/Simple/Bench.dyn_o )
Cabal> [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.o, dist/build/Distribution/Simple/Configure.dyn_o )
Cabal> src/Distribution/Simple/Configure.hs:188:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfigStateFileError’
Cabal>     |
Cabal> 188 |   deriving (Typeable)
Cabal>     |             ^^^^^^^^
Cabal> 
Cabal> [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.o, dist/build/Distribution/Simple/Test.dyn_o )
Cabal> [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.o, dist/build/Distribution/Simple/SrcDist.dyn_o )
Cabal> [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.o, dist/build/Distribution/Simple/Build.dyn_o )
Cabal> [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.o, dist/build/Distribution/Simple/Haddock.dyn_o )
Cabal> [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
Cabal> [  1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
Cabal> [  2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
Cabal> [  3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
Cabal> [  4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
Cabal> src/Distribution/Backpack/ModuleShape.hs:34:32: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ModuleShape’
Cabal>    |
Cabal> 34 |   deriving (Eq, Show, Generic, Typeable)
Cabal>    |                                ^^^^^^^^
Cabal> 
Cabal> [  5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
Cabal> [  6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
Cabal> src/Distribution/Compat/Async.hs:148:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘AsyncCancelled’
Cabal>     |
Cabal> 148 |     , Typeable
Cabal>     |       ^^^^^^^^
Cabal> 
Cabal> [  7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
Cabal> [  8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
Cabal> [  9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
Cabal> [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
Cabal> [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
Cabal> [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
Cabal> [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
Cabal> [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
Cabal> [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
Cabal> [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
Cabal> [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
Cabal> [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
Cabal> [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
Cabal> [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
Cabal> [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
Cabal> [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
Cabal> [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
Cabal> [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
Cabal> [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
Cabal> src/Distribution/Simple/Flag.hs:65:66: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Flag’
Cabal>    |
Cabal> 65 | data Flag a = Flag a | NoFlag deriving (Eq, Generic, Show, Read, Typeable, Foldable, Traversable)
Cabal>    |                                                                  ^^^^^^^^
Cabal> 
Cabal> [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
Cabal> src/Distribution/Simple/InstallDirs/Internal.hs:15:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PathComponent’
Cabal>    |
Cabal> 15 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>    |                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/InstallDirs/Internal.hs:68:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PathTemplateVariable’
Cabal>    |
Cabal> 68 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>    |                               ^^^^^^^^
Cabal> 
Cabal> [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
Cabal> src/Distribution/Simple/InstallDirs.hs:104:47: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘InstallDirs’
Cabal>     |
Cabal> 104 |   deriving (Eq, Read, Show, Functor, Generic, Typeable)
Cabal>     |                                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/InstallDirs.hs:390:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘PathTemplate’
Cabal>     |
Cabal> 390 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>     |                               ^^^^^^^^
Cabal> 
Cabal> [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
Cabal> [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
Cabal> [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
Cabal> [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
Cabal> [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
Cabal> [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
Cabal> src/Distribution/Types/ComponentLocalBuildInfo.hs:111:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ComponentLocalBuildInfo’
Cabal>     |
Cabal> 111 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
Cabal> src/Distribution/Types/DumpBuildInfo.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘DumpBuildInfo’
Cabal>    |
Cabal> 13 |   deriving (Read, Show, Eq, Ord, Enum, Bounded, Generic, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
Cabal> src/Distribution/Types/GivenComponent.hs:26:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘GivenComponent’
Cabal>    |
Cabal> 26 |   deriving (Generic, Read, Show, Eq, Typeable)
Cabal>    |                                      ^^^^^^^^
Cabal> 
Cabal> [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
Cabal> [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
Cabal> [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
Cabal> [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
Cabal> [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
Cabal> [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
Cabal> [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
Cabal> [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
Cabal> [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
Cabal> src/Distribution/Verbosity/Internal.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerbosityLevel’
Cabal>    |
Cabal> 13 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Verbosity/Internal.hs:27:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerbosityFlag’
Cabal>    |
Cabal> 27 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
Cabal> src/Distribution/Verbosity.hs:95:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Verbosity’
Cabal>    |
Cabal> 95 |   deriving (Generic, Show, Read, Typeable)
Cabal>    |                                  ^^^^^^^^
Cabal> 
Cabal> [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
Cabal> src/Distribution/Simple/Program/Types.hs:110:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramSearchPathEntry’
Cabal>     |
Cabal> 110 |   deriving (Eq, Generic, Typeable)
Cabal>     |                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Program/Types.hs:150:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfiguredProgram’
Cabal>     |
Cabal> 150 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Program/Types.hs:163:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramLocation’
Cabal>     |
Cabal> 163 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
Cabal> [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
Cabal> src/Distribution/Simple/Errors.hs:176:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘CabalException’
Cabal>     |
Cabal> 176 |   deriving (Show, Typeable)
Cabal>     |                   ^^^^^^^^
Cabal> 
Cabal> [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
Cabal> [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
Cabal> [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
Cabal> [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
Cabal> [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.p_o )
Cabal> [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.p_o )
Cabal> [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.p_o )
Cabal> [ 56 of 146] Compiling Paths_Cabal      ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
Cabal> [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
Cabal> src/Distribution/Simple/Utils.hs:385:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerboseException’
Cabal>     |
Cabal> 385 |   deriving (Show, Typeable)
Cabal>     |                   ^^^^^^^^
Cabal> 
Cabal> [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
Cabal> src/Distribution/Utils/NubList.hs:25:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘NubList’
Cabal>    |
Cabal> 25 |   deriving (Eq, Generic, Typeable)
Cabal>    |                          ^^^^^^^^
Cabal> 
Cabal> [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
Cabal> [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
Cabal> [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
Cabal> [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
Cabal> [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
Cabal> [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
Cabal> [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
Cabal> src/Distribution/Simple/PackageIndex.hs:145:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PackageIndex’
Cabal>     |
Cabal> 145 |   deriving (Eq, Generic, Show, Read, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
Cabal> [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
Cabal> [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
Cabal> [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
Cabal> [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
Cabal> [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
Cabal> [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
Cabal> src/Distribution/Simple/Compiler.hs:107:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Compiler’
Cabal>     |
Cabal> 107 |   deriving (Eq, Generic, Typeable, Show, Read)
Cabal>     |                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:179:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PackageDB’
Cabal>     |
Cabal> 179 |   deriving (Eq, Generic, Ord, Show, Read, Typeable)
Cabal>     |                                           ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:231:53: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘OptimisationLevel’
Cabal>     |
Cabal> 231 |   deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
Cabal>     |                                                     ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:264:53: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘DebugInfoLevel’
Cabal>     |
Cabal> 264 |   deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
Cabal>     |                                                     ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:458:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProfDetailLevel’
Cabal>     |
Cabal> 458 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
Cabal> [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
Cabal> [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
Cabal> [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
Cabal> [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
Cabal> src/Distribution/Simple/Program/Db.hs:100:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramDb’
Cabal>     |
Cabal> 100 |   deriving (Typeable)
Cabal>     |             ^^^^^^^^
Cabal> 
Cabal> [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
Cabal> [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
Cabal> [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
Cabal> [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
Cabal> [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
Cabal> src/Distribution/Simple/Setup/Test.hs:52:52: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘TestShowDetails’
Cabal>    |
Cabal> 52 |   deriving (Eq, Ord, Enum, Bounded, Generic, Show, Typeable)
Cabal>    |                                                    ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Test.hs:94:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘TestFlags’
Cabal>    |
Cabal> 94 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
Cabal> src/Distribution/Simple/Setup/SDist.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘SDistFlags’
Cabal>    |
Cabal> 50 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
Cabal> src/Distribution/Simple/Setup/Repl.hs:51:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ReplOptions’
Cabal>    |
Cabal> 51 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Repl.hs:71:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ReplFlags’
Cabal>    |
Cabal> 71 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
Cabal> src/Distribution/Simple/Setup/Register.hs:58:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘RegisterFlags’
Cabal>    |
Cabal> 58 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
Cabal> [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
Cabal> src/Distribution/Simple/Setup/Hscolour.hs:52:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HscolourFlags’
Cabal>    |
Cabal> 52 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
Cabal> src/Distribution/Simple/Setup/Haddock.hs:67:79: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockTarget’
Cabal>    |
Cabal> 67 | data HaddockTarget = ForHackage | ForDevelopment deriving (Eq, Show, Generic, Typeable)
Cabal>    |                                                                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Haddock.hs:110:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockFlags’
Cabal>     |
Cabal> 110 |   deriving (Show, Generic, Typeable)
Cabal>     |                            ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Haddock.hs:419:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockProjectFlags’
Cabal>     |
Cabal> 419 |   deriving (Show, Generic, Typeable)
Cabal>     |                            ^^^^^^^^
Cabal> 
Cabal> [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
Cabal> src/Distribution/Simple/Setup/Global.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘GlobalFlags’
Cabal>    |
Cabal> 51 |   deriving (Generic, Typeable)
Cabal>    |                      ^^^^^^^^
Cabal> 
Cabal> [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
Cabal> [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
Cabal> src/Distribution/Simple/Setup/Config.hs:230:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfigFlags’
Cabal>     |
Cabal> 230 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
Cabal> [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
Cabal> src/Distribution/Types/LocalBuildInfo.hs:137:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘LocalBuildInfo’
Cabal>     |
Cabal> 137 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
Cabal> [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
Cabal> [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
Cabal> [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
Cabal> [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
Cabal> [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
Cabal> [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
Cabal> [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
Cabal> [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
Cabal> [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
Cabal> [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
Cabal> [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
Cabal> [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
Cabal> src/Distribution/Simple/Setup/Clean.hs:48:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘CleanFlags’
Cabal>    |
Cabal> 48 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
Cabal> src/Distribution/Simple/Setup/Build.hs:59:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘BuildFlags’
Cabal>    |
Cabal> 59 |   deriving (Read, Show, Generic, Typeable)
Cabal>    |                                  ^^^^^^^^
Cabal> 
Cabal> [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
Cabal> src/Distribution/Simple/Setup/Benchmark.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘BenchmarkFlags’
Cabal>    |
Cabal> 50 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
Cabal> [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
Cabal> [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
Cabal> [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
Cabal> [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
Cabal> [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
Cabal> [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
Cabal> [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
Cabal> src/Distribution/Simple/GHC/EnvironmentParser.hs:49:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘ParseErrorExc’
Cabal>    |
Cabal> 49 |   deriving (Show, Typeable)
Cabal>    |                   ^^^^^^^^
Cabal> 
Cabal> [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
Cabal> [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.p_o )
Cabal> [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.p_o )
Cabal> [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.p_o )
Cabal> [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.p_o )
Cabal> [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
Cabal> [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
Cabal> [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
Cabal> [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
Cabal> [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
Cabal> [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
Cabal> [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
Cabal> [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
Cabal> [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
Cabal> [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
Cabal> [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
Cabal> [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
Cabal> src/Distribution/Compat/Time.hs:61:48: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘ModTime’
Cabal>    |
Cabal> 61 |   deriving (Binary, Generic, Bounded, Eq, Ord, Typeable)
Cabal>    |                                                ^^^^^^^^
Cabal> 
Cabal> [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
Cabal> [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
Cabal> [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
Cabal> [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
Cabal> [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
Cabal> [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
Cabal> [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
Cabal> [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
Cabal> src/Distribution/Simple/Configure.hs:188:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfigStateFileError’
Cabal>     |
Cabal> 188 |   deriving (Typeable)
Cabal>     |             ^^^^^^^^
Cabal> 
Cabal> [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
Cabal> [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
Cabal> [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
Cabal> [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
Cabal> [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
Cabal> buildPhase completed in 1 minutes 5 seconds
Cabal> Running phase: haddockPhase
Cabal> Preprocessing library for Cabal-3.12.1.0...
Cabal> Running Haddock on library for Cabal-3.12.1.0...
Cabal> [  1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, nothing ) [HIE file is missing]
Cabal> [  2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, nothing ) [HIE file is missing]
Cabal> [  3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, nothing ) [HIE file is missing]
Cabal> [  4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Backpack/ModuleShape.hs:34:32: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ModuleShape’
Cabal>    |
Cabal> 34 |   deriving (Eq, Show, Generic, Typeable)
Cabal>    |                                ^^^^^^^^
Cabal> 
Cabal> [  5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, nothing ) [HIE file is missing]
Cabal> [  6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Compat/Async.hs:148:7: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘AsyncCancelled’
Cabal>     |
Cabal> 148 |     , Typeable
Cabal>     |       ^^^^^^^^
Cabal> 
Cabal> [  7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, nothing ) [HIE file is missing]
Cabal> [  8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, nothing ) [HIE file is missing]
Cabal> [  9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, nothing ) [HIE file is missing]
Cabal> [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, nothing ) [HIE file is missing]
Cabal> [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, nothing ) [HIE file is missing]
Cabal> [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, nothing ) [HIE file is missing]
Cabal> [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, nothing ) [HIE file is missing]
Cabal> [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, nothing ) [HIE file is missing]
Cabal> [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, nothing ) [HIE file is missing]
Cabal> [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, nothing ) [HIE file is missing]
Cabal> [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, nothing ) [HIE file is missing]
Cabal> [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, nothing ) [HIE file is missing]
Cabal> [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, nothing ) [HIE file is missing]
Cabal> [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, nothing ) [HIE file is missing]
Cabal> [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, nothing ) [HIE file is missing]
Cabal> [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, nothing ) [HIE file is missing]
Cabal> [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, nothing ) [HIE file is missing]
Cabal> [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, nothing ) [HIE file is missing]
Cabal> [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Flag.hs:65:66: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Flag’
Cabal>    |
Cabal> 65 | data Flag a = Flag a | NoFlag deriving (Eq, Generic, Show, Read, Typeable, Foldable, Traversable)
Cabal>    |                                                                  ^^^^^^^^
Cabal> 
Cabal> [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/InstallDirs/Internal.hs:15:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PathComponent’
Cabal>    |
Cabal> 15 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>    |                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/InstallDirs/Internal.hs:68:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PathTemplateVariable’
Cabal>    |
Cabal> 68 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>    |                               ^^^^^^^^
Cabal> 
Cabal> [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/InstallDirs.hs:104:47: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘InstallDirs’
Cabal>     |
Cabal> 104 |   deriving (Eq, Read, Show, Functor, Generic, Typeable)
Cabal>     |                                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/InstallDirs.hs:390:31: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘PathTemplate’
Cabal>     |
Cabal> 390 |   deriving (Eq, Ord, Generic, Typeable)
Cabal>     |                               ^^^^^^^^
Cabal> 
Cabal> [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, nothing ) [HIE file is missing]
Cabal> [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, nothing ) [HIE file is missing]
Cabal> [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, nothing ) [HIE file is missing]
Cabal> [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, nothing ) [HIE file is missing]
Cabal> [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, nothing ) [HIE file is missing]
Cabal> [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Types/ComponentLocalBuildInfo.hs:111:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ComponentLocalBuildInfo’
Cabal>     |
Cabal> 111 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Types/DumpBuildInfo.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘DumpBuildInfo’
Cabal>    |
Cabal> 13 |   deriving (Read, Show, Eq, Ord, Enum, Bounded, Generic, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Types/GivenComponent.hs:26:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘GivenComponent’
Cabal>    |
Cabal> 26 |   deriving (Generic, Read, Show, Eq, Typeable)
Cabal>    |                                      ^^^^^^^^
Cabal> 
Cabal> [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, nothing ) [HIE file is missing]
Cabal> [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, nothing ) [HIE file is missing]
Cabal> [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, nothing ) [HIE file is missing]
Cabal> [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, nothing ) [HIE file is missing]
Cabal> [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, nothing ) [HIE file is missing]
Cabal> [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, nothing ) [HIE file is missing]
Cabal> [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, nothing ) [HIE file is missing]
Cabal> [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, nothing ) [HIE file is missing]
Cabal> [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Verbosity/Internal.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerbosityLevel’
Cabal>    |
Cabal> 13 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Verbosity/Internal.hs:27:58: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerbosityFlag’
Cabal>    |
Cabal> 27 |   deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
Cabal>    |                                                          ^^^^^^^^
Cabal> 
Cabal> [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Verbosity.hs:95:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Verbosity’
Cabal>    |
Cabal> 95 |   deriving (Generic, Show, Read, Typeable)
Cabal>    |                                  ^^^^^^^^
Cabal> 
Cabal> [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Program/Types.hs:110:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramSearchPathEntry’
Cabal>     |
Cabal> 110 |   deriving (Eq, Generic, Typeable)
Cabal>     |                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Program/Types.hs:150:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfiguredProgram’
Cabal>     |
Cabal> 150 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Program/Types.hs:163:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramLocation’
Cabal>     |
Cabal> 163 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, nothing ) [HIE file is missing]
Cabal> [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Errors.hs:176:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘CabalException’
Cabal>     |
Cabal> 176 |   deriving (Show, Typeable)
Cabal>     |                   ^^^^^^^^
Cabal> 
Cabal> [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, nothing ) [HIE file is missing]
Cabal> [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, nothing ) [HIE file is missing]
Cabal> [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, nothing ) [HIE file is missing]
Cabal> [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, nothing ) [HIE file is missing]
Cabal> [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, nothing ) [HIE file is missing]
Cabal> [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, nothing ) [HIE file is missing]
Cabal> [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, nothing ) [HIE file is missing]
Cabal> [ 56 of 146] Compiling Paths_Cabal      ( dist/build/autogen/Paths_Cabal.hs, nothing ) [HIE file is missing]
Cabal> [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Utils.hs:385:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘VerboseException’
Cabal>     |
Cabal> 385 |   deriving (Show, Typeable)
Cabal>     |                   ^^^^^^^^
Cabal> 
Cabal> [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Utils/NubList.hs:25:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘NubList’
Cabal>    |
Cabal> 25 |   deriving (Eq, Generic, Typeable)
Cabal>    |                          ^^^^^^^^
Cabal> 
Cabal> [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, nothing ) [HIE file is missing]
Cabal> [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, nothing ) [HIE file is missing]
Cabal> [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, nothing ) [HIE file is missing]
Cabal> [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, nothing ) [HIE file is missing]
Cabal> [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, nothing ) [HIE file is missing]
Cabal> [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, nothing ) [HIE file is missing]
Cabal> [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/PackageIndex.hs:145:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PackageIndex’
Cabal>     |
Cabal> 145 |   deriving (Eq, Generic, Show, Read, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, nothing ) [HIE file is missing]
Cabal> [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, nothing ) [HIE file is missing]
Cabal> [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, nothing ) [HIE file is missing]
Cabal> [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, nothing ) [HIE file is missing]
Cabal> [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, nothing ) [HIE file is missing]
Cabal> [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, nothing ) [HIE file is missing]
Cabal> [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Compiler.hs:107:26: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘Compiler’
Cabal>     |
Cabal> 107 |   deriving (Eq, Generic, Typeable, Show, Read)
Cabal>     |                          ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:179:43: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘PackageDB’
Cabal>     |
Cabal> 179 |   deriving (Eq, Generic, Ord, Show, Read, Typeable)
Cabal>     |                                           ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:231:53: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘OptimisationLevel’
Cabal>     |
Cabal> 231 |   deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
Cabal>     |                                                     ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:264:53: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘DebugInfoLevel’
Cabal>     |
Cabal> 264 |   deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
Cabal>     |                                                     ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Compiler.hs:458:38: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProfDetailLevel’
Cabal>     |
Cabal> 458 |   deriving (Eq, Generic, Read, Show, Typeable)
Cabal>     |                                      ^^^^^^^^
Cabal> 
Cabal> [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, nothing ) [HIE file is missing]
Cabal> [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, nothing ) [HIE file is missing]
Cabal> [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, nothing ) [HIE file is missing]
Cabal> [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, nothing ) [HIE file is missing]
Cabal> [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Program/Db.hs:100:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ProgramDb’
Cabal>     |
Cabal> 100 |   deriving (Typeable)
Cabal>     |             ^^^^^^^^
Cabal> 
Cabal> [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, nothing ) [HIE file is missing]
Cabal> [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, nothing ) [HIE file is missing]
Cabal> [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, nothing ) [HIE file is missing]
Cabal> [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, nothing ) [HIE file is missing]
Cabal> [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Test.hs:52:52: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘TestShowDetails’
Cabal>    |
Cabal> 52 |   deriving (Eq, Ord, Enum, Bounded, Generic, Show, Typeable)
Cabal>    |                                                    ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Test.hs:94:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘TestFlags’
Cabal>    |
Cabal> 94 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/SDist.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘SDistFlags’
Cabal>    |
Cabal> 50 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Repl.hs:51:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ReplOptions’
Cabal>    |
Cabal> 51 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Repl.hs:71:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ReplFlags’
Cabal>    |
Cabal> 71 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Register.hs:58:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘RegisterFlags’
Cabal>    |
Cabal> 58 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, nothing ) [HIE file is missing]
Cabal> [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Hscolour.hs:52:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HscolourFlags’
Cabal>    |
Cabal> 52 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Haddock.hs:67:79: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockTarget’
Cabal>    |
Cabal> 67 | data HaddockTarget = ForHackage | ForDevelopment deriving (Eq, Show, Generic, Typeable)
Cabal>    |                                                                               ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Haddock.hs:110:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockFlags’
Cabal>     |
Cabal> 110 |   deriving (Show, Generic, Typeable)
Cabal>     |                            ^^^^^^^^
Cabal> 
Cabal> src/Distribution/Simple/Setup/Haddock.hs:419:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘HaddockProjectFlags’
Cabal>     |
Cabal> 419 |   deriving (Show, Generic, Typeable)
Cabal>     |                            ^^^^^^^^
Cabal> 
Cabal> [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Global.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘GlobalFlags’
Cabal>    |
Cabal> 51 |   deriving (Generic, Typeable)
Cabal>    |                      ^^^^^^^^
Cabal> 
Cabal> [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, nothing ) [HIE file is missing]
Cabal> [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Config.hs:230:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfigFlags’
Cabal>     |
Cabal> 230 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, nothing ) [HIE file is missing]
Cabal> [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Types/LocalBuildInfo.hs:137:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘LocalBuildInfo’
Cabal>     |
Cabal> 137 |   deriving (Generic, Read, Show, Typeable)
Cabal>     |                                  ^^^^^^^^
Cabal> 
Cabal> [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, nothing ) [HIE file is missing]
Cabal> [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, nothing ) [HIE file is missing]
Cabal> [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, nothing ) [HIE file is missing]
Cabal> [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, nothing ) [HIE file is missing]
Cabal> [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, nothing ) [HIE file is missing]
Cabal> [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, nothing ) [HIE file is missing]
Cabal> [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, nothing ) [HIE file is missing]
Cabal> [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, nothing ) [HIE file is missing]
Cabal> [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, nothing ) [HIE file is missing]
Cabal> [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, nothing ) [HIE file is missing]
Cabal> [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, nothing ) [HIE file is missing]
Cabal> [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, nothing ) [HIE file is missing]
Cabal> [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Clean.hs:48:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘CleanFlags’
Cabal>    |
Cabal> 48 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Build.hs:59:34: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘BuildFlags’
Cabal>    |
Cabal> 59 |   deriving (Read, Show, Generic, Typeable)
Cabal>    |                                  ^^^^^^^^
Cabal> 
Cabal> [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Setup/Benchmark.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘BenchmarkFlags’
Cabal>    |
Cabal> 50 |   deriving (Show, Generic, Typeable)
Cabal>    |                            ^^^^^^^^
Cabal> 
Cabal> [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, nothing ) [HIE file is missing]
Cabal> [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, nothing ) [HIE file is missing]
Cabal> [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, nothing ) [HIE file is missing]
Cabal> [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, nothing ) [HIE file is missing]
Cabal> [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, nothing ) [HIE file is missing]
Cabal> [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, nothing ) [HIE file is missing]
Cabal> [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, nothing ) [HIE file is missing]
Cabal> [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/GHC/EnvironmentParser.hs:49:19: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘ParseErrorExc’
Cabal>    |
Cabal> 49 |   deriving (Show, Typeable)
Cabal>    |                   ^^^^^^^^
Cabal> 
Cabal> [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, nothing ) [HIE file is missing]
Cabal> [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, nothing ) [HIE file is missing]
Cabal> [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, nothing ) [HIE file is missing]
Cabal> [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, nothing ) [HIE file is missing]
Cabal> [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, nothing ) [HIE file is missing]
Cabal> [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, nothing ) [HIE file is missing]
Cabal> [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, nothing ) [HIE file is missing]
Cabal> [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, nothing ) [HIE file is missing]
Cabal> [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, nothing ) [HIE file is missing]
Cabal> [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, nothing ) [HIE file is missing]
Cabal> [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, nothing ) [HIE file is missing]
Cabal> [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, nothing ) [HIE file is missing]
Cabal> [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, nothing ) [HIE file is missing]
Cabal> [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, nothing ) [HIE file is missing]
Cabal> [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, nothing ) [HIE file is missing]
Cabal> [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, nothing ) [HIE file is missing]
Cabal> [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Compat/Time.hs:61:48: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the newtype declaration for ‘ModTime’
Cabal>    |
Cabal> 61 |   deriving (Binary, Generic, Bounded, Eq, Ord, Typeable)
Cabal>    |                                                ^^^^^^^^
Cabal> 
Cabal> [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, nothing ) [HIE file is missing]
Cabal> [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, nothing ) [HIE file is missing]
Cabal> [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, nothing ) [HIE file is missing]
Cabal> [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, nothing ) [HIE file is missing]
Cabal> [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, nothing ) [HIE file is missing]
Cabal> [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, nothing ) [HIE file is missing]
Cabal> [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, nothing ) [HIE file is missing]
Cabal> [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, nothing ) [HIE file is missing]
Cabal> src/Distribution/Simple/Configure.hs:188:13: warning: [GHC-90584] [-Wderiving-typeable]
Cabal>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
Cabal>     • In the data declaration for ‘ConfigStateFileError’
Cabal>     |
Cabal> 188 |   deriving (Typeable)
Cabal>     |             ^^^^^^^^
Cabal> 
Cabal> [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, nothing ) [HIE file is missing]
Cabal> [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, nothing ) [HIE file is missing]
Cabal> [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, nothing ) [HIE file is missing]
Cabal> [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, nothing ) [HIE file is missing]
Cabal> [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, nothing ) [HIE file is missing]
Cabal> Haddock coverage:
Cabal>    0% (  0 /  5) in 'Distribution.Backpack.FullUnitId'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
Cabal>     FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
Cabal>     expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:21)
Cabal>     expandUnitId (src/Distribution/Backpack/FullUnitId.hs:27)
Cabal> Warning: 'ModuleSubst' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Backpack.ModSubst'
Cabal> Warning: 'ModuleScope' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:20
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal> Warning: 'Module' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ModuleShape' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'OpenModule' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Backpack’
Cabal>     * in ‘Distribution.Backpack’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Backpack’
Cabal> Warning: 'ModuleShape' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:20
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal>   80% (  4 /  5) in 'Distribution.Backpack.ModuleShape'
Cabal>   Missing documentation for:
Cabal>     shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:77)
Cabal>    0% (  0 /  5) in 'Distribution.Backpack.PreModuleShape'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
Cabal>     toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:29)
Cabal>     renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:32)
Cabal>     mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:41)
Cabal> Warning: 'async' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Compat.CreatePipe'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   75% (  3 /  4) in 'Distribution.Compat.Directory'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   66% (  2 /  3) in 'Distribution.Compat.FilePath'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'GetShortPathName' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Compat.Prelude.Internal'
Cabal> Warning: 'delegate_ctlc' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   80% (  4 /  5) in 'Distribution.Compat.Process'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   66% (  2 /  3) in 'Distribution.Compat.ResponseFile'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'Verbosity' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   66% (  6 /  9) in 'Distribution.Compat.Stack'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     WithCallStack (src/Distribution/Compat/Stack.hs:31)
Cabal>     withLexicalCallStack (src/Distribution/Compat/Stack.hs:74)
Cabal> Warning: 'ReturnInOrder' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageCheck' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  5 / 10) in 'Distribution.ReadE'
Cabal>   Missing documentation for:
Cabal>     succeedReadE (src/Distribution/ReadE.hs:47)
Cabal>     failReadE (src/Distribution/ReadE.hs:50)
Cabal>     parsecToReadE (src/Distribution/ReadE.hs:57)
Cabal>     parsecToReadEErr (src/Distribution/ReadE.hs:61)
Cabal>     unexpectMsgString (src/Distribution/ReadE.hs:67)
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal>  100% (  6 /  6) in 'Distribution.Simple.BuildToolDepends'
Cabal> Warning: 'a' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'b' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  5 /  5) in 'Distribution.Simple.CCompiler'
Cabal> Warning: 'Flag' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Flag.hs:65:15
Cabal>     * at src/Distribution/Simple/Flag.hs:65:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Flag.hs:65:1
Cabal>  100% ( 12 / 12) in 'Distribution.Simple.Flag'
Cabal>    0% (  0 /  3) in 'Distribution.Simple.InstallDirs.Internal'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
Cabal>     PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
Cabal> Warning: 'InstallDirs' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:85:24
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:85:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:85:1
Cabal> Warning: 'PathTemplate' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:389:24
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:389:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:389:1
Cabal>   47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
Cabal>   Missing documentation for:
Cabal>     defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
Cabal>     defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
Cabal>     combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
Cabal>     PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
Cabal>     PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
Cabal>     combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
Cabal>     substPathTemplate (src/Distribution/Simple/InstallDirs.hs:414)
Cabal>     platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
Cabal>     compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
Cabal>     packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
Cabal>     abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
Cabal>     installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
Cabal> Warning: 'strip' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Program.Internal'
Cabal> Warning: 'TestInstance' is ambiguous. It is defined
Cabal>     * at src/Distribution/TestSuite.hs:30:21
Cabal>     * at src/Distribution/TestSuite.hs:30:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/TestSuite.hs:30:1
Cabal>   22% (  2 /  9) in 'Distribution.TestSuite'
Cabal>   Missing documentation for:
Cabal>     TestInstance (src/Distribution/TestSuite.hs:30)
Cabal>     OptionDescr (src/Distribution/TestSuite.hs:49)
Cabal>     OptionType (src/Distribution/TestSuite.hs:59)
Cabal>     Test (src/Distribution/TestSuite.hs:78)
Cabal>     Options (src/Distribution/TestSuite.hs:94)
Cabal>     Progress (src/Distribution/TestSuite.hs:96)
Cabal>     Result (src/Distribution/TestSuite.hs:100)
Cabal> Warning: 'AnnotatedId' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/AnnotatedId.hs:19:23
Cabal>     * at src/Distribution/Types/AnnotatedId.hs:19:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/AnnotatedId.hs:19:1
Cabal>   50% (  1 /  2) in 'Distribution.Types.AnnotatedId'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'PreExistingComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/PreExistingComponent.hs:37:29
Cabal>     * at src/Distribution/Backpack/PreExistingComponent.hs:37:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/PreExistingComponent.hs:37:1
Cabal> Warning: 'LinkedComponent' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'pc_pkgid' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'CSubLibName' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   20% (  1 /  5) in 'Distribution.Types.ComponentInclude'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
Cabal>     ci_id (src/Distribution/Types/ComponentInclude.hs:25)
Cabal>     ci_pkgid (src/Distribution/Types/ComponentInclude.hs:28)
Cabal> Warning: 'ModuleRenaming' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
Cabal> Warning: 'BuildInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   25% (  1 /  4) in 'Distribution.Types.ComponentLocalBuildInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:122)
Cabal>     maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:126)
Cabal>    0% (  0 /  2) in 'Distribution.Types.DumpBuildInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
Cabal> Warning: 'GivenComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/GivenComponent.hs:20:23
Cabal>     * at src/Distribution/Types/GivenComponent.hs:20:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/GivenComponent.hs:20:1
Cabal>   50% (  1 /  2) in 'Distribution.Types.GivenComponent'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>  100% (  5 /  5) in 'Distribution.Types.PackageName.Magic'
Cabal>   80% (  4 /  5) in 'Distribution.Types.ParStrat'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'TargetInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:19
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
Cabal> Warning: 'LocalBuildInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Types.TargetInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>  100% (  8 /  8) in 'Distribution.Utils.IOData'
Cabal> Warning: 'ByteString' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   75% (  3 /  4) in 'Distribution.Utils.Json'
Cabal>   Missing documentation for:
Cabal>     Json (src/Distribution/Utils/Json.hs:20)
Cabal> Warning: 'mapAccumL' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Utils.MapAccum'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>  100% (  5 /  5) in 'Distribution.Utils.Progress'
Cabal> Warning: 'Point' is ambiguous. It is defined
Cabal>     * at src/Distribution/Utils/UnionFind.hs:23:21
Cabal>     * at src/Distribution/Utils/UnionFind.hs:23:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Utils/UnionFind.hs:23:1
Cabal>    0% (  0 /  3) in 'Distribution.Verbosity.Internal'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
Cabal>     VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
Cabal> Warning: 'Verbosity' is ambiguous. It is defined
Cabal>     * at src/Distribution/Verbosity.hs:90:18
Cabal>     * at src/Distribution/Verbosity.hs:90:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Verbosity.hs:90:1
Cabal> Warning: 'stderr' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'stdout' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   87% ( 35 / 40) in 'Distribution.Verbosity'
Cabal>   Missing documentation for:
Cabal>     Verbosity (src/Distribution/Verbosity.hs:90)
Cabal>     flagToVerbosity (src/Distribution/Verbosity.hs:241)
Cabal>     showForCabal (src/Distribution/Verbosity.hs:244)
Cabal>     showForGHC (src/Distribution/Verbosity.hs:267)
Cabal>     verboseHasFlags (src/Distribution/Verbosity.hs:335)
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal> Warning: 'ConfiguredProgram' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:26
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
Cabal> Warning: 'simpleProgram' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'findProgramOnSearchPath' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'findExecutable' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
Cabal>   Missing documentation for:
Cabal>     ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
Cabal>     ProgArg (src/Distribution/Simple/Program/Types.hs:83)
Cabal> Warning: 'PreProcessor' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:21
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal>   60% (  3 /  5) in 'Distribution.Simple.PreProcess.Types'
Cabal>   Missing documentation for:
Cabal>     builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
Cabal>     builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
Cabal>    0% (  0 /  5) in 'Distribution.Simple.Errors'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     CabalException (src/Distribution/Simple/Errors.hs:46)
Cabal>     FailedDependency (src/Distribution/Simple/Errors.hs:39)
Cabal>     exceptionCode (src/Distribution/Simple/Errors.hs:179)
Cabal>     exceptionMessage (src/Distribution/Simple/Errors.hs:315)
Cabal>  100% (  3 /  3) in 'Distribution.Simple.PreProcess.Unlit'
Cabal> Warning: 'ModuleShape' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:20
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal> Warning: 'ModuleScope' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:20
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal> Warning: 'ModuleSubst' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'UnifyM' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:83:22
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:83:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:83:1
Cabal> Warning: 'Module' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Module’
Cabal>     * in ‘Distribution.Types.Module’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Module’
Cabal> Warning: 'ModuleU' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:256:5
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:265:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:265:1
Cabal> Warning: 'UnitIdU' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:261:5
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:268:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:268:1
Cabal> Warning: 'createDirectoryIfMissing' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'findModuleFile' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'CreatePipe' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'rawSystem' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'action' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ByteString' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'TempFileOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Utils.hs:1632:24
Cabal>     * at src/Distribution/Simple/Utils.hs:1632:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Utils.hs:1632:1
Cabal> Warning: 'waitForProcess' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   85% (122 /142) in 'Distribution.Simple.Utils'
Cabal>   Missing documentation for:
Cabal>     cabalVersion (src/Distribution/Simple/Utils.hs:285)
Cabal>     dieNoVerbosity (src/Distribution/Simple/Utils.hs:346)
Cabal>     die' (src/Distribution/Simple/Utils.hs:376)
Cabal>     dieWithException (src/Distribution/Simple/Utils.hs:389)
Cabal>     dieWithLocation' (src/Distribution/Simple/Utils.hs:365)
Cabal>     dieNoWrap (src/Distribution/Simple/Utils.hs:408)
Cabal>     topHandler (src/Distribution/Simple/Utils.hs:515)
Cabal>     topHandlerWith (src/Distribution/Simple/Utils.hs:464)
Cabal>     infoNoWrap (src/Distribution/Simple/Utils.hs:603)
Cabal>     VerboseException (src/Distribution/Simple/Utils.hs:384)
Cabal>     setFileOrdinary (src/Distribution/Compat/CopyFile.hs:77)
Cabal>     setFileExecutable (src/Distribution/Compat/CopyFile.hs:78)
Cabal>     shortRelativePath (src/Distribution/Simple/Utils.hs:1747)
Cabal>     findFirstFile (src/Distribution/Simple/Utils.hs:1301)
Cabal>     findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1277)
Cabal>     addLibraryPath (src/Distribution/Simple/Utils.hs:1397)
Cabal>     defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1638)
Cabal>     createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:124)
Cabal>     equating
Cabal>     unintersperse
Cabal> Warning: 'NubList' is ambiguous. It is defined
Cabal>     * at src/Distribution/Utils/NubList.hs:24:21
Cabal>     * at src/Distribution/Utils/NubList.hs:24:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Utils/NubList.hs:24:1
Cabal>   66% (  6 /  9) in 'Distribution.Utils.NubList'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     fromNubList
Cabal>     fromNubListR
Cabal> Warning: 'LogProgress' is ambiguous. It is defined
Cabal>     * at src/Distribution/Utils/LogProgress.hs:33:25
Cabal>     * at src/Distribution/Utils/LogProgress.hs:33:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Utils/LogProgress.hs:33:1
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   85% (  6 /  7) in 'Distribution.Utils.LogProgress'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   30% (  4 / 13) in 'Distribution.Simple.Program.Run'
Cabal>   Missing documentation for:
Cabal>     IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
Cabal>     emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
Cabal>     simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
Cabal>     programInvocation (src/Distribution/Simple/Program/Run.hs:90)
Cabal>     runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
Cabal>     getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
Cabal>     getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
Cabal>     getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:177)
Cabal>     getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:189)
Cabal>  100% (  4 /  4) in 'Distribution.Simple.Program.Script'
Cabal>   50% (  1 /  2) in 'Distribution.Simple.Program.ResponseFile'
Cabal>   Missing documentation for:
Cabal>     withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:37)
Cabal>   66% (  2 /  3) in 'Distribution.Simple.Program.Hpc'
Cabal>   Missing documentation for:
Cabal>     union (src/Distribution/Simple/Program/Hpc.hs:115)
Cabal>   63% (  7 / 11) in 'Distribution.Simple.Program.Find'
Cabal>   Missing documentation for:
Cabal>     ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
Cabal>     defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
Cabal>     findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
Cabal>     logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:72)
Cabal> Warning: 'UnitIndex' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageIndex' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PackageIndex.hs:127:23
Cabal>     * at src/Distribution/Simple/PackageIndex.hs:127:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PackageIndex.hs:127:1
Cabal> Warning: 'InstalledPackageInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Cabal' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageDB' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
Cabal>   Missing documentation for:
Cabal>     SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
Cabal>     topologicalOrder (src/Distribution/Simple/PackageIndex.hs:667)
Cabal>     reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:675)
Cabal>   50% (  3 /  6) in 'Distribution.Simple.PackageDescription'
Cabal>   Missing documentation for:
Cabal>     readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:45)
Cabal>     readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:48)
Cabal>     parseString (src/Distribution/Simple/PackageDescription.hs:81)
Cabal> Warning: 'Version' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'matchDirFileGlob' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
Cabal>   Missing documentation for:
Cabal>     parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
Cabal>     enableMultidot (src/Distribution/Simple/Glob/Internal.hs:178)
Cabal>     dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:234)
Cabal>     isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:252)
Cabal>     GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
Cabal>     explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
Cabal>     GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
Cabal> Warning: 'die'' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Version' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   75% ( 12 / 16) in 'Distribution.Simple.Glob'
Cabal>   Missing documentation for:
Cabal>     GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
Cabal>     parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
Cabal>     GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
Cabal>     explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
Cabal> Warning: 'ask' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'm' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'CheckCtx' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:109:19
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:109:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:109:1
Cabal> Warning: 'local' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'CheckPackageContentOps' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal> Warning: 'TargetAnnotation' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:160:27
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:160:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:160:1
Cabal> Warning: 'TaraAnn' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'LocalBuildInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   68% ( 33 / 48) in 'Distribution.Simple.Compiler'
Cabal>   Missing documentation for:
Cabal>     Compiler (src/Distribution/Simple/Compiler.hs:91)
Cabal>     showCompilerId (src/Distribution/Simple/Compiler.hs:113)
Cabal>     showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:116)
Cabal>     compilerFlavor (src/Distribution/Simple/Compiler.hs:123)
Cabal>     compilerVersion (src/Distribution/Simple/Compiler.hs:126)
Cabal>     compilerInfo (src/Distribution/Simple/Compiler.hs:155)
Cabal>     absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:213)
Cabal>     flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:237)
Cabal>     flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:270)
Cabal>     CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
Cabal>     languageToFlags (src/Distribution/Simple/Compiler.hs:295)
Cabal>     unsupportedLanguages (src/Distribution/Simple/Compiler.hs:290)
Cabal>     knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:476)
Cabal>     flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:464)
Cabal>     showProfDetailLevel (src/Distribution/Simple/Compiler.hs:486)
Cabal>   65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
Cabal>   Missing documentation for:
Cabal>     initInvocation (src/Distribution/Simple/Program/HcPkg.hs:387)
Cabal>     registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:401)
Cabal>     unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:429)
Cabal>     recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:439)
Cabal>     exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:450)
Cabal>     hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:473)
Cabal>     dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:479)
Cabal>     describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:461)
Cabal>     listInvocation (src/Distribution/Simple/Program/HcPkg.hs:492)
Cabal> Warning: 'OpenModule' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Backpack’
Cabal>     * in ‘Distribution.Backpack’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Backpack’
Cabal>   18% (  2 / 11) in 'Distribution.Simple.Program.GHC'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
Cabal>     GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
Cabal>     GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
Cabal>     GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
Cabal>     ghcInvocation (src/Distribution/Simple/Program/GHC.hs:648)
Cabal>     renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:659)
Cabal>     runGHC (src/Distribution/Simple/Program/GHC.hs:638)
Cabal>     normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:49)
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>   12% (  4 / 31) in 'Distribution.Simple.Program.Builtin'
Cabal>   Missing documentation for:
Cabal>     ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
Cabal>     ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
Cabal>     runghcProgram (src/Distribution/Simple/Program/Builtin.hs:135)
Cabal>     ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
Cabal>     ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
Cabal>     hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
Cabal>     jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
Cabal>     haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:228)
Cabal>     haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:239)
Cabal>     uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
Cabal>     gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
Cabal>     arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
Cabal>     stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
Cabal>     happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
Cabal>     alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
Cabal>     hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
Cabal>     c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
Cabal>     cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
Cabal>     hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
Cabal>     doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
Cabal>     haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
Cabal>     greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
Cabal>     ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
Cabal>     tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
Cabal>     cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
Cabal>     pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
Cabal>     hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
Cabal> Warning: 'ProgramDb' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Db.hs:95:18
Cabal>     * at src/Distribution/Simple/Program/Db.hs:95:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Db.hs:95:1
Cabal> Warning: 'AnyVersion' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Programs' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>   82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
Cabal>   Missing documentation for:
Cabal>     emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
Cabal>     defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
Cabal>     addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
Cabal>     lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
Cabal>     knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
Cabal>     userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal> Warning: 'ConfiguredProgram' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:26
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
Cabal>   50% ( 40 / 80) in 'Distribution.Simple.Program'
Cabal>   Missing documentation for:
Cabal>     ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
Cabal>     findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
Cabal>     defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
Cabal>     ProgArg (src/Distribution/Simple/Program/Types.hs:83)
Cabal>     emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
Cabal>     simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
Cabal>     programInvocation (src/Distribution/Simple/Program/Run.hs:90)
Cabal>     runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
Cabal>     getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
Cabal>     getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
Cabal>     defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
Cabal>     emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
Cabal>     addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
Cabal>     lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
Cabal>     knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
Cabal>     userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
Cabal>     ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
Cabal>     ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
Cabal>     ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
Cabal>     ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
Cabal>     hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
Cabal>     jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
Cabal>     uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
Cabal>     gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
Cabal>     arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
Cabal>     stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
Cabal>     happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
Cabal>     alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
Cabal>     hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
Cabal>     c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
Cabal>     cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
Cabal>     hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
Cabal>     doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
Cabal>     haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
Cabal>     greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
Cabal>     ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
Cabal>     tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
Cabal>     cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
Cabal>     pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
Cabal>     hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
Cabal>   33% (  1 /  3) in 'Distribution.Simple.Program.Strip'
Cabal>   Missing documentation for:
Cabal>     stripLib (src/Distribution/Simple/Program/Strip.hs:52)
Cabal>     stripExe (src/Distribution/Simple/Program/Strip.hs:41)
Cabal> Warning: 'CommandUI' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Command.hs:97:24
Cabal>     * at src/Distribution/Simple/Command.hs:97:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Command.hs:97:1
Cabal> Warning: 'GetOpt' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'smart' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   61% ( 33 / 54) in 'Distribution.Simple.Command'
Cabal>   Missing documentation for:
Cabal>     CommandUI (src/Distribution/Simple/Command.hs:97)
Cabal>     CommandParse (src/Distribution/Simple/Command.hs:596)
Cabal>     helpCommandUI (src/Distribution/Simple/Command.hs:764)
Cabal>     ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
Cabal>     Command (src/Distribution/Simple/Command.hs:608)
Cabal>     commandAddAction (src/Distribution/Simple/Command.hs:621)
Cabal>     CommandType (src/Distribution/Simple/Command.hs:607)
Cabal>     commandFromSpec (src/Distribution/Simple/Command.hs:788)
Cabal>     commandsRun (src/Distribution/Simple/Command.hs:659)
Cabal>     commandsRunWithFallback (src/Distribution/Simple/Command.hs:675)
Cabal>     defaultCommandFallback (src/Distribution/Simple/Command.hs:667)
Cabal>     Name (src/Distribution/Simple/Command.hs:117)
Cabal>     liftOption (src/Distribution/Simple/Command.hs:374)
Cabal>     Description (src/Distribution/Simple/Command.hs:118)
Cabal>     OptFlags (src/Distribution/Simple/Command.hs:160)
Cabal>     ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
Cabal>     MkOptDescr (src/Distribution/Simple/Command.hs:200)
Cabal>     optArgDef' (src/Distribution/Simple/Command.hs:275)
Cabal>     noArg (src/Distribution/Simple/Command.hs:279)
Cabal>     boolOpt (src/Distribution/Simple/Command.hs:287)
Cabal>     boolOpt' (src/Distribution/Simple/Command.hs:299)
Cabal> Warning: 'progDb' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'OptionField' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Command.hs:125:22
Cabal>     * at src/Distribution/Simple/Command.hs:125:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Command.hs:125:1
Cabal> Warning: 'haddocksInterfaces' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'haddocksAction' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'BuildOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:148:21
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:148:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:148:1
Cabal> Warning: 'InstalledPackageInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'LocalBuildConfig' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:134:25
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:134:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:134:1
Cabal> Warning: 'PackageBuildDescr' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:48:26
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:48:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:48:1
Cabal>   77% (  7 /  9) in 'Distribution.Types.LocalBuildConfig'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:202)
Cabal> Warning: 'TargetInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:19
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'PackageIdentifier' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageId’
Cabal>     * in ‘Distribution.Types.PackageId’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageId’
Cabal> Warning: 'LocalBuildDescr' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'LocalBuildConfig' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Component' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
Cabal>     buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:281)
Cabal>     configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:285)
Cabal>     cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
Cabal>     progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
Cabal>     progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
Cabal>     unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:360)
Cabal>     componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:420)
Cabal>     unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:423)
Cabal>     allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:426)
Cabal>     withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:429)
Cabal>     neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:432)
Cabal>     withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:435)
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'Library' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Library’
Cabal>     * in ‘Distribution.Types.Library’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Library’
Cabal> Warning: 'Executable' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Executable’
Cabal> Warning: 'compBuildOrder' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Benchmark' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Benchmark’
Cabal>   49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
Cabal>   Missing documentation for:
Cabal>     buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
Cabal>     cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
Cabal>     progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
Cabal>     progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
Cabal>     Component
Cabal>     ComponentName
Cabal>     LibraryName
Cabal>     defaultLibName
Cabal>     showComponentName
Cabal>     componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:115)
Cabal>     foldComponent
Cabal>     componentName
Cabal>     componentBuildInfo
Cabal>     lookupComponent
Cabal>     getComponent
Cabal>     allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:211)
Cabal>     withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:173)
Cabal>     enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:180)
Cabal>     enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:190)
Cabal>     abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
Cabal>     combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
Cabal>     combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
Cabal>     compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
Cabal>     defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
Cabal>     defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
Cabal>     installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
Cabal>     packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
Cabal>     platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
Cabal>     PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
Cabal>     PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
Cabal>     absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:378)
Cabal>     substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:436)
Cabal> Warning: 'PackageLog' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Test/Log.hs:40:19
Cabal>     * at src/Distribution/Simple/Test/Log.hs:40:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:40:1
Cabal> Warning: 'TestSuiteLog' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:21
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>   71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     TestLogs (src/Distribution/Simple/Test/Log.hs:66)
Cabal>     summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:193)
Cabal>     testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:127)
Cabal>   55% (  5 /  9) in 'Distribution.Simple.Hpc'
Cabal>   Missing documentation for:
Cabal>     Way (src/Distribution/Simple/Hpc.hs:55)
Cabal>     htmlDir (src/Distribution/Simple/Hpc.hs:104)
Cabal>     mixDir (src/Distribution/Simple/Hpc.hs:77)
Cabal>     tixDir (src/Distribution/Simple/Hpc.hs:85)
Cabal>   50% (  1 /  2) in 'Distribution.Simple.Build.PackageInfoModule'
Cabal>   Missing documentation for:
Cabal>     generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:37)
Cabal>  100% (  3 /  3) in 'Distribution.Simple.Build.Macros'
Cabal> Warning: 'computeCompatPackageName' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ConfiguredComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal>   54% (  6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
Cabal>   Missing documentation for:
Cabal>     toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:179)
Cabal>     toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:317)
Cabal>     ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
Cabal>     extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:292)
Cabal>     newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:350)
Cabal> Warning: 'LinkedComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:24
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal> Warning: 'ModSubst' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ConfiguredComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal> Warning: 'ReadyComponent' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ModuleRenaming' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
Cabal> Warning: 'IncludeRenaming' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.IncludeRenaming’
Cabal>     * in ‘Distribution.Types.IncludeRenaming’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.IncludeRenaming’
Cabal>   54% (  6 / 11) in 'Distribution.Backpack.LinkedComponent'
Cabal>   Missing documentation for:
Cabal>     toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:123)
Cabal>     toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:417)
Cabal>     dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:99)
Cabal>     LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
Cabal>     extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:436)
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal>  100% (  7 /  7) in 'Distribution.Backpack.ComponentsGraph'
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Program.Ld'
Cabal>  100% (  3 /  3) in 'Distribution.Simple.Program.Ar'
Cabal> Warning: 'CommandUI' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Monoid' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   25% ( 26 /102) in 'Distribution.Simple.Setup'
Cabal>   Missing documentation for:
Cabal>     emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:115)
Cabal>     defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:54)
Cabal>     globalCommand (src/Distribution/Simple/Setup/Global.hs:61)
Cabal>     emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1024)
Cabal>     defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:310)
Cabal>     configureCommand (src/Distribution/Simple/Setup/Config.hs:356)
Cabal>     configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:302)
Cabal>     readPackageDbList (src/Distribution/Simple/Setup/Config.hs:869)
Cabal>     showPackageDbList (src/Distribution/Simple/Setup/Config.hs:881)
Cabal>     emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:146)
Cabal>     defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:62)
Cabal>     copyCommand (src/Distribution/Simple/Setup/Copy.hs:72)
Cabal>     emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:151)
Cabal>     defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:61)
Cabal>     installCommand (src/Distribution/Simple/Setup/Install.hs:73)
Cabal>     HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
Cabal>     emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:357)
Cabal>     defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:116)
Cabal>     haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:146)
Cabal>     HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
Cabal>     emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:599)
Cabal>     defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:422)
Cabal>     haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:446)
Cabal>     HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
Cabal>     emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:58)
Cabal>     defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:61)
Cabal>     hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:81)
Cabal>     BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
Cabal>     emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:158)
Cabal>     defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:65)
Cabal>     buildCommand (src/Distribution/Simple/Setup/Build.hs:78)
Cabal>     DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
Cabal>     ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
Cabal>     defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:77)
Cabal>     replCommand (src/Distribution/Simple/Setup/Repl.hs:95)
Cabal>     ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
Cabal>     CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
Cabal>     emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:90)
Cabal>     defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:54)
Cabal>     cleanCommand (src/Distribution/Simple/Setup/Clean.hs:63)
Cabal>     emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:188)
Cabal>     defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:61)
Cabal>     registerCommand (src/Distribution/Simple/Setup/Register.hs:75)
Cabal>     unregisterCommand (src/Distribution/Simple/Setup/Register.hs:142)
Cabal>     emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:106)
Cabal>     defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:53)
Cabal>     sdistCommand (src/Distribution/Simple/Setup/SDist.hs:63)
Cabal>     TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
Cabal>     emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:247)
Cabal>     defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:100)
Cabal>     testCommand (src/Distribution/Simple/Setup/Test.hs:114)
Cabal>     TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
Cabal>     BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
Cabal>     emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:124)
Cabal>     defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:56)
Cabal>     benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:64)
Cabal>     configureOptions (src/Distribution/Simple/Setup/Config.hs:403)
Cabal>     configureCCompiler (src/Distribution/Simple/Setup/Common.hs:327)
Cabal>     configureLinker (src/Distribution/Simple/Setup/Common.hs:330)
Cabal>     buildOptions (src/Distribution/Simple/Setup/Build.hs:129)
Cabal>     haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:184)
Cabal>     haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:484)
Cabal>     installDirsOptions (src/Distribution/Simple/Setup/Config.hs:920)
Cabal>     testOptions' (src/Distribution/Simple/Setup/Test.hs:134)
Cabal>     benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:84)
Cabal>     programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:105)
Cabal>     replOptions (src/Distribution/Simple/Setup/Repl.hs:183)
Cabal>     defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
Cabal>     optionDistPref (src/Distribution/Simple/Setup/Common.hs:255)
Cabal>     boolOpt (src/Distribution/Simple/Setup/Common.hs:228)
Cabal>     boolOpt' (src/Distribution/Simple/Setup/Common.hs:234)
Cabal>     trueArg (src/Distribution/Simple/Setup/Common.hs:237)
Cabal>     falseArg (src/Distribution/Simple/Setup/Common.hs:238)
Cabal>     optionVerbosity (src/Distribution/Simple/Setup/Common.hs:275)
Cabal>     buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
Cabal>     buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'Compiler' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:17
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
Cabal> Warning: 'Library' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
Cabal>     buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'TargetInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:19
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
Cabal> Warning: 'matchExactly' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ambiguousWith' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'shadows' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
Cabal>   Missing documentation for:
Cabal>     QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
Cabal>     buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:136)
Cabal>     readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:183)
Cabal>     showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:255)
Cabal>     UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
Cabal>     reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:247)
Cabal>     BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
Cabal>     reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:397)
Cabal> Warning: 'lib' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'C' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
Cabal>   Missing documentation for:
Cabal>     defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
Cabal>     srcPref (src/Distribution/Simple/BuildPaths.hs:74)
Cabal>     hscolourPref (src/Distribution/Simple/BuildPaths.hs:77)
Cabal>     cppHeaderName (src/Distribution/Simple/BuildPaths.hs:108)
Cabal>     haddockName (src/Distribution/Simple/BuildPaths.hs:129)
Cabal>     mkLibName (src/Distribution/Simple/BuildPaths.hs:220)
Cabal>     mkProfLibName (src/Distribution/Simple/BuildPaths.hs:223)
Cabal>     mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:238)
Cabal>     mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:244)
Cabal>     getSourceFiles (src/Distribution/Simple/BuildPaths.hs:191)
Cabal>     getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:140)
Cabal>     getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:157)
Cabal>     getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:176)
Cabal>   12% (  1 /  8) in 'Distribution.Simple.UHC'
Cabal>   Missing documentation for:
Cabal>     configure (src/Distribution/Simple/UHC.hs:64)
Cabal>     getInstalledPackages (src/Distribution/Simple/UHC.hs:118)
Cabal>     buildLib (src/Distribution/Simple/UHC.hs:208)
Cabal>     buildExe (src/Distribution/Simple/UHC.hs:242)
Cabal>     installLib (src/Distribution/Simple/UHC.hs:324)
Cabal>     registerPackage (src/Distribution/Simple/UHC.hs:350)
Cabal>     inplacePackageDbPath (src/Distribution/Simple/UHC.hs:365)
Cabal>    0% (  0 / 13) in 'Distribution.Simple.HaskellSuite'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     configure (src/Distribution/Simple/HaskellSuite.hs:36)
Cabal>     hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:93)
Cabal>     numericVersion (src/Distribution/Simple/HaskellSuite.hs:96)
Cabal>     getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:99)
Cabal>     getExtensions (src/Distribution/Simple/HaskellSuite.hs:113)
Cabal>     getLanguages (src/Distribution/Simple/HaskellSuite.hs:121)
Cabal>     getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:135)
Cabal>     buildLib (src/Distribution/Simple/HaskellSuite.hs:173)
Cabal>     installLib (src/Distribution/Simple/HaskellSuite.hs:224)
Cabal>     registerPackage (src/Distribution/Simple/HaskellSuite.hs:245)
Cabal>     initPackageDB (src/Distribution/Simple/HaskellSuite.hs:257)
Cabal>     packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:265)
Cabal> Warning: 'Arch' is ambiguous. It is defined
Cabal>     * in ‘Distribution.System’
Cabal>     * in ‘Distribution.Types.ConfVar’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.System’
Cabal> Warning: 'OS' is ambiguous. It is defined
Cabal>     * in ‘Distribution.System’
Cabal>     * in ‘Distribution.Types.ConfVar’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.System’
Cabal> Warning: 'Platform' is ambiguous. It is defined
Cabal>     * in ‘Distribution.System’
Cabal>     * in ‘Distribution.System’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.System’
Cabal> Warning: 'hsLibraries' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'BuildSources' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/GHCJS.hs:1105:21
Cabal>     * at src/Distribution/Simple/GHCJS.hs:1105:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/GHCJS.hs:1105:1
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal>   52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     getGhcInfo (src/Distribution/Simple/GHCJS.hs:308)
Cabal>     configure (src/Distribution/Simple/GHCJS.hs:117)
Cabal>     buildLib (src/Distribution/Simple/GHCJS.hs:463)
Cabal>     replLib (src/Distribution/Simple/GHCJS.hs:474)
Cabal>     replFLib (src/Distribution/Simple/GHCJS.hs:891)
Cabal>     replExe (src/Distribution/Simple/GHCJS.hs:914)
Cabal>     hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1968)
Cabal>     registerPackage (src/Distribution/Simple/GHCJS.hs:1992)
Cabal>     componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1780)
Cabal>     componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
Cabal>     getLibDir (src/Distribution/Simple/GHCJS.hs:355)
Cabal>     isDynamic (src/Distribution/Simple/GHCJS.hs:1948)
Cabal>     pkgRoot (src/Distribution/Simple/GHCJS.hs:2001)
Cabal>     readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
Cabal>     parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
Cabal>     ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
Cabal>     getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
Cabal> Warning: 'Executable' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Executable’
Cabal> Warning: 'TestSuite' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.TestSuite’
Cabal> Warning: 'Benchmark' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Benchmark’
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'GhcOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:19
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal> Warning: 'PreBuildComponentRules' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'GhcOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:19
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal> Warning: 'Executable' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Executable’
Cabal> Warning: 'hsLibraries' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'Compiler' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:17
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
Cabal>   55% ( 21 / 38) in 'Distribution.Simple.GHC'
Cabal>   Missing documentation for:
Cabal>     getGhcInfo (src/Distribution/Simple/GHC.hs:387)
Cabal>     configure (src/Distribution/Simple/GHC.hs:155)
Cabal>     getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:545)
Cabal>     buildLib (src/Distribution/Simple/GHC.hs:578)
Cabal>     replLib (src/Distribution/Simple/GHC.hs:590)
Cabal>     replFLib (src/Distribution/Simple/GHC.hs:636)
Cabal>     replExe (src/Distribution/Simple/GHC.hs:661)
Cabal>     hcPkgInfo (src/Distribution/Simple/GHC.hs:960)
Cabal>     registerPackage (src/Distribution/Simple/GHC.hs:984)
Cabal>     componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:522)
Cabal>     componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
Cabal>     getLibDir (src/Distribution/Simple/GHC.hs:451)
Cabal>     pkgRoot (src/Distribution/Simple/GHC.hs:993)
Cabal>     readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
Cabal>     parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
Cabal>     ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
Cabal>     getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
Cabal>   60% (  3 /  5) in 'Distribution.Simple.ShowBuildInfo'
Cabal>   Missing documentation for:
Cabal>     mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:134)
Cabal>     mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:142)
Cabal> Warning: 'register' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Install'
Cabal>   66% (  2 /  3) in 'Distribution.Simple.Build.PathsModule'
Cabal>   Missing documentation for:
Cabal>     generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:42)
Cabal> Warning: 'TestSuite' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'TestSuiteLog' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:21
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
Cabal> Warning: 'Test' is ambiguous. It is defined
Cabal>     * at src/Distribution/TestSuite.hs:79:5
Cabal>     * at src/Distribution/TestSuite.hs:78:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/TestSuite.hs:78:1
Cabal>   75% (  6 /  8) in 'Distribution.Simple.Test.LibV09'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     runTest (src/Distribution/Simple/Test/LibV09.hs:65)
Cabal>    0% (  0 /  2) in 'Distribution.Simple.Test.ExeV10'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     runTest (src/Distribution/Simple/Test/ExeV10.hs:59)
Cabal> Warning: 'dist' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'CheckPackageContentOps' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.GenericPackageDescription’
Cabal>     * in ‘Distribution.Types.GenericPackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.GenericPackageDescription’
Cabal>   89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
Cabal>   Missing documentation for:
Cabal>     CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
Cabal>     ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:597)
Cabal>   66% (  4 /  6) in 'Distribution.Make'
Cabal>   Missing documentation for:
Cabal>     defaultMain (src/Distribution/Make.hs:85)
Cabal>     defaultMainArgs (src/Distribution/Make.hs:88)
Cabal> Warning: 'sleepFileTimeCalibrate' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ModTime' is ambiguous. It is defined
Cabal>     * at src/Distribution/Compat/Time.hs:60:19
Cabal>     * at src/Distribution/Compat/Time.hs:60:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Compat/Time.hs:60:1
Cabal>   85% (  6 /  7) in 'Distribution.Compat.Time'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'ReadyComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:55:23
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:55:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:55:1
Cabal> Warning: 'InstalledPackageInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'LinkedComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:24
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal> Warning: 'improveUnitId' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'HashedUnitId' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'IndefiniteComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:110:28
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:110:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:110:1
Cabal> Warning: 'InstantiatedComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:93:30
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:93:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:93:1
Cabal> Warning: 'componentPackageDeps' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'OpenModule' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Backpack’
Cabal>     * in ‘Distribution.Backpack’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Backpack’
Cabal> Warning: 'InstM' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:205:19
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:205:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:205:1
Cabal> Warning: 'MungedPackageId' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.MungedPackageId’
Cabal>     * in ‘Distribution.Types.MungedPackageId’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.MungedPackageId’
Cabal>   50% (  1 /  2) in 'Distribution.Backpack.Configure'
Cabal>   Missing documentation for:
Cabal>     configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:79)
Cabal> Warning: 'OpenModule' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Module' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Backpack.DescribeUnitId'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   52% (  9 / 17) in 'Distribution.Simple.Register'
Cabal>   Missing documentation for:
Cabal>     register (src/Distribution/Simple/Register.hs:99)
Cabal>     unregister (src/Distribution/Simple/Register.hs:703)
Cabal>     internalPackageDBPath (src/Distribution/Simple/Register.hs:738)
Cabal>     initPackageDB (src/Distribution/Simple/Register.hs:355)
Cabal>     doesPackageDBExist (src/Distribution/Simple/Register.hs:375)
Cabal>     deletePackageDB (src/Distribution/Simple/Register.hs:383)
Cabal>     registerPackage (src/Distribution/Simple/Register.hs:430)
Cabal>     generateRegistrationInfo (src/Distribution/Simple/Register.hs:261)
Cabal> Warning: 'PreProcessor' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:21
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal> Warning: 'Suffix' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:101:18
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:101:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:101:1
Cabal>   40% (  9 / 22) in 'Distribution.Simple.PreProcess'
Cabal>   Missing documentation for:
Cabal>     builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
Cabal>     builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
Cabal>     mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:109)
Cabal>     runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:124)
Cabal>     ppCpp (src/Distribution/Simple/PreProcess.hs:407)
Cabal>     ppCpp' (src/Distribution/Simple/PreProcess.hs:410)
Cabal>     ppGreenCard (src/Distribution/Simple/PreProcess.hs:382)
Cabal>     ppC2hs (src/Distribution/Simple/PreProcess.hs:651)
Cabal>     ppHsc2hs (src/Distribution/Simple/PreProcess.hs:476)
Cabal>     ppHappy (src/Distribution/Simple/PreProcess.hs:813)
Cabal>     ppAlex (src/Distribution/Simple/PreProcess.hs:822)
Cabal>     ppUnlit (src/Distribution/Simple/PreProcess.hs:397)
Cabal>     platformDefines (src/Distribution/Simple/PreProcess.hs:720)
Cabal> Warning: 'UserHooks' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:18
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>   75% (  3 /  4) in 'Distribution.Simple.UserHooks'
Cabal>   Missing documentation for:
Cabal>     Args (src/Distribution/Simple/UserHooks.hs:45)
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Bench'
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'ConfigFlags' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Setup/Config.hs:78:20
Cabal>     * at src/Distribution/Simple/Setup/Config.hs:78:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Setup/Config.hs:78:1
Cabal> Warning: 'UserHooks' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Compiler' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:17
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
Cabal>   85% ( 23 / 27) in 'Distribution.Simple.Configure'
Cabal>   Missing documentation for:
Cabal>     configCompilerEx (src/Distribution/Simple/Configure.hs:2274)
Cabal>     configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2258)
Cabal>     checkForeignDeps (src/Distribution/Simple/Configure.hs:2293)
Cabal>     platformDefines (src/Distribution/Simple/PreProcess.hs:720)
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Test'
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'errorPrefix' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
Cabal> Warning: 'autogenComponentsModuleDir' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Benchmark' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Benchmark’
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'TestSuite' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.TestSuite’
Cabal>   88% ( 15 / 17) in 'Distribution.Simple.Build'
Cabal>   Missing documentation for:
Cabal>     repl (src/Distribution/Simple/Build.hs:278)
Cabal>     AutogenFile (src/Distribution/Simple/Build.hs:1078)
Cabal> Warning: 'Haddock' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'HaddocksFlags' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'haddocks' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   66% (  4 /  6) in 'Distribution.Simple.Haddock'
Cabal>   Missing documentation for:
Cabal>     haddock (src/Distribution/Simple/Haddock.hs:213)
Cabal>     hscolour (src/Distribution/Simple/Haddock.hs:1125)
Cabal> Warning: 'UserHooks' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:18
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>   95% ( 20 / 21) in 'Distribution.Simple'
Cabal>   Missing documentation for:
Cabal>     Args (src/Distribution/Simple/UserHooks.hs:45)
Cabal> Warning: Distribution.Backpack.FullUnitId: could not find link destinations for:
Cabal>  - Distribution.Backpack.FullUnitId.Rep_FullUnitId
Cabal> Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Backpack.ModuleShape.Rep_ModuleShape
Cabal> Warning: Distribution.Backpack.PreModuleShape: could not find link destinations for:
Cabal>  - Distribution.Backpack.PreModuleShape.Rep_PreModuleShape
Cabal> Warning: Distribution.Compat.Stack: could not find link destinations for:
Cabal>  - GHC.Internal.IsList.D:R:ItemCallStack
Cabal> Warning: Distribution.ReadE: could not find link destinations for:
Cabal>  - Distribution.ReadE.ErrorMsg
Cabal> Warning: Distribution.Simple.Flag: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Flag.Rep_Flag
Cabal> Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathComponent
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
Cabal> Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
Cabal>  - Distribution.Simple.InstallDirs.Rep_CopyDest
Cabal>  - Distribution.Simple.InstallDirs.Rep_InstallDirs
Cabal>  - Distribution.Simple.InstallDirs.Rep_PathTemplate
Cabal> Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
Cabal> Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
Cabal> Warning: Distribution.Types.GivenComponent: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.GivenComponent.Rep_GivenComponent
Cabal> Warning: Distribution.Types.TargetInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.TargetInfo.Rep_TargetInfo
Cabal>  - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
Cabal> Warning: Distribution.Verbosity.Internal: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Verbosity.Internal.Rep_VerbosityFlag
Cabal>  - Distribution.Verbosity.Internal.Rep_VerbosityLevel
Cabal> Warning: Distribution.Verbosity: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Verbosity.Rep_Verbosity
Cabal> Warning: Distribution.Simple.Program.Types: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramLocation
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
Cabal>  - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
Cabal> Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.PreProcess.Types.Rep_Suffix
Cabal> Warning: Distribution.Simple.Utils: could not find link destinations for:
Cabal>  - Distribution.Simple.Utils.withMetadata
Cabal> Warning: Distribution.Utils.NubList: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.NubList.Rep_NubList
Cabal> Warning: Distribution.Utils.LogProgress: could not find link destinations for:
Cabal>  - Distribution.Utils.LogProgress.CtxMsg
Cabal> Warning: Distribution.Simple.Program.Find: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
Cabal>  - Distribution.Simple.Program.Find.findExecutable
Cabal> Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.PackageIndex.Rep_PackageIndex
Cabal>  - Distribution.Simple.PackageIndex.DepUniqueKey
Cabal> Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Glob.Internal.Rep_GlobPiece
Cabal>  - Distribution.Simple.Glob.Internal.Rep_Glob
Cabal> Warning: Distribution.Simple.Glob: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Glob.Internal.Rep_Glob
Cabal> Warning: Distribution.Simple.Compiler: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Compiler.Rep_DebugInfoLevel
Cabal>  - Distribution.Simple.Compiler.Rep_OptimisationLevel
Cabal>  - Distribution.Simple.Compiler.Rep_PackageDB
Cabal>  - Distribution.Simple.Compiler.Rep_ProfDetailLevel
Cabal>  - Distribution.Simple.Compiler.Rep_Compiler
Cabal> Warning: Distribution.Simple.Program.GHC: could not find link destinations for:
Cabal>  - Distribution.Simple.Program.GHC.Rep_GhcOptions
Cabal> Warning: Distribution.Simple.Program.Db: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal> Warning: Distribution.Simple.Program: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramLocation
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
Cabal>  - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
Cabal> Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_BuildOptions
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_ComponentBuildDescr
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_LocalBuildConfig
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_LocalBuildDescr
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_PackageBuildDescr
Cabal> Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
Cabal> Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.LibraryName.Rep_LibraryName
Cabal>  - Distribution.Types.ComponentName.Rep_ComponentName
Cabal>  - Distribution.Types.ComponentName.NotLibComponentName
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
Cabal>  - Distribution.Simple.InstallDirs.Rep_CopyDest
Cabal>  - Distribution.Simple.InstallDirs.Rep_InstallDirs
Cabal>  - Distribution.Simple.InstallDirs.Rep_PathTemplate
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
Cabal>  - Distribution.Types.Component.Rep_Component
Cabal>  - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
Cabal> Warning: Distribution.Simple.Setup: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.Flag.Rep_Flag
Cabal>  - Distribution.Simple.InstallDirs.Rep_CopyDest
Cabal>  - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
Cabal>  - Distribution.Simple.Setup.Common.programDbPaths
Cabal>  - Distribution.Simple.Setup.Test.Rep_TestShowDetails
Cabal>  - Distribution.Simple.Setup.Test.Rep_TestFlags
Cabal>  - Distribution.Simple.Setup.SDist.Rep_SDistFlags
Cabal>  - Distribution.Simple.Setup.Repl.Rep_ReplFlags
Cabal>  - Distribution.Simple.Setup.Repl.Rep_ReplOptions
Cabal>  - Distribution.Simple.Setup.Register.Rep_RegisterFlags
Cabal>  - Distribution.Simple.Setup.Install.Rep_InstallFlags
Cabal>  - Distribution.Simple.Setup.Hscolour.Rep_HscolourFlags
Cabal>  - Distribution.Simple.Setup.Haddock.Rep_HaddockTarget
Cabal>  - Distribution.Simple.Setup.Haddock.Rep_HaddockFlags
Cabal>  - Distribution.Simple.Setup.Haddock.Rep_HaddockProjectFlags
Cabal>  - Distribution.Simple.Setup.Global.Rep_GlobalFlags
Cabal>  - Distribution.Simple.Setup.Copy.Rep_CopyFlags
Cabal>  - Distribution.Simple.Setup.Config.Rep_ConfigFlags
Cabal>  - Distribution.Simple.Setup.Clean.Rep_CleanFlags
Cabal>  - Distribution.Simple.Setup.Build.Rep_BuildFlags
Cabal>  - Distribution.Simple.Setup.Benchmark.Rep_BenchmarkFlags
Cabal>  - Distribution.Simple.Setup.Rep_BuildingWhat
Cabal> Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Types.TargetInfo.Rep_TargetInfo
Cabal>  - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
Cabal>  - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
Cabal>  - Distribution.Simple.Setup.Rep_BuildingWhat
Cabal> Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
Cabal>  - Distribution.Simple.BuildTarget.Rep_BuildTarget
Cabal> Warning: Distribution.PackageDescription.Check: could not find link destinations for:
Cabal>  - Distribution.PackageDescription.Check.Warning.CEType
Cabal>  - Distribution.PackageDescription.Check.Warning.WarnLang
Cabal> Warning: Distribution.Make: could not find link destinations for:
Cabal>  - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
Cabal>  - Distribution.Types.Version.Rep_Version
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.License.Rep_License
Cabal> Warning: Distribution.Compat.Time: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Compat.Time.Rep_ModTime
Cabal> Warning: Distribution.Backpack.Configure: could not find link destinations for:
Cabal>  - Distribution.Backpack.PreExistingComponent.PreExistingComponent
Cabal>  - Distribution.Backpack.PreExistingComponent.PromisedComponent
Cabal> Warning: Distribution.Simple.PreProcess: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Simple.PreProcess.Types.Rep_Suffix
Cabal> Documentation created: dist/doc/html/Cabal, dist/doc/html/Cabal/Cabal.txt
Cabal> Running phase: installPhase
Cabal> Installing library in /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/Cabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0
Cabal> Running phase: fixupPhase
Cabal> shrinking RPATHs of ELF executables and libraries in /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0
Cabal> shrinking /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSCabal-3.12.1.0-BYM9bGelzGP2Uy3BFxo8V0-ghc9.12.1.so
Cabal> checking for references to /build/ in /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0...
Cabal> patching script interpreter paths in /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0
Cabal> stripping (with command strip and flags -S -p) in  /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/lib
Cabal> shrinking RPATHs of ELF executables and libraries in /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc
Cabal> checking for references to /build/ in /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc...
Cabal> patching script interpreter paths in /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc
Cabal (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0 /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc
Cabal (post)> Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
Cabal (post)> 
Cabal (post)> Pushing /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc (33.53 MiB)
Cabal (post)> Pushing /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0 (121.40 MiB)
Cabal (post)> 
Cabal (post)> All done.
Cabal (post)> added 2 signatures
Cabal (post)> added 2 signatures
Cabal (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0 /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc
Cabal (post)> copying 2 paths...
Cabal (post)> copying path '/nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
Cabal (post)> copying path '/nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
Cabal (post)> copying 1 paths...
Cabal (post)> copying path '/nix/store/v6z49mmb26012avqkyq76n57pzxxjmnf-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
Cabal (post)> added 0 signatures
Cabal (post)> added 0 signatures
Cabal (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0 /nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc
Cabal (post)> copying 2 paths...
Cabal (post)> copying path '/nix/store/2ccfxs2l23j9bxbh2mf4nb0ckb5gzzmz-Cabal-3.12.1.0-doc' to 'ssh-ng://worker.nix-ci.com'...
Cabal (post)> copying path '/nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0' to 'ssh-ng://worker.nix-ci.com'...
Cabal (post)> copying 1 paths...
Cabal (post)> copying path '/nix/store/v6z49mmb26012avqkyq76n57pzxxjmnf-Cabal-3.12.1.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/axwv9wqbfa6jwps7m7yb8fqayv8jy6j1-cabal-doctest-1.0.11.drv'...
building '/nix/store/20h8qhwflzzqamva8bzd8k9hsmv3dw0q-ghc-paths-0.1.0.12.drv'...
cabal-doctest> Running phase: setupCompilerEnvironmentPhase
cabal-doctest> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
ghc-paths> Running phase: setupCompilerEnvironmentPhase
ghc-paths> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
cabal-doctest> Running phase: unpackPhase
cabal-doctest> unpacking source archive /nix/store/8ic4r88607c95vfk7d2idwr4rh3qz6cd-cabal-doctest-1.0.11.tar.gz
cabal-doctest> source root is cabal-doctest-1.0.11
cabal-doctest> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.11/src/Distribution/Extra/Doctest.hs"
cabal-doctest> Running phase: patchPhase
cabal-doctest> Running phase: compileBuildDriverPhase
cabal-doctest> setupCompileFlags: -package-db=/build/tmp.vvkVCU4OC7/setup-package.conf.d -threaded
ghc-paths> Running phase: unpackPhase
ghc-paths> unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
ghc-paths> source root is ghc-paths-0.1.0.12
ghc-paths> setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
ghc-paths> Running phase: patchPhase
cabal-doctest> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.vvkVCU4OC7/Main.o )
ghc-paths> Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/7.cabal.
ghc-paths> applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
ghc-paths> patching file GHC/Paths.hs
ghc-paths> Running phase: compileBuildDriverPhase
ghc-paths> setupCompileFlags: -package-db=/build/tmp.VOjsqMmQub/setup-package.conf.d -threaded
cabal-doctest> [2 of 2] Linking Setup
ghc-paths> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.VOjsqMmQub/Main.o )
ghc-paths> [2 of 2] Linking Setup
cabal-doctest> Running phase: updateAutotoolsGnuConfigScriptsPhase
cabal-doctest> Running phase: configurePhase
cabal-doctest> configureFlags: --verbose --prefix=/nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc/share/doc/cabal-doctest-1.0.11 --with-gcc=gcc --package-db=/build/tmp.vvkVCU4OC7/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
cabal-doctest> Using Parsec parser
cabal-doctest> Configuring cabal-doctest-1.0.11...
cabal-doctest> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
cabal-doctest> 'ghc' version < 9.12):
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
cabal-doctest> 9.12.1
ghc-paths> Running phase: updateAutotoolsGnuConfigScriptsPhase
ghc-paths> Running phase: configurePhase
ghc-paths> configureFlags: --verbose --prefix=/nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.VOjsqMmQub/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
ghc-paths> Using Parsec parser
ghc-paths> Configuring ghc-paths-0.1.0.12...
ghc-paths> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
ghc-paths> 'ghc' version < 9.12):
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
ghc-paths> 9.12.1
cabal-doctest> Dependency Cabal >=1.24 && <3.16: using Cabal-3.14.1.0
cabal-doctest> Dependency base >=4.9 && <5: using base-4.21.0.0
cabal-doctest> Dependency directory >=1.3 && <2: using directory-1.3.9.0
cabal-doctest> Dependency filepath >=1.4 && <2: using filepath-1.5.4.0
cabal-doctest> Source component graph: component lib
cabal-doctest> Configured component graph:
cabal-doctest>     component cabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35
cabal-doctest>         include Cabal-3.14.1.0-3103
cabal-doctest>         include base-4.21.0.0-f068
cabal-doctest>         include directory-1.3.9.0-9eff
cabal-doctest>         include filepath-1.5.4.0-7ce6
cabal-doctest> Linked component graph:
cabal-doctest>     unit cabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35
cabal-doctest>         include Cabal-3.14.1.0-3103
cabal-doctest>         include base-4.21.0.0-f068
cabal-doctest>         include directory-1.3.9.0-9eff
cabal-doctest>         include filepath-1.5.4.0-7ce6
cabal-doctest>         Distribution.Extra.Doctest=cabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35:Distribution.Extra.Doctest
cabal-doctest> Ready component graph:
cabal-doctest>     definite cabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35
cabal-doctest>         depends Cabal-3.14.1.0-3103
cabal-doctest>         depends base-4.21.0.0-f068
cabal-doctest>         depends directory-1.3.9.0-9eff
cabal-doctest>         depends filepath-1.5.4.0-7ce6
cabal-doctest> Using Cabal-3.14.1.0 compiled by ghc-9.12
cabal-doctest> Using compiler: ghc-9.12.1
cabal-doctest> Using install prefix:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11
cabal-doctest> Executables installed in:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/bin
cabal-doctest> Libraries installed in:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/cabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35
cabal-doctest> Dynamic Libraries installed in:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
cabal-doctest> Private executables installed in:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/libexec/x86_64-linux-ghc-9.12.1-f739/cabal-doctest-1.0.11
cabal-doctest> Data files installed in:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/share/x86_64-linux-ghc-9.12.1-f739/cabal-doctest-1.0.11
cabal-doctest> Documentation installed in:
cabal-doctest> /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc/share/doc/cabal-doctest-1.0.11
cabal-doctest> Configuration files installed in:
cabal-doctest> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/etc
cabal-doctest> No alex found
cabal-doctest> Using ar found on system at:
cabal-doctest> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
cabal-doctest> No c2hs found
cabal-doctest> No cpphs found
cabal-doctest> No doctest found
cabal-doctest> Using gcc version 14.3.0 given by user at:
cabal-doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
cabal-doctest> Using ghc version 9.12.1 found on system at:
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
cabal-doctest> Using ghc-pkg version 9.12.1 found on system at:
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
cabal-doctest> No ghcjs found
cabal-doctest> No ghcjs-pkg found
cabal-doctest> No greencard found
cabal-doctest> Using haddock version 2.30.0 found on system at:
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
cabal-doctest> No happy found
cabal-doctest> No haskell-suite found
cabal-doctest> No haskell-suite-pkg found
cabal-doctest> No hmake found
cabal-doctest> Using hpc version 0.69 found on system at:
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
cabal-doctest> Using hsc2hs version 0.68.10 found on system at:
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
cabal-doctest> Using hscolour version 1.25 found on system at:
cabal-doctest> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
cabal-doctest> No jhc found
cabal-doctest> Using ld found on system at:
cabal-doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
cabal-doctest> No pkg-config found
cabal-doctest> Using runghc version 9.12.1 found on system at:
cabal-doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
cabal-doctest> Using strip version 2.44 found on system at:
cabal-doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
cabal-doctest> Using tar found on system at:
cabal-doctest> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
cabal-doctest> No uhc found
cabal-doctest> Running phase: buildPhase
cabal-doctest> Preprocessing library for cabal-doctest-1.0.11...
cabal-doctest> Building library for cabal-doctest-1.0.11...
cabal-doctest> [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
ghc-paths> Dependency base >=3 && <5: using base-4.21.0.0
ghc-paths> Source component graph: component lib
ghc-paths> Configured component graph:
ghc-paths>     component ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
ghc-paths>         include base-4.21.0.0-f068
ghc-paths> Linked component graph:
ghc-paths>     unit ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
ghc-paths>         include base-4.21.0.0-f068
ghc-paths>         GHC.Paths=ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy:GHC.Paths
ghc-paths> Ready component graph:
ghc-paths>     definite ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
ghc-paths>         depends base-4.21.0.0-f068
ghc-paths> Using Cabal-3.14.1.0 compiled by ghc-9.12
ghc-paths> Using compiler: ghc-9.12.1
ghc-paths> Using install prefix:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12
ghc-paths> Executables installed in:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/bin
ghc-paths> Libraries installed in:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
ghc-paths> Dynamic Libraries installed in:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
ghc-paths> Private executables installed in:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.12.1-f739/ghc-paths-0.1.0.12
ghc-paths> Data files installed in:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.12.1-f739/ghc-paths-0.1.0.12
ghc-paths> Documentation installed in:
ghc-paths> /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
ghc-paths> Configuration files installed in:
ghc-paths> /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/etc
ghc-paths> No alex found
ghc-paths> Using ar found on system at:
ghc-paths> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
ghc-paths> No c2hs found
ghc-paths> No cpphs found
ghc-paths> No doctest found
ghc-paths> Using gcc version 14.3.0 given by user at:
ghc-paths> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
ghc-paths> Using ghc version 9.12.1 found on system at:
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
ghc-paths> Using ghc-pkg version 9.12.1 found on system at:
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
ghc-paths> No ghcjs found
ghc-paths> No ghcjs-pkg found
ghc-paths> No greencard found
ghc-paths> Using haddock version 2.30.0 found on system at:
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
ghc-paths> No happy found
ghc-paths> No haskell-suite found
ghc-paths> No haskell-suite-pkg found
ghc-paths> No hmake found
ghc-paths> Using hpc version 0.69 found on system at:
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
ghc-paths> Using hsc2hs version 0.68.10 found on system at:
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
ghc-paths> Using hscolour version 1.25 found on system at:
ghc-paths> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
ghc-paths> No jhc found
ghc-paths> Using ld found on system at:
ghc-paths> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
ghc-paths> No pkg-config found
ghc-paths> Using runghc version 9.12.1 found on system at:
ghc-paths> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
ghc-paths> Using strip version 2.44 found on system at:
ghc-paths> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
ghc-paths> Using tar found on system at:
ghc-paths> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
ghc-paths> No uhc found
ghc-paths> Running: /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
ghc-paths> Running phase: buildPhase
ghc-paths> Preprocessing library for ghc-paths-0.1.0.12...
ghc-paths> Building library for ghc-paths-0.1.0.12...
ghc-paths> [1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
cabal-doctest> src/Distribution/Extra/Doctest.hs:193:1: warning: [GHC-38417] [-Wmissing-signatures]
cabal-doctest>     Top-level binding with no type signature:
cabal-doctest>       unsymbolizePath :: Distribution.Utils.Path.SymbolicPathX
cabal-doctest>                            allowAbsolute from to
cabal-doctest>                          -> FilePath
cabal-doctest>     |
cabal-doctest> 193 | unsymbolizePath = getSymbolicPath
cabal-doctest>     | ^^^^^^^^^^^^^^^
cabal-doctest> 
ghc-paths> [1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
ghc-paths> Running phase: checkPhase
ghc-paths> Package has no test suites.
ghc-paths> Running phase: haddockPhase
cabal-doctest> [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
cabal-doctest> src/Distribution/Extra/Doctest.hs:193:1: warning: [GHC-38417] [-Wmissing-signatures]
cabal-doctest>     Top-level binding with no type signature:
cabal-doctest>       unsymbolizePath :: Distribution.Utils.Path.SymbolicPathX
cabal-doctest>                            allowAbsolute from to
cabal-doctest>                          -> FilePath
cabal-doctest>     |
cabal-doctest> 193 | unsymbolizePath = getSymbolicPath
cabal-doctest>     | ^^^^^^^^^^^^^^^
cabal-doctest> 
ghc-paths> Preprocessing library for ghc-paths-0.1.0.12...
ghc-paths> Running Haddock on library for ghc-paths-0.1.0.12...
ghc-paths> [1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, nothing ) [HIE file is missing]
ghc-paths> Haddock coverage:
ghc-paths>    0% (  0 /  5) in 'GHC.Paths'
ghc-paths>   Missing documentation for:
ghc-paths>     Module header
ghc-paths>     ghc (GHC/Paths.hs:34)
ghc-paths>     ghc_pkg (GHC/Paths.hs:35)
ghc-paths>     libdir (GHC/Paths.hs:31)
ghc-paths>     docdir (GHC/Paths.hs:32)
cabal-doctest> Running phase: checkPhase
cabal-doctest> Package has no test suites.
cabal-doctest> Running phase: haddockPhase
cabal-doctest> Preprocessing library for cabal-doctest-1.0.11...
cabal-doctest> Running Haddock on library for cabal-doctest-1.0.11...
ghc-paths> Documentation created: dist/doc/html/ghc-paths,
ghc-paths> dist/doc/html/ghc-paths/ghc-paths.txt
ghc-paths> Running phase: installPhase
ghc-paths> Installing library in /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
cabal-doctest> [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing ) [HIE file is missing]
ghc-paths> Running phase: fixupPhase
ghc-paths> shrinking RPATHs of ELF executables and libraries in /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12
ghc-paths> shrinking /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy-ghc9.12.1.so
ghc-paths> checking for references to /build/ in /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12...
ghc-paths> patching script interpreter paths in /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12
ghc-paths> stripping (with command strip and flags -S -p) in  /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12/lib
ghc-paths> shrinking RPATHs of ELF executables and libraries in /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc
ghc-paths> checking for references to /build/ in /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc...
ghc-paths> patching script interpreter paths in /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc
ghc-paths (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12
ghc-paths (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
ghc-paths (post)> 
ghc-paths (post)> Pushing /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12 (101.80 KiB)
ghc-paths (post)> Pushing /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc (120.87 KiB)
ghc-paths (post)> 
ghc-paths (post)> All done.
ghc-paths (post)> added 2 signatures
ghc-paths (post)> added 1 signatures
ghc-paths (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12
ghc-paths (post)> copying 2 paths...
ghc-paths (post)> copying path '/nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc' to 'https://cache.nix-ci.com'...
ghc-paths (post)> copying path '/nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
ghc-paths (post)> copying 1 paths...
ghc-paths (post)> copying path '/nix/store/20h8qhwflzzqamva8bzd8k9hsmv3dw0q-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
ghc-paths (post)> added 0 signatures
ghc-paths (post)> added 0 signatures
ghc-paths (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc /nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12
ghc-paths (post)> copying 2 paths...
ghc-paths (post)> copying path '/nix/store/2jr8q3d6kmvvcic2fvi915dgc3fl5wgv-ghc-paths-0.1.0.12-doc' to 'ssh-ng://worker.nix-ci.com'...
ghc-paths (post)> copying path '/nix/store/8m2a52d1p4la8zg3lrwldbpj31kl0s7j-ghc-paths-0.1.0.12' to 'ssh-ng://worker.nix-ci.com'...
ghc-paths (post)> copying 1 paths...
ghc-paths (post)> copying path '/nix/store/20h8qhwflzzqamva8bzd8k9hsmv3dw0q-ghc-paths-0.1.0.12.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/1bbbf2pxm0al5ygvbhwqqpg13x7553hl-doctest-0.24.0.drv'...
cabal-doctest> src/Distribution/Extra/Doctest.hs:193:1: warning: [GHC-38417] [-Wmissing-signatures]
cabal-doctest>     Top-level binding with no type signature:
cabal-doctest>       unsymbolizePath :: Distribution.Utils.Path.SymbolicPathX
cabal-doctest>                            allowAbsolute from to
cabal-doctest>                          -> FilePath
cabal-doctest>     |
cabal-doctest> 193 | unsymbolizePath = getSymbolicPath
cabal-doctest>     | ^^^^^^^^^^^^^^^
cabal-doctest> 
cabal-doctest> Haddock coverage:
cabal-doctest> Warning: 'UserHooks' is ambiguous. It is defined
cabal-doctest>     * in ‘Distribution.Simple.UserHooks’
cabal-doctest>     * in ‘Distribution.Simple.UserHooks’
cabal-doctest>     You may be able to disambiguate the identifier by qualifying it or
cabal-doctest>     by specifying the type/value namespace explicitly.
cabal-doctest>     Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
cabal-doctest>  100% (  6 /  6) in 'Distribution.Extra.Doctest'
cabal-doctest> Documentation created: dist/doc/html/cabal-doctest,
cabal-doctest> dist/doc/html/cabal-doctest/cabal-doctest.txt
cabal-doctest> Running phase: installPhase
cabal-doctest> Installing library in /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/cabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35
cabal-doctest> Running phase: fixupPhase
cabal-doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11
cabal-doctest> shrinking /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHScabal-doctest-1.0.11-247p6QLGXI5LROmtPhMk35-ghc9.12.1.so
cabal-doctest> checking for references to /build/ in /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11...
cabal-doctest> patching script interpreter paths in /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11
cabal-doctest> stripping (with command strip and flags -S -p) in  /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/lib
cabal-doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc
cabal-doctest> checking for references to /build/ in /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc...
cabal-doctest> patching script interpreter paths in /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc
cabal-doctest (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11 /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc
cabal-doctest (post)> Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
cabal-doctest (post)> 
cabal-doctest (post)> Pushing /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc (357.65 KiB)
cabal-doctest (post)> Pushing /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11 (900.51 KiB)
cabal-doctest (post)> 
cabal-doctest (post)> All done.
cabal-doctest (post)> added 2 signatures
cabal-doctest (post)> added 1 signatures
cabal-doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11 /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc
cabal-doctest (post)> copying 2 paths...
cabal-doctest (post)> copying path '/nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc' to 'https://cache.nix-ci.com'...
cabal-doctest (post)> copying path '/nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11' to 'https://cache.nix-ci.com'...
cabal-doctest (post)> copying 1 paths...
cabal-doctest (post)> copying path '/nix/store/axwv9wqbfa6jwps7m7yb8fqayv8jy6j1-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...
cabal-doctest (post)> added 0 signatures
cabal-doctest (post)> added 0 signatures
cabal-doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11 /nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc
cabal-doctest (post)> copying 2 paths...
cabal-doctest (post)> copying path '/nix/store/z8h36hsncqsb4m7x65qi43g4im0c56fz-cabal-doctest-1.0.11-doc' to 'ssh-ng://worker.nix-ci.com'...
cabal-doctest (post)> copying path '/nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11' to 'ssh-ng://worker.nix-ci.com'...
cabal-doctest (post)> copying 1 paths...
cabal-doctest (post)> copying path '/nix/store/axwv9wqbfa6jwps7m7yb8fqayv8jy6j1-cabal-doctest-1.0.11.drv' to 'ssh-ng://worker.nix-ci.com'...
doctest> Running phase: setupCompilerEnvironmentPhase
doctest> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
doctest> Running phase: unpackPhase
doctest> unpacking source archive /nix/store/sx0kgsyjl6cggpb83pb21s1x5sjxb7am-doctest-0.24.0.tar.gz
doctest> source root is doctest-0.24.0
doctest> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.0/test/UtilSpec.hs"
doctest> Running phase: patchPhase
doctest> Running phase: compileBuildDriverPhase
doctest> setupCompileFlags: -package-db=/build/tmp.C1WtBl5tQz/setup-package.conf.d -threaded
doctest> [1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.C1WtBl5tQz/Main.o )
doctest> [2 of 2] Linking Setup
doctest> Running phase: updateAutotoolsGnuConfigScriptsPhase
doctest> Running phase: configurePhase
doctest> configureFlags: --verbose --prefix=/nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc/share/doc/doctest-0.24.0 --with-gcc=gcc --package-db=/build/tmp.C1WtBl5tQz/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/lib
doctest> Using Parsec parser
doctest> Configuring doctest-0.24.0...
doctest> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
doctest> 'ghc' version < 9.12):
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
doctest> 9.12.1
doctest> Flags chosen: cabal-doctest=False
doctest> Dependency base >=4.7 && <5: using base-4.21.0.0
doctest> Dependency code-page >=0.1: using code-page-0.2.1
doctest> Dependency containers: using containers-0.7
doctest> Dependency deepseq: using deepseq-1.5.1.0
doctest> Dependency directory: using directory-1.3.9.0
doctest> Dependency exceptions: using exceptions-0.10.9
doctest> Dependency filepath: using filepath-1.5.4.0
doctest> Dependency ghc >=8.0 && <9.14: using ghc-9.12.1
doctest> Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
doctest> Dependency process: using process-1.6.25.0
doctest> Dependency syb >=0.3: using syb-0.7.2.4
doctest> Dependency temporary: using temporary-1.3
doctest> Dependency transformers: using transformers-0.6.1.2
doctest> Dependency base >=4.7 && <5: using base-4.21.0.0
doctest> Dependency doctest: using doctest-0.24.0
doctest> Dependency HUnit: using HUnit-1.6.2.0
doctest> Dependency QuickCheck >=2.13.1: using QuickCheck-2.14.3
doctest> Dependency base >=4.7 && <5: using base-4.21.0.0
doctest> Dependency code-page >=0.1: using code-page-0.2.1
doctest> Dependency containers: using containers-0.7
doctest> Dependency deepseq: using deepseq-1.5.1.0
doctest> Dependency directory: using directory-1.3.9.0
doctest> Dependency exceptions: using exceptions-0.10.9
doctest> Dependency filepath: using filepath-1.5.4.0
doctest> Dependency ghc >=8.0 && <9.14: using ghc-9.12.1
doctest> Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
doctest> Dependency hspec >=2.3.0: using hspec-2.11.12
doctest> Dependency hspec-core >=2.3.0: using hspec-core-2.11.12
doctest> Dependency mockery: using mockery-0.3.5
doctest> Dependency process: using process-1.6.25.0
doctest> Dependency silently >=1.2.4: using silently-1.2.5.4
doctest> Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
doctest> Dependency syb >=0.3: using syb-0.7.2.4
doctest> Dependency temporary: using temporary-1.3
doctest> Dependency transformers: using transformers-0.6.1.2
doctest> Source component graph:
doctest>     component test:spec
doctest>     component lib
doctest>     component exe:doctest dependency lib
doctest> Configured component graph:
doctest>     component doctest-0.24.0-J3sPhpZiyXlE8YhUGRUQnf-spec
doctest>         include HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
doctest>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
doctest>         include base-4.21.0.0-f068
doctest>         include code-page-0.2.1-3eK6Vv0Qd159WYaS4Rb6st
doctest>         include containers-0.7-647d
doctest>         include deepseq-1.5.1.0-b096
doctest>         include directory-1.3.9.0-9eff
doctest>         include exceptions-0.10.9-5f69
doctest>         include filepath-1.5.4.0-7ce6
doctest>         include ghc-9.12.1-f739
doctest>         include ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
doctest>         include hspec-2.11.12-6VqvYzslwXZ4HevclPqaIQ
doctest>         include hspec-core-2.11.12-pIuDgijOQZ494W2nm0szB
doctest>         include mockery-0.3.5-84HNwmf4qL7ECzsJvcPW7d
doctest>         include process-1.6.25.0-4623
doctest>         include silently-1.2.5.4-7tvUfLbVOVnLBvsvbpccMF
doctest>         include stringbuilder-0.5.1-GPCZTD33smG7DUfrteRT5T
doctest>         include syb-0.7.2.4-6chaqlyo5Pz3MnSsbnX5qQ
doctest>         include temporary-1.3-IvNvS6OZKey6h9lvi7WIGg
doctest>         include transformers-0.6.1.2-199f
doctest>     component doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest>         include base-4.21.0.0-f068
doctest>         include code-page-0.2.1-3eK6Vv0Qd159WYaS4Rb6st
doctest>         include containers-0.7-647d
doctest>         include deepseq-1.5.1.0-b096
doctest>         include directory-1.3.9.0-9eff
doctest>         include exceptions-0.10.9-5f69
doctest>         include filepath-1.5.4.0-7ce6
doctest>         include ghc-9.12.1-f739
doctest>         include ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
doctest>         include process-1.6.25.0-4623
doctest>         include syb-0.7.2.4-6chaqlyo5Pz3MnSsbnX5qQ
doctest>         include temporary-1.3-IvNvS6OZKey6h9lvi7WIGg
doctest>         include transformers-0.6.1.2-199f
doctest>     component doctest-0.24.0-HCBiqG2ET2fE9O3rZnDNA1-doctest
doctest>         include base-4.21.0.0-f068
doctest>         include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest> Linked component graph:
doctest>     unit doctest-0.24.0-J3sPhpZiyXlE8YhUGRUQnf-spec
doctest>         include HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
doctest>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
doctest>         include base-4.21.0.0-f068
doctest>         include code-page-0.2.1-3eK6Vv0Qd159WYaS4Rb6st
doctest>         include containers-0.7-647d
doctest>         include deepseq-1.5.1.0-b096
doctest>         include directory-1.3.9.0-9eff
doctest>         include exceptions-0.10.9-5f69
doctest>         include filepath-1.5.4.0-7ce6
doctest>         include ghc-9.12.1-f739
doctest>         include ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
doctest>         include hspec-2.11.12-6VqvYzslwXZ4HevclPqaIQ
doctest>         include hspec-core-2.11.12-pIuDgijOQZ494W2nm0szB
doctest>         include mockery-0.3.5-84HNwmf4qL7ECzsJvcPW7d
doctest>         include process-1.6.25.0-4623
doctest>         include silently-1.2.5.4-7tvUfLbVOVnLBvsvbpccMF
doctest>         include stringbuilder-0.5.1-GPCZTD33smG7DUfrteRT5T
doctest>         include syb-0.7.2.4-6chaqlyo5Pz3MnSsbnX5qQ
doctest>         include temporary-1.3-IvNvS6OZKey6h9lvi7WIGg
doctest>         include transformers-0.6.1.2-199f
doctest>     unit doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest>         include base-4.21.0.0-f068
doctest>         include code-page-0.2.1-3eK6Vv0Qd159WYaS4Rb6st
doctest>         include containers-0.7-647d
doctest>         include deepseq-1.5.1.0-b096
doctest>         include directory-1.3.9.0-9eff
doctest>         include exceptions-0.10.9-5f69
doctest>         include filepath-1.5.4.0-7ce6
doctest>         include ghc-9.12.1-f739
doctest>         include ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
doctest>         include process-1.6.25.0-4623
doctest>         include syb-0.7.2.4-6chaqlyo5Pz3MnSsbnX5qQ
doctest>         include temporary-1.3-IvNvS6OZKey6h9lvi7WIGg
doctest>         include transformers-0.6.1.2-199f
doctest>         Test.DocTest=doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E:Test.DocTest.Internal.Run
doctest>     unit doctest-0.24.0-HCBiqG2ET2fE9O3rZnDNA1-doctest
doctest>         include base-4.21.0.0-f068
doctest>         include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest> Ready component graph:
doctest>     definite doctest-0.24.0-J3sPhpZiyXlE8YhUGRUQnf-spec
doctest>         depends HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
doctest>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
doctest>         depends base-4.21.0.0-f068
doctest>         depends code-page-0.2.1-3eK6Vv0Qd159WYaS4Rb6st
doctest>         depends containers-0.7-647d
doctest>         depends deepseq-1.5.1.0-b096
doctest>         depends directory-1.3.9.0-9eff
doctest>         depends exceptions-0.10.9-5f69
doctest>         depends filepath-1.5.4.0-7ce6
doctest>         depends ghc-9.12.1-f739
doctest>         depends ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
doctest>         depends hspec-2.11.12-6VqvYzslwXZ4HevclPqaIQ
doctest>         depends hspec-core-2.11.12-pIuDgijOQZ494W2nm0szB
doctest>         depends mockery-0.3.5-84HNwmf4qL7ECzsJvcPW7d
doctest>         depends process-1.6.25.0-4623
doctest>         depends silently-1.2.5.4-7tvUfLbVOVnLBvsvbpccMF
doctest>         depends stringbuilder-0.5.1-GPCZTD33smG7DUfrteRT5T
doctest>         depends syb-0.7.2.4-6chaqlyo5Pz3MnSsbnX5qQ
doctest>         depends temporary-1.3-IvNvS6OZKey6h9lvi7WIGg
doctest>         depends transformers-0.6.1.2-199f
doctest>     definite doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest>         depends base-4.21.0.0-f068
doctest>         depends code-page-0.2.1-3eK6Vv0Qd159WYaS4Rb6st
doctest>         depends containers-0.7-647d
doctest>         depends deepseq-1.5.1.0-b096
doctest>         depends directory-1.3.9.0-9eff
doctest>         depends exceptions-0.10.9-5f69
doctest>         depends filepath-1.5.4.0-7ce6
doctest>         depends ghc-9.12.1-f739
doctest>         depends ghc-paths-0.1.0.12-FGN6Y97IYFiLt2jWXmfYPy
doctest>         depends process-1.6.25.0-4623
doctest>         depends syb-0.7.2.4-6chaqlyo5Pz3MnSsbnX5qQ
doctest>         depends temporary-1.3-IvNvS6OZKey6h9lvi7WIGg
doctest>         depends transformers-0.6.1.2-199f
doctest>     definite doctest-0.24.0-HCBiqG2ET2fE9O3rZnDNA1-doctest
doctest>         depends base-4.21.0.0-f068
doctest>         depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest> Using Cabal-3.14.1.0 compiled by ghc-9.12
doctest> Using compiler: ghc-9.12.1
doctest> Using install prefix:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0
doctest> Executables installed in:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin
doctest> Libraries installed in:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest> Dynamic Libraries installed in:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
doctest> Private executables installed in:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/libexec/x86_64-linux-ghc-9.12.1-f739/doctest-0.24.0
doctest> Data files installed in:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/share/x86_64-linux-ghc-9.12.1-f739/doctest-0.24.0
doctest> Documentation installed in:
doctest> /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc/share/doc/doctest-0.24.0
doctest> Configuration files installed in:
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/etc
doctest> No alex found
doctest> Using ar found on system at:
doctest> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
doctest> No c2hs found
doctest> No cpphs found
doctest> No doctest found
doctest> Using gcc version 14.3.0 given by user at:
doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
doctest> Using ghc version 9.12.1 found on system at:
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
doctest> Using ghc-pkg version 9.12.1 found on system at:
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
doctest> No ghcjs found
doctest> No ghcjs-pkg found
doctest> No greencard found
doctest> Using haddock version 2.30.0 found on system at:
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
doctest> No happy found
doctest> No haskell-suite found
doctest> No haskell-suite-pkg found
doctest> No hmake found
doctest> Using hpc version 0.69 found on system at:
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
doctest> Using hsc2hs version 0.68.10 found on system at:
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
doctest> Using hscolour version 1.25 found on system at:
doctest> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
doctest> No jhc found
doctest> Using ld found on system at:
doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
doctest> No pkg-config found
doctest> Using runghc version 9.12.1 found on system at:
doctest> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
doctest> Using strip version 2.44 found on system at:
doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
doctest> Using tar found on system at:
doctest> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
doctest> No uhc found
doctest> Running phase: buildPhase
doctest> Preprocessing test suite 'spec' for doctest-0.24.0...
doctest> Building test suite 'spec' for doctest-0.24.0...
doctest> [ 1 of 44] Compiling Imports          ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
doctest> [ 2 of 44] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
doctest> [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
doctest> [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
doctest> [ 5 of 44] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
doctest> [ 6 of 44] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
doctest> [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
doctest> [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
doctest> [ 9 of 44] Compiling Interpreter      ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
doctest> [10 of 44] Compiling InterpreterSpec  ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
doctest> [11 of 44] Compiling Info             ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
doctest> [12 of 44] Compiling InfoSpec         ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
doctest> [13 of 44] Compiling Cabal            ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
doctest> [14 of 44] Compiling Cabal.PathsSpec  ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
doctest> [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
doctest> [16 of 44] Compiling Location         ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
doctest> [17 of 44] Compiling LocationSpec     ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
doctest> [18 of 44] Compiling Options          ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
doctest> [19 of 44] Compiling OptionsSpec      ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
doctest> [20 of 44] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
doctest> [21 of 44] Compiling PackageDBsSpec   ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
doctest> [22 of 44] Compiling Paths_doctest    ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
doctest> [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
doctest> [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
doctest> [25 of 44] Compiling Util             ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
doctest> [26 of 44] Compiling Extract          ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
doctest> [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
doctest> [28 of 44] Compiling Parse            ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
doctest> [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
doctest> [30 of 44] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
doctest> [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
doctest> [32 of 44] Compiling Property         ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
doctest> [33 of 44] Compiling Runner           ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
doctest> [34 of 44] Compiling RunnerSpec       ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
doctest> [35 of 44] Compiling Run              ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
doctest> [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
doctest> [37 of 44] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
doctest> [38 of 44] Compiling RunSpec          ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
doctest> [39 of 44] Compiling MainSpec         ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
doctest> [40 of 44] Compiling PropertySpec     ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
doctest> [41 of 44] Compiling ParseSpec        ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
doctest> [42 of 44] Compiling ExtractSpec      ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
doctest> [43 of 44] Compiling UtilSpec         ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
doctest> [44 of 44] Compiling Main             ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
doctest> [45 of 45] Linking dist/build/spec/spec
doctest> Preprocessing library for doctest-0.24.0...
doctest> Building library for doctest-0.24.0...
doctest> [ 1 of 26] Compiling Imports          ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
doctest> [ 2 of 26] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
doctest> [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
doctest> [ 4 of 26] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
doctest> [ 5 of 26] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
doctest> [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
doctest> [ 7 of 26] Compiling Interpreter      ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
doctest> [ 8 of 26] Compiling Location         ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
doctest> [ 9 of 26] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
doctest> [10 of 26] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
doctest> [11 of 26] Compiling Info             ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
doctest> [12 of 26] Compiling Options          ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
doctest> [13 of 26] Compiling Cabal            ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
doctest> [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
doctest> [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
doctest> [16 of 26] Compiling Util             ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
doctest> [17 of 26] Compiling Extract          ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
doctest> [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
doctest> [19 of 26] Compiling Parse            ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
doctest> [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
doctest> [21 of 26] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
doctest> [22 of 26] Compiling Property         ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
doctest> [23 of 26] Compiling Runner           ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
doctest> [24 of 26] Compiling Run              ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
doctest> [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
doctest> [26 of 26] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
doctest> [ 1 of 26] Compiling Imports          ( src/Imports.hs, dist/build/Imports.p_o )
doctest> [ 2 of 26] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
doctest> [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
doctest> [ 4 of 26] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
doctest> [ 5 of 26] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
doctest> [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
doctest> [ 7 of 26] Compiling Interpreter      ( src/Interpreter.hs, dist/build/Interpreter.p_o )
doctest> [ 8 of 26] Compiling Location         ( src/Location.hs, dist/build/Location.p_o )
doctest> [ 9 of 26] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
doctest> [10 of 26] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
doctest> [11 of 26] Compiling Info             ( src/Info.hs, dist/build/Info.p_o )
doctest> [12 of 26] Compiling Options          ( src/Options.hs, dist/build/Options.p_o )
doctest> [13 of 26] Compiling Cabal            ( src/Cabal.hs, dist/build/Cabal.p_o )
doctest> [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
doctest> [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
doctest> [16 of 26] Compiling Util             ( src/Util.hs, dist/build/Util.p_o )
doctest> [17 of 26] Compiling Extract          ( src/Extract.hs, dist/build/Extract.p_o )
doctest> [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
doctest> [19 of 26] Compiling Parse            ( src/Parse.hs, dist/build/Parse.p_o )
doctest> [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
doctest> [21 of 26] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
doctest> [22 of 26] Compiling Property         ( src/Property.hs, dist/build/Property.p_o )
doctest> [23 of 26] Compiling Runner           ( src/Runner.hs, dist/build/Runner.p_o )
doctest> [24 of 26] Compiling Run              ( src/Run.hs, dist/build/Run.p_o )
doctest> [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
doctest> [26 of 26] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
doctest> Preprocessing executable 'doctest' for doctest-0.24.0...
doctest> Building executable 'doctest' for doctest-0.24.0...
doctest> [1 of 2] Compiling Main             ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
doctest> [2 of 2] Compiling Paths_doctest    ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
doctest> [3 of 3] Linking dist/build/doctest/doctest
doctest> buildPhase completed in 30 seconds
doctest> Running phase: checkPhase
doctest> Running 1 test suites...
doctest> Test suite spec: RUNNING...
doctest> 
doctest> Extract
doctest>   extract
doctest>     extracts documentation for a top-level declaration [✔]
doctest>     extracts documentation from argument list [✔]
doctest>     extracts documentation for a type class function [✔]
doctest>     extracts documentation from the argument list of a type class function [✔]
doctest>     extracts documentation from the module header [✔]
doctest>     extracts documentation from imported modules [✔]
doctest>     extracts documentation from export list [✔]
doctest>     extracts documentation from named chunks [✔]
doctest>     returns docstrings in the same order they appear in the source [✔]
doctest>     extracts $setup code [✔]
doctest>     fails on invalid flags [✔]
doctest>   extract (regression tests)
doctest>     works with infix operators [✔]
doctest>     works with parallel list comprehensions [✔]
doctest>     works with list comprehensions in instance definitions [✔]
doctest>     works with foreign imports [✔]
doctest>     works for rewrite rules [✔]
doctest>     works for rewrite rules with type signatures [✔]
doctest>     strips CR from dos line endings [✔]
doctest>     works with a module that splices in an expression from an other module [✔]
doctest>     works for type families and GHC 7.6.1 [✔]
doctest> Info
doctest>   formatInfo
doctest>     formats --info output [✔]
doctest> Interpreter
doctest>   interpreterSupported
doctest>     indicates whether GHCi is supported on current platform [✔]
doctest>   ghcInfo
doctest>     includes "Have interpreter" [✔]
doctest>   safeEval
doctest>     evaluates an expression [✔]
doctest>     returns Left on unterminated multiline command [✔]
doctest>   filterExpression
doctest>     removes :set -XTemplateHaskell [✔]
doctest>     filters -XTemplateHaskell [✔]
doctest>     leaves :set-statement that do not set -XTemplateHaskell alone  [✔]
doctest> Language.Haskell.GhciWrapper
doctest>   evalEcho
doctest>     prints result to stdout [✔]
doctest>   evalWith
doctest>     with PreserveIt
doctest>       preserves it [✔]
doctest>   eval
doctest>     shows literals [✔]
doctest>     shows string literals containing Unicode [✔]
doctest>     evaluates simple expressions [✔]
doctest>     supports let bindings [✔]
doctest>     allows import statements [✔]
doctest>     captures stdout [✔]
doctest>     captures stdout (Unicode) [✔]
doctest>     captures stdout (empty line) [✔]
doctest>     captures stdout (multiple lines) [✔]
doctest>     captures stderr [✔]
doctest>     captures stderr (Unicode) [✔]
doctest>     shows exceptions [✔]
doctest>     shows exceptions (ExitCode) [✔]
doctest>     gives an error message for identifiers that are not in scope [✔]
doctest>     when configVerbose is True
doctest>       prints prompt [✔]
doctest>     with -XOverloadedStrings, -Wall and -Werror
doctest>       does not fail on marker expression (bug fix) [✔]
doctest>     with NoImplicitPrelude
doctest>       works [✔]
doctest>     with a strange String type
doctest>       works [✔]
doctest> Location
doctest>   toLocation
doctest>     works for a regular SrcSpan [✔]
doctest>     works for a single-line SrcSpan [✔]
doctest>     works for a SrcSpan that corresponds to single point [✔]
doctest>     works for a bad SrcSpan [✔]
doctest>     works for a SrcLoc with bad locations [✔]
doctest>   enumerate
doctest>     replicates UnhelpfulLocation [✔]
doctest>     enumerates Location [✔]
doctest> Main
doctest>   doctest
doctest>     testSimple [✔]
doctest>     it-variable [✔]
doctest>     it-variable in $setup [✔]
doctest>     failing [✔]
doctest>     skips subsequent examples from the same group if an example fails [✔]
doctest>     without --fail-fast
doctest>       continuous even if some tests fail [✔]
doctest>     with --fail-fast
doctest>       stops after the first failure [✔]
doctest>       stops after failures in $setup [✔]
doctest>     testImport [✔]
doctest>     testCommentLocation [✔]
doctest>     testPutStr [✔]
doctest>     fails on multi-line expressions, introduced with :{ [✔]
doctest>     testBlankline [✔]
doctest>     examples from the same Haddock comment share the same scope [✔]
doctest>     testDocumentationForArguments [✔]
doctest>     template-haskell [✔]
doctest>     handles source files with CRLF line endings [✔]
doctest>     runs $setup before each test group [✔]
doctest>     skips subsequent tests from a module, if $setup fails [✔]
doctest>     ignores trailing whitespace when matching test output [✔]
doctest>   doctest as a runner for QuickCheck properties
doctest>     runs a boolean property [✔]
doctest>     runs an explicitly quantified property [✔]
doctest>     runs an implicitly quantified property [✔]
doctest>     reports a failing property [✔]
doctest>     runs a boolean property with an explicit type signature [✔]
doctest>     runs $setup before each property [✔]
doctest>   doctest (regression tests)
doctest>     bugfixWorkingDirectory [✔]
doctest>     bugfixOutputToStdErr [✔]
doctest>     bugfixImportHierarchical [✔]
doctest>     bugfixMultipleModules [✔]
doctest>     testCPP [✔]
doctest>     template-haskell-bugfix [✔]
doctest>     doesn't clash with user bindings of stdout/stderr [✔]
doctest>     doesn't get confused by doctests using System.IO imports [✔]
doctest> Options
doctest>   parseOptions
doctest>     strips --optghc [✔]
doctest>     strips --optghc= [✔]
doctest>     with ghc options that are not valid with --interactive
doctest>       returns ProxyToGhc [✔]
doctest>         +++ OK, passed 100 tests.
doctest>     with --interactive
doctest>       disables magic mode [✔]
doctest>       filters out --interactive [✔]
doctest>       accepts --fast [✔]
doctest>     --no-magic
doctest>       without --no-magic
doctest>         enables magic mode [✔]
doctest>       with --no-magic
doctest>         disables magic mode [✔]
doctest>     --fast
doctest>       without --fast
doctest>         disables fast mode [✔]
doctest>       with --fast
doctest>         enables fast mode [✔]
doctest>     --preserve-it
doctest>       without --preserve-it
doctest>         does not preserve the `it` variable [✔]
doctest>       with --preserve-it
doctest>         preserves the `it` variable [✔]
doctest>     --fail-fast
doctest>       without --fail-fast
doctest>         disables fail-fast mode [✔]
doctest>       with --fail-fast
doctest>         enables fail-fast mode [✔]
doctest>     with --help
doctest>       outputs usage information [✔]
doctest>     with --version
doctest>       outputs version information [✔]
doctest>     with --info
doctest>       outputs machine readable version information [✔]
doctest>     --verbose
doctest>       without --verbose
doctest>         is not verbose by default [✔]
doctest>       with --verbose
doctest>         parses verbose option [✔]
doctest> PackageDBs
doctest>   getPackageDBsFromEnv
doctest>     uses global and user when no env used [✔]
doctest>     respects GHC_PACKAGE_PATH [✔]
doctest> Parse
doctest>   extractDocTests
doctest>     extracts properties from a module [✔]
doctest>     extracts examples from a module [✔]
doctest>     extracts examples from documentation for non-exported names [✔]
doctest>     extracts multiple examples from a module [✔]
doctest>     returns an empty list, if documentation contains no examples [✔]
doctest>     sets setup code to Nothing, if it does not contain any tests [✔]
doctest>     keeps modules that only contain setup code [✔]
doctest>   parseInteractions (an internal function)
doctest>     parses an interaction [✔]
doctest>     drops whitespace as appropriate [✔]
doctest>     parses an interaction without a result [✔]
doctest>     works with a complex example [✔]
doctest>     attaches location information to parsed interactions [✔]
doctest>     basic multiline [✔]
doctest>     multiline align output [✔]
doctest>     multiline align output with >>> [✔]
doctest>     parses wild cards lines [✔]
doctest>     parses wild card chunks [✔]
doctest>    parseProperties (an internal function)
doctest>     parses a property [✔]
doctest>   mkLineChunks (an internal function)
doctest>     replaces ellipsis with WildCardChunks [✔]
doctest>     doesn't replace fewer than 3 consecutive dots [✔]
doctest>     handles leading and trailing dots [✔]
doctest>     handles leading and trailing ellipsis [✔]
doctest> Property
doctest>   runProperty
doctest>     reports a failing property [✔]
doctest>     runs a Bool property [✔]
doctest>     runs a Bool property with an explicit type signature [✔]
doctest>     runs an implicitly quantified property [✔]
doctest>     runs an implicitly quantified property even with GHC 7.4 [✔]
doctest>     runs an explicitly quantified property [✔]
doctest>     allows to mix implicit and explicit quantification [✔]
doctest>     reports the value for which a property fails [✔]
doctest>     reports the values for which a property that takes multiple arguments fails [✔]
doctest>     defaults ambiguous type variables to Integer [✔]
doctest>   freeVariables
doctest>     finds a free variables in a term [✔]
doctest>     ignores duplicates [✔]
doctest>     works for terms with multiple names [✔]
doctest>     works for names that contain a prime [✔]
doctest>     works for names that are similar to other names that are in scope [✔]
doctest>   parseNotInScope
doctest>     when error message was produced by GHC 7.4.1
doctest>       extracts a variable name of variable that is not in scope from an error message [✔]
doctest>       ignores duplicates [✔]
doctest>       works for variable names that contain a prime [✔]
doctest>       works for error messages with suggestions [✔]
doctest>     when error message was produced by GHC 8.0.1
doctest>       extracts a variable name of variable that is not in scope from an error message [✔]
doctest>       ignores duplicates [✔]
doctest>       works for variable names that contain a prime [✔]
doctest>       works for error messages with suggestions [✔]
doctest> Run
doctest>   doctest
doctest>     exits with ExitFailure if at least one test case fails [✔]
doctest>     prints help on --help [✔]
doctest>     prints version on --version [✔]
doctest>     accepts arbitrary GHC options [✔]
doctest>     accepts GHC options with --optghc [✔]
doctest>     prints a deprecation message for --optghc [✔]
doctest>     prints error message on invalid option [✔]
doctest>     prints verbose description of a specification [✔]
doctest>     prints verbose description of a property [✔]
doctest>     prints verbose error [✔]
doctest>     can deal with potentially problematic GHC options [✔]
doctest>   doctestWithResult
doctest>     on parse error
doctest>       aborts with (ExitFailure 1) [✔]
doctest>       prints a useful error message [✔]
doctest>   expandDirs
doctest>     expands a directory [✔]
doctest>     ignores files [✔]
doctest>     ignores random things [✔]
doctest> Runner
doctest>   report
doctest>     when mode is interactive
doctest>       writes to stderr [✔]
doctest>     when mode is non-interactive
doctest>       writes to stderr [✔]
doctest>   report_
doctest>     when mode is interactive
doctest>       writes transient output to stderr [✔]
doctest>     when mode is non-interactive
doctest>       is ignored [✔]
doctest> Runner.Example
doctest>   mkResult
doctest>     returns Equal when output matches [✔]
doctest>       +++ OK, passed 100 tests.
doctest>     ignores trailing whitespace [✔]
doctest>     with WildCardLine
doctest>       matches zero lines [✔]
doctest>       matches first zero line [✔]
doctest>       matches final zero line [✔]
doctest>       matches an arbitrary number of lines [✔]
doctest>       matches an arbitrary number of lines (quickcheck) [✔]
doctest>         +++ OK, passed 100 tests.
doctest>     with WildCardChunk
doctest>       matches an arbitrary line chunk [✔]
doctest>       matches an arbitrary line chunk at end [✔]
doctest>       does not match at end [✔]
doctest>       does not match at start [✔]
doctest>     when output does not match
doctest>       constructs failure message [✔]
doctest>       constructs failure message for multi-line output [✔]
doctest>       when any output line contains "unsafe" characters
doctest>         uses show to format output lines [✔]
doctest>       insert caret after last matching character on different lengths [✔]
doctest>       insert caret after mismatching line for multi-line output [✔]
doctest>       insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
doctest>       insert caret after longest match for wildcard [✔]
doctest>       show expanded pattern for long matches [✔]
doctest> Util
doctest>   convertDosLineEndings
doctest>     converts CRLF to LF [✔]
doctest>     strips a trailing CR [✔]
doctest>   takeWhileEnd
doctest>     returns the longest suffix of elements that satisfy a given predicate [✔]
doctest> 
doctest> Finished in 19.6966 seconds
doctest> 197 examples, 0 failures
doctest> Test suite spec: PASS
doctest> Test suite logged to: dist/test/doctest-0.24.0-spec.log
doctest> 1 of 1 test suites (1 of 1 test cases) passed.
doctest> Running phase: haddockPhase
doctest> Preprocessing test suite 'spec' for doctest-0.24.0...
doctest> Preprocessing library for doctest-0.24.0...
doctest> Running Haddock on library for doctest-0.24.0...
doctest> [ 1 of 26] Compiling Imports          ( src/Imports.hs, nothing ) [HIE file is missing]
doctest> [ 2 of 26] Compiling GhcUtil          ( src/GhcUtil.hs, nothing ) [HIE file is missing]
doctest> [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing ) [HIE file is missing]
doctest> [ 4 of 26] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, nothing ) [HIE file is missing]
doctest> [ 5 of 26] Compiling Cabal.Options    ( src/Cabal/Options.hs, nothing ) [HIE file is missing]
doctest> [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing ) [HIE file is missing]
doctest> [ 7 of 26] Compiling Interpreter      ( src/Interpreter.hs, nothing ) [HIE file is missing]
doctest> [ 8 of 26] Compiling Location         ( src/Location.hs, nothing ) [HIE file is missing]
doctest> [ 9 of 26] Compiling PackageDBs       ( src/PackageDBs.hs, nothing ) [HIE file is missing]
doctest> [10 of 26] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, nothing ) [HIE file is missing]
doctest> [11 of 26] Compiling Info             ( src/Info.hs, nothing ) [HIE file is missing]
doctest> [12 of 26] Compiling Options          ( src/Options.hs, nothing ) [HIE file is missing]
doctest> [13 of 26] Compiling Cabal            ( src/Cabal.hs, nothing ) [HIE file is missing]
doctest> [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing ) [HIE file is missing]
doctest> [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing ) [HIE file is missing]
doctest> [16 of 26] Compiling Util             ( src/Util.hs, nothing ) [HIE file is missing]
doctest> [17 of 26] Compiling Extract          ( src/Extract.hs, nothing ) [HIE file is missing]
doctest> [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing ) [HIE file is missing]
doctest> [19 of 26] Compiling Parse            ( src/Parse.hs, nothing ) [HIE file is missing]
doctest> [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing ) [HIE file is missing]
doctest> [21 of 26] Compiling Runner.Example   ( src/Runner/Example.hs, nothing ) [HIE file is missing]
doctest> [22 of 26] Compiling Property         ( src/Property.hs, nothing ) [HIE file is missing]
doctest> [23 of 26] Compiling Runner           ( src/Runner.hs, nothing ) [HIE file is missing]
doctest> [24 of 26] Compiling Run              ( src/Run.hs, nothing ) [HIE file is missing]
doctest> [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing ) [HIE file is missing]
doctest> [26 of 26] Compiling Test.DocTest     ( src/Test/DocTest.hs, nothing ) [HIE file is missing]
doctest> Haddock coverage:
doctest> Warning: Imports: Could not find documentation for exported module: Imports
doctest>    0% (  0 /  2) in 'Test.DocTest.Internal.Cabal'
doctest>   Missing documentation for:
doctest>     Module header
doctest>     doctest (src/Test/DocTest/Internal/Cabal.hs:10)
doctest>   88% (  8 /  9) in 'Test.DocTest.Internal.Location'
doctest>   Missing documentation for:
doctest>     Module header
doctest> Warning: 'SomeException' is ambiguous. It is defined
doctest>     * in ‘GHC.Internal.Exception.Type’
doctest>     * in ‘GHC.Internal.Exception.Type’
doctest>     You may be able to disambiguate the identifier by qualifying it or
doctest>     by specifying the type/value namespace explicitly.
doctest>     Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
doctest>   66% (  2 /  3) in 'Test.DocTest.Internal.Extract'
doctest>   Missing documentation for:
doctest>     Module header
doctest>   22% (  2 /  9) in 'Test.DocTest.Internal.Parse'
doctest>   Missing documentation for:
doctest>     Module header
doctest>     parseModules (src/Parse.hs:60)
doctest>     DocTest (src/Parse.hs:29)
doctest>     ExpectedLine (src/Parse.hs:38)
doctest>     ExpectedResult (src/Parse.hs:45)
doctest>     Expression (src/Parse.hs:44)
doctest>     LineChunk (src/Parse.hs:32)
doctest> Warning: 'report_' is out of scope.
doctest>     If you qualify the identifier, haddock can try to link it anyway.
doctest>   15% (  2 / 13) in 'Test.DocTest.Internal.Run'
doctest>   Missing documentation for:
doctest>     Module header
doctest>     defaultConfig (src/Options.hs:68)
doctest>     doctestWith (src/Run.hs:135)
doctest>     doctestWithRepl (src/Run.hs:65)
doctest>     doctestWithResult (src/Run.hs:143)
doctest>     evaluateResult (src/Run.hs:140)
doctest>     runDocTests (src/Run.hs:153)
doctest>     formatSummary (src/Runner.hs:58)
doctest>     isSuccess (src/Runner.hs:55)
doctest>     Config (src/Options.hs:58)
doctest>     Result (src/Run.hs:137)
doctest>   50% (  1 /  2) in 'Test.DocTest'
doctest>   Missing documentation for:
doctest>     Module header
doctest> Documentation created: dist/doc/html/doctest,
doctest> dist/doc/html/doctest/doctest.txt
doctest> Preprocessing executable 'doctest' for doctest-0.24.0...
doctest> Running phase: installPhase
doctest> Installing library in /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
doctest> Installing executable doctest in /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin
doctest> Warning: The directory
doctest> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin is not in the
doctest> system search path.
doctest> Running phase: fixupPhase
doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0
doctest> shrinking /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin/doctest
doctest> shrinking /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSdoctest-0.24.0-GGpROyg9TSm1IGZyewuA6E-ghc9.12.1.so
doctest> checking for references to /build/ in /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0...
doctest> patching script interpreter paths in /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0
doctest> stripping (with command strip and flags -S -p) in  /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/lib /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin
doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc
doctest> checking for references to /build/ in /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc...
doctest> patching script interpreter paths in /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc
doctest (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0 /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc
doctest (post)> Pushing 2 paths (78 are already present) using zstd to cache sellout ⏳
doctest (post)> 
doctest (post)> Pushing /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc (1.52 MiB)
doctest (post)> Pushing /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0 (74.33 MiB)
doctest (post)> 
doctest (post)> All done.
doctest (post)> added 2 signatures
doctest (post)> added 36 signatures
doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0 /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc
doctest (post)> copying 2 paths...
doctest (post)> copying path '/nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc' to 'https://cache.nix-ci.com'...
doctest (post)> copying path '/nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0' to 'https://cache.nix-ci.com'...
doctest (post)> copying 1 paths...
doctest (post)> copying path '/nix/store/1bbbf2pxm0al5ygvbhwqqpg13x7553hl-doctest-0.24.0.drv' to 'https://cache.nix-ci.com'...
doctest (post)> added 0 signatures
doctest (post)> added 0 signatures
doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0 /nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc
doctest (post)> copying 2 paths...
doctest (post)> copying path '/nix/store/zla0sddywpsyh56hyyc8gqvjr6dhvis3-doctest-0.24.0-doc' to 'ssh-ng://worker.nix-ci.com'...
doctest (post)> copying path '/nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0' to 'ssh-ng://worker.nix-ci.com'...
doctest (post)> copying 1 paths...
doctest (post)> copying path '/nix/store/1bbbf2pxm0al5ygvbhwqqpg13x7553hl-doctest-0.24.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/c8w477i1w49hik4dzmmdz8izdfda15jm-no-recursion-0.3.0.0.drv'...
building '/nix/store/pzavabz5kv6jy3qyvi95yw4vvmax5k0i-vector-0.13.2.0.drv'...
no-recursion> Running phase: setupCompilerEnvironmentPhase
no-recursion> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
vector> Running phase: setupCompilerEnvironmentPhase
vector> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
no-recursion> Running phase: unpackPhase
no-recursion> unpacking source archive /nix/store/m17m98cfs3z832acdfkbis1jvgl60n38-source
no-recursion> source root is source
no-recursion> Running phase: patchPhase
no-recursion> Running phase: compileBuildDriverPhase
no-recursion> setupCompileFlags: -package-db=/build/tmp.VKtOHdvNUp/setup-package.conf.d -threaded
no-recursion> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.VKtOHdvNUp/Main.o )
vector> Running phase: unpackPhase
no-recursion> [2 of 2] Linking Setup
vector> unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
vector> source root is vector-0.13.2.0
vector> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
vector> Running phase: patchPhase
vector> Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
vector> Run jailbreak-cabal to lift version restrictions on build inputs.
vector> Running phase: compileBuildDriverPhase
vector> setupCompileFlags: -package-db=/build/tmp.4gAe9GBhMS/setup-package.conf.d -threaded
vector> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.4gAe9GBhMS/Main.o )
vector> [2 of 2] Linking Setup
no-recursion> Running phase: updateAutotoolsGnuConfigScriptsPhase
no-recursion> Running phase: configurePhase
no-recursion> configureFlags: --verbose --prefix=/nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc/share/doc/no-recursion-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.VKtOHdvNUp/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/lib
no-recursion> Using Parsec parser
no-recursion> Configuring no-recursion-0.3.0.0...
no-recursion> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
no-recursion> 'ghc' version < 9.12):
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
no-recursion> 9.12.1
vector> Running phase: updateAutotoolsGnuConfigScriptsPhase
vector> Running phase: configurePhase
vector> configureFlags: --verbose --prefix=/nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.4gAe9GBhMS/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/lib
vector> Using Parsec parser
vector> Configuring vector-0.13.2.0...
vector> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
vector> 'ghc' version < 9.12):
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
vector> 9.12.1
no-recursion> Flags chosen: noisy-deprecations=True
vector> Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
vector> wall=False
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.21.0.0
no-recursion> Dependency ghc >=9.6.1 && <9.7 || >=9.8.1 && <9.9 || >=9.10.1 && <9.11 ||
no-recursion> >=9.12.1 && <9.13: using ghc-9.12.1
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.21.0.0
no-recursion> Dependency doctest >=0.21.1 && <0.22 || >=0.22.2 && <0.23 || >=0.24.0 &&
no-recursion> <0.25: using doctest-0.24.0
no-recursion> Dependency no-recursion: using no-recursion-0.3.0.0
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.21.0.0
no-recursion> Dependency no-recursion: using no-recursion-0.3.0.0
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.21.0.0
no-recursion> Dependency no-recursion: using no-recursion-0.3.0.0
no-recursion> Source component graph:
no-recursion>     component lib
no-recursion>     component test:annotations dependency lib
no-recursion>     component test:doctests dependency lib
no-recursion>     component test:no-ignore-annotations dependency lib
no-recursion> Configured component graph:
no-recursion>     component no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include ghc-9.12.1-f739
no-recursion>     component no-recursion-0.3.0.0-85PZeyOfcA14gM3RqwTYvb-annotations
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>     component no-recursion-0.3.0.0-5RyBPfEcty79mladZegHeE-doctests
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
no-recursion>         include no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>     component no-recursion-0.3.0.0-K0FDczeSZniB0cOCX0R6Zq-no-ignore-annotations
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion> Linked component graph:
no-recursion>     unit no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include ghc-9.12.1-f739
no-recursion>         NoRecursion=no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq:NoRecursion
no-recursion>     unit no-recursion-0.3.0.0-85PZeyOfcA14gM3RqwTYvb-annotations
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>     unit no-recursion-0.3.0.0-5RyBPfEcty79mladZegHeE-doctests
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
no-recursion>         include no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>     unit no-recursion-0.3.0.0-K0FDczeSZniB0cOCX0R6Zq-no-ignore-annotations
no-recursion>         include base-4.21.0.0-f068
no-recursion>         include no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion> Ready component graph:
no-recursion>     definite no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>         depends base-4.21.0.0-f068
no-recursion>         depends ghc-9.12.1-f739
no-recursion>     definite no-recursion-0.3.0.0-K0FDczeSZniB0cOCX0R6Zq-no-ignore-annotations
no-recursion>         depends base-4.21.0.0-f068
no-recursion>         depends no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>     definite no-recursion-0.3.0.0-85PZeyOfcA14gM3RqwTYvb-annotations
no-recursion>         depends base-4.21.0.0-f068
no-recursion>         depends no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion>     definite no-recursion-0.3.0.0-5RyBPfEcty79mladZegHeE-doctests
no-recursion>         depends base-4.21.0.0-f068
no-recursion>         depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
no-recursion>         depends no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion> Using Cabal-3.14.1.0 compiled by ghc-9.12
no-recursion> Using compiler: ghc-9.12.1
no-recursion> Using install prefix:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0
no-recursion> Executables installed in:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/bin
no-recursion> Libraries installed in:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion> Dynamic Libraries installed in:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
no-recursion> Private executables installed in:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/libexec/x86_64-linux-ghc-9.12.1-f739/no-recursion-0.3.0.0
no-recursion> Data files installed in:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/share/x86_64-linux-ghc-9.12.1-f739/no-recursion-0.3.0.0
no-recursion> Documentation installed in:
no-recursion> /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc/share/doc/no-recursion-0.3.0.0
no-recursion> Configuration files installed in:
no-recursion> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/etc
no-recursion> No alex found
no-recursion> Using ar found on system at:
no-recursion> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
no-recursion> No c2hs found
no-recursion> No cpphs found
no-recursion> Using doctest version 0.24.0 found on system at:
no-recursion> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin/doctest
no-recursion> Using gcc version 14.3.0 given by user at:
no-recursion> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
no-recursion> Using ghc version 9.12.1 found on system at:
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
no-recursion> Using ghc-pkg version 9.12.1 found on system at:
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
no-recursion> No ghcjs found
no-recursion> No ghcjs-pkg found
no-recursion> No greencard found
no-recursion> Using haddock version 2.30.0 found on system at:
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
no-recursion> No happy found
no-recursion> No haskell-suite found
no-recursion> No haskell-suite-pkg found
no-recursion> No hmake found
no-recursion> Using hpc version 0.69 found on system at:
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
no-recursion> Using hsc2hs version 0.68.10 found on system at:
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
no-recursion> Using hscolour version 1.25 found on system at:
no-recursion> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
no-recursion> No jhc found
no-recursion> Using ld found on system at:
no-recursion> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
no-recursion> No pkg-config found
no-recursion> Using runghc version 9.12.1 found on system at:
no-recursion> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
no-recursion> Using strip version 2.44 found on system at:
no-recursion> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
no-recursion> Using tar found on system at:
no-recursion> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
no-recursion> No uhc found
no-recursion> Running phase: buildPhase
vector> Dependency base: using base-4.21.0.0
vector> Dependency deepseq: using deepseq-1.5.1.0
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency vector-stream: using vector-stream-0.1.0.1
vector> Dependency base: using base-4.21.0.0
vector> Dependency random: using random-1.2.1.3
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency QuickCheck: using QuickCheck-2.14.3
vector> Dependency base: using base-4.21.0.0
vector> Dependency base-orphans: using base-orphans-0.9.3
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency random: using random-1.2.1.3
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency tasty-hunit: using tasty-hunit-0.10.2
vector> Dependency tasty-quickcheck: using tasty-quickcheck-0.11
vector> Dependency template-haskell: using template-haskell-2.23.0.0
vector> Dependency transformers: using transformers-0.6.1.2
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency QuickCheck: using QuickCheck-2.14.3
vector> Dependency base: using base-4.21.0.0
vector> Dependency base-orphans: using base-orphans-0.9.3
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency random: using random-1.2.1.3
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency tasty-hunit: using tasty-hunit-0.10.2
vector> Dependency tasty-quickcheck: using tasty-quickcheck-0.11
vector> Dependency template-haskell: using template-haskell-2.23.0.0
vector> Dependency transformers: using transformers-0.6.1.2
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency base: using base-4.21.0.0
vector> Dependency doctest: using doctest-0.24.0
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency base: using base-4.21.0.0
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
vector> Dependency vector: using vector-0.13.2.0
vector> Source component graph:
vector>     component lib
vector>     component lib:benchmarks-O2 dependency lib
vector>     component test:vector-doctest dependency lib
vector>     component test:vector-inspection dependency lib
vector>     component test:vector-tests-O0 dependency lib
vector>     component test:vector-tests-O2 dependency lib
vector> Configured component graph:
vector>     component vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>         include base-4.21.0.0-f068
vector>         include deepseq-1.5.1.0-b096
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include vector-stream-0.1.0.1-G0zZZSuAhT9ECGcE55QRHQ
vector>     component vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
vector>         include base-4.21.0.0-f068
vector>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     component vector-0.13.2.0-2VXnVSJJbVuAMvmzjCulzX-vector-doctest
vector>         include base-4.21.0.0-f068
vector>         include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     component vector-0.13.2.0-HKLeEHgySYx3YgE83tDvaW-vector-inspection
vector>         include base-4.21.0.0-f068
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include tasty-inspection-testing-0.2.1-KAFwYZWrVYDJZ1LcRXRNLo
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     component vector-0.13.2.0-BM007pTARkY2AmoQNselFw-vector-tests-O0
vector>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
vector>         include base-4.21.0.0-f068
vector>         include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
vector>         include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
vector>         include template-haskell-2.23.0.0-125a
vector>         include transformers-0.6.1.2-199f
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     component vector-0.13.2.0-LdCCbDjYvxjD85WNwVzEVu-vector-tests-O2
vector>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
vector>         include base-4.21.0.0-f068
vector>         include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
vector>         include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
vector>         include template-haskell-2.23.0.0-125a
vector>         include transformers-0.6.1.2-199f
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector> Linked component graph:
vector>     unit vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>         include base-4.21.0.0-f068
vector>         include deepseq-1.5.1.0-b096
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include vector-stream-0.1.0.1-G0zZZSuAhT9ECGcE55QRHQ
vector>         Data.Vector=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Unboxed.Mutable
vector>     unit vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
vector>         include base-4.21.0.0-f068
vector>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
no-recursion> Preprocessing library for no-recursion-0.3.0.0...
no-recursion> Building library for no-recursion-0.3.0.0...
vector>         Bench.Vector.Algo.AwShCC=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.TestData.ParenTree
vector>     unit vector-0.13.2.0-2VXnVSJJbVuAMvmzjCulzX-vector-doctest
vector>         include base-4.21.0.0-f068
vector>         include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     unit vector-0.13.2.0-HKLeEHgySYx3YgE83tDvaW-vector-inspection
vector>         include base-4.21.0.0-f068
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include tasty-inspection-testing-0.2.1-KAFwYZWrVYDJZ1LcRXRNLo
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     unit vector-0.13.2.0-BM007pTARkY2AmoQNselFw-vector-tests-O0
vector>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
vector>         include base-4.21.0.0-f068
vector>         include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
vector>         include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
vector>         include template-haskell-2.23.0.0-125a
vector>         include transformers-0.6.1.2-199f
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     unit vector-0.13.2.0-LdCCbDjYvxjD85WNwVzEVu-vector-tests-O2
vector>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
vector>         include base-4.21.0.0-f068
vector>         include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
vector>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
vector>         include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
vector>         include template-haskell-2.23.0.0-125a
vector>         include transformers-0.6.1.2-199f
vector>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector> Ready component graph:
vector>     definite vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>         depends base-4.21.0.0-f068
vector>         depends deepseq-1.5.1.0-b096
vector>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         depends vector-stream-0.1.0.1-G0zZZSuAhT9ECGcE55QRHQ
vector>     definite vector-0.13.2.0-LdCCbDjYvxjD85WNwVzEVu-vector-tests-O2
vector>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
vector>         depends base-4.21.0.0-f068
vector>         depends base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
vector>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         depends tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
vector>         depends tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
vector>         depends template-haskell-2.23.0.0-125a
vector>         depends transformers-0.6.1.2-199f
vector>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     definite vector-0.13.2.0-HKLeEHgySYx3YgE83tDvaW-vector-inspection
vector>         depends base-4.21.0.0-f068
vector>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         depends tasty-inspection-testing-0.2.1-KAFwYZWrVYDJZ1LcRXRNLo
vector>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     definite vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
vector>         depends base-4.21.0.0-f068
vector>         depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     definite vector-0.13.2.0-BM007pTARkY2AmoQNselFw-vector-tests-O0
vector>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
vector>         depends base-4.21.0.0-f068
vector>         depends base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
vector>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
vector>         depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
vector>         depends tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
vector>         depends tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
vector>         depends template-haskell-2.23.0.0-125a
vector>         depends transformers-0.6.1.2-199f
vector>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector>     definite vector-0.13.2.0-2VXnVSJJbVuAMvmzjCulzX-vector-doctest
vector>         depends base-4.21.0.0-f068
vector>         depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
vector>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
vector>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector> Using Cabal-3.14.1.0 compiled by ghc-9.12
vector> Using compiler: ghc-9.12.1
vector> Using install prefix:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0
vector> Executables installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/bin
vector> Libraries installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector> Dynamic Libraries installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
vector> Private executables installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0
vector> Data files installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/share/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0
vector> Documentation installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0
vector> Configuration files installed in:
vector> /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/etc
vector> No alex found
vector> Using ar found on system at:
vector> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
vector> No c2hs found
vector> No cpphs found
vector> Using doctest version 0.24.0 found on system at:
vector> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/bin/doctest
vector> Using gcc version 14.3.0 given by user at:
vector> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
vector> Using ghc version 9.12.1 found on system at:
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
vector> Using ghc-pkg version 9.12.1 found on system at:
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
vector> No ghcjs found
vector> No ghcjs-pkg found
vector> No greencard found
vector> Using haddock version 2.30.0 found on system at:
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
vector> No happy found
vector> No haskell-suite found
vector> No haskell-suite-pkg found
vector> No hmake found
vector> Using hpc version 0.69 found on system at:
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
vector> Using hsc2hs version 0.68.10 found on system at:
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
vector> Using hscolour version 1.25 found on system at:
vector> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
vector> No jhc found
vector> Using ld found on system at:
vector> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
vector> No pkg-config found
vector> Using runghc version 9.12.1 found on system at:
vector> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
vector> Using strip version 2.44 found on system at:
vector> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
vector> Using tar found on system at:
vector> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
vector> No uhc found
no-recursion> [1 of 2] Compiling PluginUtils      ( src/PluginUtils.hs, dist/build/PluginUtils.o, dist/build/PluginUtils.dyn_o )
vector> Running phase: buildPhase
vector> Preprocessing library for vector-0.13.2.0...
vector> Building library for vector-0.13.2.0...
vector> [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
vector> [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o, dist/build/Data/Vector/Fusion/Util.dyn_o )
vector> [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.o, dist/build/Data/Vector/Fusion/Bundle/Size.dyn_o )
no-recursion> [2 of 2] Compiling NoRecursion      ( src/NoRecursion.hs, dist/build/NoRecursion.o, dist/build/NoRecursion.dyn_o )
vector> [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o, dist/build/Data/Vector/Generic/Mutable/Base.dyn_o )
vector> [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.o, dist/build/Data/Vector/Generic/Base.dyn_o )
vector> [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.o, dist/build/Data/Vector/Internal/Check.dyn_o )
vector> [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o, dist/build/Data/Vector/Fusion/Bundle/Monadic.dyn_o )
no-recursion> [1 of 2] Compiling PluginUtils      ( src/PluginUtils.hs, dist/build/PluginUtils.p_o )
no-recursion> [2 of 2] Compiling NoRecursion      ( src/NoRecursion.hs, dist/build/NoRecursion.p_o )
no-recursion> Preprocessing test suite 'no-ignore-annotations' for no-recursion-0.3.0.0...
no-recursion> Building test suite 'no-ignore-annotations' for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling Test.IgnoreDefaultImpls ( tests/no-ignore/Test/IgnoreDefaultImpls.hs, dist/build/no-ignore-annotations/no-ignore-annotations-tmp/Test/IgnoreDefaultImpls.o )
vector> [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.o, dist/build/Data/Vector/Fusion/Bundle.dyn_o )
no-recursion> [2 of 2] Compiling Main             ( tests/no-ignore/test.hs, dist/build/no-ignore-annotations/no-ignore-annotations-tmp/Main.o )
no-recursion> [3 of 3] Linking dist/build/no-ignore-annotations/no-ignore-annotations
no-recursion> Preprocessing test suite 'annotations' for no-recursion-0.3.0.0...
no-recursion> Building test suite 'annotations' for no-recursion-0.3.0.0...
no-recursion> [1 of 6] Compiling Test.AllowRecursion ( tests/ignore/Test/AllowRecursion.hs, dist/build/annotations/annotations-tmp/Test/AllowRecursion.o )
no-recursion> [2 of 6] Compiling Test.AnnModule   ( tests/ignore/Test/AnnModule.hs, dist/build/annotations/annotations-tmp/Test/AnnModule.o )
no-recursion> [3 of 6] Compiling Test.AnnName     ( tests/ignore/Test/AnnName.hs, dist/build/annotations/annotations-tmp/Test/AnnName.o )
no-recursion> [4 of 6] Compiling Test.IgnoreDefaultImpls ( tests/ignore/Test/IgnoreDefaultImpls.hs, dist/build/annotations/annotations-tmp/Test/IgnoreDefaultImpls.o )
no-recursion> [5 of 6] Compiling Test.UnannName   ( tests/ignore/Test/UnannName.hs, dist/build/annotations/annotations-tmp/Test/UnannName.o )
no-recursion> [6 of 6] Compiling Main             ( tests/ignore/test.hs, dist/build/annotations/annotations-tmp/Main.o )
no-recursion> [7 of 7] Linking dist/build/annotations/annotations
vector> [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o, dist/build/Data/Vector/Generic/Mutable.dyn_o )
no-recursion> Preprocessing test suite 'doctests' for no-recursion-0.3.0.0...
no-recursion> Building test suite 'doctests' for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling Build_doctests   ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
no-recursion> [2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
no-recursion> [3 of 3] Linking dist/build/doctests/doctests
vector> [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.o, dist/build/Data/Vector/Generic/New.dyn_o )
vector> [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.o, dist/build/Data/Vector/Generic.dyn_o )
no-recursion> Running phase: checkPhase
no-recursion> Running 3 test suites...
no-recursion> Test suite no-ignore-annotations: RUNNING...
no-recursion> Test suite no-ignore-annotations: PASS
no-recursion> Test suite logged to: dist/test/no-recursion-0.3.0.0-no-ignore-annotations.log
no-recursion> Test suite annotations: RUNNING...
no-recursion> Test suite annotations: PASS
no-recursion> Test suite logged to: dist/test/no-recursion-0.3.0.0-annotations.log
no-recursion> Test suite doctests: RUNNING...
no-recursion> Examples: 0  Tried: 0  Errors: 0  Failures: 0
no-recursion> Test suite doctests: PASS
no-recursion> Test suite logged to: dist/test/no-recursion-0.3.0.0-doctests.log
no-recursion> 3 of 3 test suites (3 of 3 test cases) passed.
no-recursion> Running phase: haddockPhase
no-recursion> Preprocessing library for no-recursion-0.3.0.0...
no-recursion> Running Haddock on library for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling PluginUtils      ( src/PluginUtils.hs, nothing ) [HIE file is missing]
no-recursion> [2 of 2] Compiling NoRecursion      ( src/NoRecursion.hs, nothing ) [HIE file is missing]
no-recursion> Haddock coverage:
no-recursion> Warning: ':' is out of scope.
no-recursion>     If you qualify the identifier, haddock can try to link it anyway.
no-recursion> Warning: 'fst' is out of scope.
no-recursion>     If you qualify the identifier, haddock can try to link it anyway.
no-recursion> Warning: 'Opts' is ambiguous. It is defined
no-recursion>     * at src/NoRecursion.hs:50:13
no-recursion>     * at src/NoRecursion.hs:50:1
no-recursion>     You may be able to disambiguate the identifier by qualifying it or
no-recursion>     by specifying the type/value namespace explicitly.
no-recursion>     Defaulting to the one defined at src/NoRecursion.hs:50:1
no-recursion>  100% (  2 /  2) in 'NoRecursion'
vector> [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o, dist/build/Data/Vector/Mutable.dyn_o )
vector> src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘MVector’
vector>    |
vector> 99 |         deriving ( Typeable )
vector>    |                    ^^^^^^^^
vector> 
vector> [13 of 23] Compiling Data.Vector      ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
vector> src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘Vector’
vector>     |
vector> 222 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o, dist/build/Data/Vector/Primitive/Mutable.dyn_o )
vector> src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘MVector’
vector>     |
vector> 115 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o, dist/build/Data/Vector/Primitive.dyn_o )
vector> src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘Vector’
vector>     |
vector> 209 |   deriving ( Typeable )
vector>     |              ^^^^^^^^
vector> 
vector> [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o, dist/build/Data/Vector/Storable/Internal.dyn_o )
vector> [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o, dist/build/Data/Vector/Storable/Mutable.dyn_o )
vector> src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘MVector’
vector>     |
vector> 134 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o, dist/build/Data/Vector/Storable.dyn_o )
vector> src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘Vector’
vector>     |
vector> 219 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
no-recursion> Documentation created: dist/doc/html/no-recursion,
no-recursion> dist/doc/html/no-recursion/no-recursion.txt
vector> [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.o, dist/build/Data/Vector/Strict/Mutable.dyn_o )
vector> src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the newtype declaration for ‘MVector’
vector>    |
vector> 97 |         deriving ( Typeable )
vector>    |                    ^^^^^^^^
vector> 
vector> [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.o, dist/build/Data/Vector/Strict.dyn_o )
vector> src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the newtype declaration for ‘Vector’
vector>     |
vector> 221 |   deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
vector>     |             ^^^^^^^^
vector> 
no-recursion> Preprocessing test suite 'no-ignore-annotations' for no-recursion-0.3.0.0...
no-recursion> Preprocessing test suite 'annotations' for no-recursion-0.3.0.0...
no-recursion> Preprocessing test suite 'doctests' for no-recursion-0.3.0.0...
no-recursion> Running phase: installPhase
no-recursion> Installing library in /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/no-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq
no-recursion> Running phase: fixupPhase
no-recursion> shrinking RPATHs of ELF executables and libraries in /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0
no-recursion> shrinking /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSno-recursion-0.3.0.0-BNHnyD18Xll9g6hHJBJIWq-ghc9.12.1.so
no-recursion> checking for references to /build/ in /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0...
no-recursion> patching script interpreter paths in /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0
no-recursion> stripping (with command strip and flags -S -p) in  /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/lib
no-recursion> shrinking RPATHs of ELF executables and libraries in /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc
no-recursion> checking for references to /build/ in /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc...
no-recursion> patching script interpreter paths in /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc
no-recursion (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0 /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc
no-recursion (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
no-recursion (post)> 
no-recursion (post)> Pushing /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0 (607.79 KiB)
no-recursion (post)> Pushing /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc (335.85 KiB)
no-recursion (post)> 
no-recursion (post)> All done.
no-recursion (post)> added 2 signatures
no-recursion (post)> added 1 signatures
no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0 /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc
no-recursion (post)> copying 2 paths...
no-recursion (post)> copying path '/nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
no-recursion (post)> copying path '/nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0' to 'https://cache.nix-ci.com'...
no-recursion (post)> copying 1 paths...
no-recursion (post)> copying path '/nix/store/c8w477i1w49hik4dzmmdz8izdfda15jm-no-recursion-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
no-recursion (post)> added 0 signatures
no-recursion (post)> added 0 signatures
no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0 /nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc
no-recursion (post)> copying 2 paths...
no-recursion (post)> copying path '/nix/store/wh1nng47r3sr4lcfy00761nxm4fmd0dp-no-recursion-0.3.0.0-doc' to 'ssh-ng://worker.nix-ci.com'...
no-recursion (post)> copying path '/nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0' to 'ssh-ng://worker.nix-ci.com'...
no-recursion (post)> copying 1 paths...
no-recursion (post)> copying path '/nix/store/c8w477i1w49hik4dzmmdz8izdfda15jm-no-recursion-0.3.0.0.drv' to 'ssh-ng://worker.nix-ci.com'...
vector> [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o, dist/build/Data/Vector/Unboxed/Base.dyn_o )
vector> src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the stand-alone deriving instance for ‘Typeable Vector’
vector>    |
vector> 97 | deriving instance Typeable Vector
vector>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
vector> 
vector> src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the stand-alone deriving instance for ‘Typeable MVector’
vector>    |
vector> 98 | deriving instance Typeable MVector
vector>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
vector> 
vector> [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o, dist/build/Data/Vector/Unboxed.dyn_o )
vector> [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o, dist/build/Data/Vector/Unboxed/Mutable.dyn_o )
vector> [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.p_o )
vector> [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
vector> [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.p_o )
vector> [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
vector> [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
vector> [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
vector> [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
vector> [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
vector> [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
vector> [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
vector> [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
vector> [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
vector> src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘MVector’
vector>    |
vector> 99 |         deriving ( Typeable )
vector>    |                    ^^^^^^^^
vector> 
vector> [13 of 23] Compiling Data.Vector      ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
vector> src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘Vector’
vector>     |
vector> 222 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
vector> src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘MVector’
vector>     |
vector> 115 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
vector> src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘Vector’
vector>     |
vector> 209 |   deriving ( Typeable )
vector>     |              ^^^^^^^^
vector> 
vector> [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
vector> [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
vector> src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘MVector’
vector>     |
vector> 134 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
vector> src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the data declaration for ‘Vector’
vector>     |
vector> 219 |         deriving ( Typeable )
vector>     |                    ^^^^^^^^
vector> 
vector> [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
vector> src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the newtype declaration for ‘MVector’
vector>    |
vector> 97 |         deriving ( Typeable )
vector>    |                    ^^^^^^^^
vector> 
vector> [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
vector> src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the newtype declaration for ‘Vector’
vector>     |
vector> 221 |   deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
vector>     |             ^^^^^^^^
vector> 
vector> [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
vector> src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the stand-alone deriving instance for ‘Typeable Vector’
vector>    |
vector> 97 | deriving instance Typeable Vector
vector>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
vector> 
vector> src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
vector>     • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
vector>     • In the stand-alone deriving instance for ‘Typeable MVector’
vector>    |
vector> 98 | deriving instance Typeable MVector
vector>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
vector> 
vector> [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
vector> [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
vector> Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
vector> Building test suite 'vector-tests-O2' for vector-0.13.2.0...
vector> [ 1 of 12] Compiling Boilerplater     ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
vector> [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
vector> [ 3 of 12] Compiling Utilities        ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
vector> tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 244 | postscanl f z = tail . scanl f z
vector>     |                 ^^^^
vector> 
vector> tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 245 | prescanr f z = tail . scanr f z
vector>     |                ^^^^
vector> 
vector> [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
vector> tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 243 |     prop_head      :: P (v a -> a) = not . V.null ===> V.head `eq` head
vector>     |                                                                    ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 256 |     prop_unsafeHead  :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
vector>     |                                                                            ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 272 |     prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
vector>     |                                                                 ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 439 |       = V.uniq `eq` (map head . group)
vector>     |                          ^^^^
vector> 
vector> [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
vector> [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.dyn_o )
vector> [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
vector> [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.dyn_o )
vector> [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.dyn_o )
vector> [10 of 12] Compiling Tests.Move       ( tests/Tests/Move.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.dyn_o )
vector> [11 of 12] Compiling Tests.Bundle     ( tests/Tests/Bundle.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.dyn_o )
vector> tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
vector>     The import of ‘foldl'’ from module ‘Data.List’ is redundant
vector>    |
vector> 16 | import Data.List           (foldl', foldl1', unfoldr, find, findIndex)
vector>    |                             ^^^^^^
vector> 
vector> tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>    |
vector> 76 |     prop_head      :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
vector>    |                                                                             ^^^^
vector> 
vector> tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>    |
vector> 92 |     prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
vector>    |                                                                                   ^^^^
vector> 
vector> [12 of 12] Compiling Main             ( tests/Main.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.dyn_o )
vector> [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
vector> Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
vector> Building test suite 'vector-inspection' for vector-0.13.2.0...
vector> [1 of 4] Compiling Inspect          ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
vector> [2 of 4] Compiling Inspect.DerivingVia.OtherFoo ( tests-inspect/Inspect/DerivingVia/OtherFoo.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.dyn_o )
vector> [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
vector> [4 of 4] Compiling Main             ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
vector> [5 of 5] Linking dist/build/vector-inspection/vector-inspection
vector> Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
vector> Building library 'benchmarks-O2' for vector-0.13.2.0...
vector> [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.dyn_o )
vector> [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.o, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.dyn_o )
vector> [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.dyn_o )
vector> [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.dyn_o )
vector> [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.o, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.dyn_o )
vector> [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.o, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.dyn_o )
vector> [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.o, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.dyn_o )
vector> [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.dyn_o )
vector> [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.dyn_o )
vector> [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.dyn_o )
vector> [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.dyn_o )
vector> [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.o, dist/build/benchmarks-O2/Bench/Vector/Tasty.dyn_o )
vector> [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.o, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.dyn_o )
vector> [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.o, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.dyn_o )
vector> [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
vector> [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
vector> [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
vector> [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
vector> [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
vector> [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
vector> [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
vector> [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
vector> [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
vector> [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
vector> [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
vector> [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
vector> [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
vector> [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
vector> Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
vector> Building test suite 'vector-tests-O0' for vector-0.13.2.0...
vector> [ 1 of 12] Compiling Boilerplater     ( tests/Boilerplater.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.dyn_o )
vector> [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.dyn_o )
vector> [ 3 of 12] Compiling Utilities        ( tests/Utilities.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.dyn_o )
vector> tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 244 | postscanl f z = tail . scanl f z
vector>     |                 ^^^^
vector> 
vector> tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 245 | prescanr f z = tail . scanr f z
vector>     |                ^^^^
vector> 
vector> [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.dyn_o )
vector> tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 243 |     prop_head      :: P (v a -> a) = not . V.null ===> V.head `eq` head
vector>     |                                                                    ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 256 |     prop_unsafeHead  :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
vector>     |                                                                            ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 272 |     prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
vector>     |                                                                 ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>     |
vector> 439 |       = V.uniq `eq` (map head . group)
vector>     |                          ^^^^
vector> 
vector> [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.dyn_o )
vector> [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.dyn_o )
vector> [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.dyn_o )
vector> [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.dyn_o )
vector> [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.dyn_o )
vector> [10 of 12] Compiling Tests.Move       ( tests/Tests/Move.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.dyn_o )
vector> [11 of 12] Compiling Tests.Bundle     ( tests/Tests/Bundle.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.dyn_o )
vector> tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
vector>     The import of ‘foldl'’ from module ‘Data.List’ is redundant
vector>    |
vector> 16 | import Data.List           (foldl', foldl1', unfoldr, find, findIndex)
vector>    |                             ^^^^^^
vector> 
vector> tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>    |
vector> 76 |     prop_head      :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
vector>    |                                                                             ^^^^
vector> 
vector> tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.Internal.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
vector>    |
vector> 92 |     prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
vector>    |                                                                                   ^^^^
vector> 
vector> [12 of 12] Compiling Main             ( tests/Main.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.dyn_o )
vector> [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
vector> Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
vector> Building test suite 'vector-doctest' for vector-0.13.2.0...
vector> [1 of 1] Compiling Main             ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
vector> [2 of 2] Linking dist/build/vector-doctest/vector-doctest
vector> buildPhase completed in 2 minutes 3 seconds
vector> Running phase: checkPhase
vector> Running 2 test suites...
vector> Test suite vector-tests-O0: RUNNING...
vector> toplevel
vector>   Data.Vector.Fusion.Bundle
vector>     fromList.toList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     toList.fromList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     eq:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>     length:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     null:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     empty:                                                                 OK
vector>       +++ OK, passed 1 test.
vector>     singleton:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     replicate:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     cons:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     snoc:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     append:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     head:                                                                  OK
vector>       +++ OK, passed 100 tests; 12 discarded.
vector>     last:                                                                  OK
vector>       +++ OK, passed 100 tests; 14 discarded.
vector>     index:                                                                 OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     extract:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     init:                                                                  OK
vector>       +++ OK, passed 100 tests; 18 discarded.
vector>     tail:                                                                  OK
vector>       +++ OK, passed 100 tests; 18 discarded.
vector>     take:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     drop:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     map:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith3:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     filter:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     takeWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     dropWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     elem:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     notElem:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     find:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     findIndex:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     foldl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1:                                                                OK
vector>       +++ OK, passed 100 tests; 17 discarded.
vector>     foldl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1':                                                               OK
vector>       +++ OK, passed 100 tests; 13 discarded.
vector>     foldr:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldr1:                                                                OK
vector>       +++ OK, passed 100 tests; 13 discarded.
vector>     prescanl:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     prescanl':                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl':                                                            OK
vector>       +++ OK, passed 100 tests.
vector>     scanl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     scanl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     scanl1:                                                                OK
vector>       +++ OK, passed 100 tests; 22 discarded.
vector>     scanl1':                                                               OK
vector>       +++ OK, passed 100 tests; 22 discarded.
vector>     concatMap:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     unfoldr:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     and:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     or:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>   Tests.Vector.Boxed
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Primitive
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     Double
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 3 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Storable
vector>     Data.Vector.Storable.Vector (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 28 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 30 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>     Data.Vector.Storable.Vector (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 1 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Strict
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 27 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Unboxed
vector>     ()
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.06s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>     (Float)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 27 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 2 discarded.
vector>     (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.07s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 6 discarded.
vector>     (Int,Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 27 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.06s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Int,Bool,Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.06s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.07s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.06s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.06s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Data.Vector.Storable.Vector Alignment
vector>     Aligned Double:                                                        OK
vector>     Aligned Int:                                                           OK
vector>   Regression tests
vector>     enumFromTo crash #188
vector>       Word8:                                                               OK
vector>       Word16:                                                              OK
vector>       Word32:                                                              OK
vector>       Word64:                                                              OK
vector>       Word:                                                                OK
vector>       Int8:                                                                OK
vector>       Int16:                                                               OK
vector>       Int32:                                                               OK
vector>       Int64:                                                               OK
vector>       Int:                                                                 OK
vector>       Char:                                                                OK
vector>   Negative tests
vector>     slice out of bounds #257
vector>       Boxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Primitive
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Storable
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Unboxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>     take #282
vector>       Boxed:                                                               OK
vector>       Primitive:                                                           OK
vector>       Storable:                                                            OK
vector>       Unboxed:                                                             OK
vector>   Data.Vector
vector>     MonadFix:                                                              OK
vector>     toFromArray:                                                           OK
vector>     toFromArraySlice:                                                      OK
vector>     toFromArraySliceUnsafe:                                                OK
vector>     toFromMutableArray:                                                    OK
vector>   Data.Vector.Mutable (Move):                                              OK
vector>     +++ OK, passed 100 tests; 15 discarded.
vector>   Data.Vector.Primitive.Mutable (Move):                                    OK
vector>     +++ OK, passed 100 tests; 14 discarded.
vector>   Data.Vector.Unboxed.Mutable (Move):                                      OK
vector>     +++ OK, passed 100 tests; 19 discarded.
vector>   Data.Vector.Storable.Mutable (Move):                                     OK
vector>     +++ OK, passed 100 tests; 14 discarded.
vector>   Data.Vector.Generic.Mutable (nextPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (prevPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector>   Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector> 
vector> All 2808 tests passed (14.42s)
vector> Test suite vector-tests-O0: PASS
vector> Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
vector> Test suite vector-tests-O2: RUNNING...
vector> toplevel
vector>   Data.Vector.Fusion.Bundle
vector>     fromList.toList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     toList.fromList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     eq:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>     length:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     null:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     empty:                                                                 OK
vector>       +++ OK, passed 1 test.
vector>     singleton:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     replicate:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     cons:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     snoc:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     append:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     head:                                                                  OK
vector>       +++ OK, passed 100 tests; 14 discarded.
vector>     last:                                                                  OK
vector>       +++ OK, passed 100 tests; 17 discarded.
vector>     index:                                                                 OK
vector>       +++ OK, passed 100 tests; 17 discarded.
vector>     extract:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     init:                                                                  OK
vector>       +++ OK, passed 100 tests; 17 discarded.
vector>     tail:                                                                  OK
vector>       +++ OK, passed 100 tests; 16 discarded.
vector>     take:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     drop:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     map:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith3:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     filter:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     takeWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     dropWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     elem:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     notElem:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     find:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     findIndex:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     foldl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1:                                                                OK
vector>       +++ OK, passed 100 tests; 19 discarded.
vector>     foldl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1':                                                               OK
vector>       +++ OK, passed 100 tests; 23 discarded.
vector>     foldr:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldr1:                                                                OK
vector>       +++ OK, passed 100 tests; 16 discarded.
vector>     prescanl:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     prescanl':                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl':                                                            OK
vector>       +++ OK, passed 100 tests.
vector>     scanl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     scanl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     scanl1:                                                                OK
vector>       +++ OK, passed 100 tests; 19 discarded.
vector>     scanl1':                                                               OK
vector>       +++ OK, passed 100 tests; 14 discarded.
vector>     concatMap:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     unfoldr:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     and:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     or:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>   Tests.Vector.Boxed
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Primitive
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>     Double
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 3 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Storable
vector>     Data.Vector.Storable.Vector (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>     Data.Vector.Storable.Vector (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 1 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Strict
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Unboxed
vector>     ()
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     (Float)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 25 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 3 discarded.
vector>     (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 25 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>     (Int,Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Int,Bool,Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.06s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr':                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Data.Vector.Storable.Vector Alignment
vector>     Aligned Double:                                                        OK
vector>     Aligned Int:                                                           OK
vector>   Regression tests
vector>     enumFromTo crash #188
vector>       Word8:                                                               OK
vector>       Word16:                                                              OK
vector>       Word32:                                                              OK
vector>       Word64:                                                              OK
vector>       Word:                                                                OK
vector>       Int8:                                                                OK
vector>       Int16:                                                               OK
vector>       Int32:                                                               OK
vector>       Int64:                                                               OK
vector>       Int:                                                                 OK
vector>       Char:                                                                OK
vector>   Negative tests
vector>     slice out of bounds #257
vector>       Boxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Primitive
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Storable
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Unboxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>     take #282
vector>       Boxed:                                                               OK
vector>       Primitive:                                                           OK
vector>       Storable:                                                            OK
vector>       Unboxed:                                                             OK
vector>   Data.Vector
vector>     MonadFix:                                                              OK
vector>     toFromArray:                                                           OK
vector>     toFromArraySlice:                                                      OK
vector>     toFromArraySliceUnsafe:                                                OK
vector>     toFromMutableArray:                                                    OK
vector>   Data.Vector.Mutable (Move):                                              OK
vector>     +++ OK, passed 100 tests; 12 discarded.
vector>   Data.Vector.Primitive.Mutable (Move):                                    OK
vector>     +++ OK, passed 100 tests; 17 discarded.
vector>   Data.Vector.Unboxed.Mutable (Move):                                      OK
vector>     +++ OK, passed 100 tests; 18 discarded.
vector>   Data.Vector.Storable.Mutable (Move):                                     OK
vector>     +++ OK, passed 100 tests; 17 discarded.
vector>   Data.Vector.Generic.Mutable (nextPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (prevPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector>   Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector> 
vector> All 2808 tests passed (11.72s)
vector> Test suite vector-tests-O2: PASS
vector> Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
vector> 2 of 2 test suites (2 of 2 test cases) passed.
vector> Running phase: haddockPhase
vector> Running phase: installPhase
vector> Installing library in /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
vector> Installing internal library benchmarks-O2 in /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
vector> Running phase: fixupPhase
vector> shrinking RPATHs of ELF executables and libraries in /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0
vector> shrinking /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSvector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2-ghc9.12.1.so
vector> shrinking /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSvector-0.13.2.0-LKSB10K7yAABOTSbq9H69q-ghc9.12.1.so
vector> checking for references to /build/ in /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0...
vector> patching script interpreter paths in /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0
vector> stripping (with command strip and flags -S -p) in  /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0/lib
vector (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0
vector (post)> Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
vector (post)> 
vector (post)> Pushing /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0 (54.18 MiB)
vector (post)> 
vector (post)> All done.
vector (post)> added 1 signatures
vector (post)> added 8 signatures
vector (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/pzavabz5kv6jy3qyvi95yw4vvmax5k0i-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
vector (post)> added 0 signatures
vector (post)> added 0 signatures
vector (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/928g5m30wzm7x8zf8s1bf9wh1ya6mx85-vector-0.13.2.0' to 'ssh-ng://worker.nix-ci.com'...
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/pzavabz5kv6jy3qyvi95yw4vvmax5k0i-vector-0.13.2.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/36k9aqym0rc2zb6y5425bxw6zz58sbvp-nothunks-0.3.0.0.drv'...
nothunks> Running phase: setupCompilerEnvironmentPhase
nothunks> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
nothunks> Running phase: unpackPhase
nothunks> unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
nothunks> source root is nothunks-0.3.0.0
nothunks> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
nothunks> Running phase: patchPhase
nothunks> Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
nothunks> Run jailbreak-cabal to lift version restrictions on build inputs.
nothunks> Running phase: compileBuildDriverPhase
nothunks> setupCompileFlags: -package-db=/build/tmp.AsUGld7hA9/setup-package.conf.d -threaded
nothunks> [1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.AsUGld7hA9/Main.o )
nothunks> [2 of 2] Linking Setup
nothunks> Running phase: updateAutotoolsGnuConfigScriptsPhase
nothunks> Running phase: configurePhase
nothunks> configureFlags: --verbose --prefix=/nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.AsUGld7hA9/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
nothunks> Using Parsec parser
nothunks> Configuring nothunks-0.3.0.0...
nothunks> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
nothunks> 'ghc' version < 9.12):
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
nothunks> 9.12.1
nothunks> Flags chosen: bytestring=True, text=True, vector=True
nothunks> Dependency base: using base-4.21.0.0
nothunks> Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
nothunks> Dependency containers: using containers-0.7
nothunks> Dependency ghc-heap: using ghc-heap-9.12.1
nothunks> Dependency stm: using stm-2.5.3.1
nothunks> Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
nothunks> Dependency time: using time-1.14
nothunks> Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
nothunks> Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
nothunks> Dependency base: using base-4.21.0.0
nothunks> Dependency containers: using containers-0.7
nothunks> Dependency ghc-prim: using ghc-prim-0.13.0
nothunks> Dependency hedgehog: using hedgehog-1.5
nothunks> Dependency nothunks: using nothunks-0.3.0.0
nothunks> Dependency random: using random-1.2.1.3
nothunks> Dependency stm: using stm-2.5.3.1
nothunks> Dependency tasty: using tasty-1.5.3
nothunks> Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
nothunks> Source component graph:
nothunks>     component lib
nothunks>     component test:nothunks-test dependency lib
nothunks> Configured component graph:
nothunks>     component nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks>         include base-4.21.0.0-f068
nothunks>         include bytestring-0.12.2.0-be6d
nothunks>         include containers-0.7-647d
nothunks>         include ghc-heap-9.12.1-2947
nothunks>         include stm-2.5.3.1-0481
nothunks>         include text-2.1.2-5eaa
nothunks>         include time-1.14-f7a8
nothunks>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
nothunks>         include wherefrom-compat-0.1.1.1-1SO6aWtLEGxDvvOmeHtXpg
nothunks>     component nothunks-0.3.0.0-G3fXlDy46iWHhRRbcTDdSO-nothunks-test
nothunks>         include base-4.21.0.0-f068
nothunks>         include containers-0.7-647d
nothunks>         include ghc-prim-0.13.0-cfc8
nothunks>         include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
nothunks>         include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
nothunks>         include stm-2.5.3.1-0481
nothunks>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
nothunks>         include tasty-hedgehog-1.4.0.2-CbtR3hq33K86Et4pHsWsA8
nothunks> Linked component graph:
nothunks>     unit nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks>         include base-4.21.0.0-f068
nothunks>         include bytestring-0.12.2.0-be6d
nothunks>         include containers-0.7-647d
nothunks>         include ghc-heap-9.12.1-2947
nothunks>         include stm-2.5.3.1-0481
nothunks>         include text-2.1.2-5eaa
nothunks>         include time-1.14-f7a8
nothunks>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
nothunks>         include wherefrom-compat-0.1.1.1-1SO6aWtLEGxDvvOmeHtXpg
nothunks>         NoThunks.Class=nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX:NoThunks.Class
nothunks>     unit nothunks-0.3.0.0-G3fXlDy46iWHhRRbcTDdSO-nothunks-test
nothunks>         include base-4.21.0.0-f068
nothunks>         include containers-0.7-647d
nothunks>         include ghc-prim-0.13.0-cfc8
nothunks>         include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
nothunks>         include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
nothunks>         include stm-2.5.3.1-0481
nothunks>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
nothunks>         include tasty-hedgehog-1.4.0.2-CbtR3hq33K86Et4pHsWsA8
nothunks> Ready component graph:
nothunks>     definite nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks>         depends base-4.21.0.0-f068
nothunks>         depends bytestring-0.12.2.0-be6d
nothunks>         depends containers-0.7-647d
nothunks>         depends ghc-heap-9.12.1-2947
nothunks>         depends stm-2.5.3.1-0481
nothunks>         depends text-2.1.2-5eaa
nothunks>         depends time-1.14-f7a8
nothunks>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
nothunks>         depends wherefrom-compat-0.1.1.1-1SO6aWtLEGxDvvOmeHtXpg
nothunks>     definite nothunks-0.3.0.0-G3fXlDy46iWHhRRbcTDdSO-nothunks-test
nothunks>         depends base-4.21.0.0-f068
nothunks>         depends containers-0.7-647d
nothunks>         depends ghc-prim-0.13.0-cfc8
nothunks>         depends hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
nothunks>         depends nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks>         depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
nothunks>         depends stm-2.5.3.1-0481
nothunks>         depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
nothunks>         depends tasty-hedgehog-1.4.0.2-CbtR3hq33K86Et4pHsWsA8
nothunks> Using Cabal-3.14.1.0 compiled by ghc-9.12
nothunks> Using compiler: ghc-9.12.1
nothunks> Using install prefix:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0
nothunks> Executables installed in:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/bin
nothunks> Libraries installed in:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks> Dynamic Libraries installed in:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
nothunks> Private executables installed in:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0
nothunks> Data files installed in:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0
nothunks> Documentation installed in:
nothunks> /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
nothunks> Configuration files installed in:
nothunks> /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/etc
nothunks> No alex found
nothunks> Using ar found on system at:
nothunks> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
nothunks> No c2hs found
nothunks> No cpphs found
nothunks> No doctest found
nothunks> Using gcc version 14.3.0 given by user at:
nothunks> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
nothunks> Using ghc version 9.12.1 found on system at:
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
nothunks> Using ghc-pkg version 9.12.1 found on system at:
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
nothunks> No ghcjs found
nothunks> No ghcjs-pkg found
nothunks> No greencard found
nothunks> Using haddock version 2.30.0 found on system at:
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
nothunks> No happy found
nothunks> No haskell-suite found
nothunks> No haskell-suite-pkg found
nothunks> No hmake found
nothunks> Using hpc version 0.69 found on system at:
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
nothunks> Using hsc2hs version 0.68.10 found on system at:
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
nothunks> Using hscolour version 1.25 found on system at:
nothunks> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
nothunks> No jhc found
nothunks> Using ld found on system at:
nothunks> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
nothunks> No pkg-config found
nothunks> Using runghc version 9.12.1 found on system at:
nothunks> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
nothunks> Using strip version 2.44 found on system at:
nothunks> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
nothunks> Using tar found on system at:
nothunks> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
nothunks> No uhc found
nothunks> Running phase: buildPhase
nothunks> Preprocessing library for nothunks-0.3.0.0...
nothunks> Building library for nothunks-0.3.0.0...
nothunks> [1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
nothunks> [1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
nothunks> Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0...
nothunks> Building test suite 'nothunks-test' for nothunks-0.3.0.0...
nothunks> [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
nothunks> [2 of 2] Compiling Main             ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
nothunks> [3 of 3] Linking dist/build/nothunks-test/nothunks-test
nothunks> Running phase: checkPhase
nothunks> Running 1 test suites...
nothunks> Test suite nothunks-test: RUNNING...
nothunks> Tests
nothunks>   NoThunks.Class
nothunks>     Sanity
nothunks>       IntNotNF:          OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       IntIsNF:           OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       Pair:              OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       Sum:               OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       Fn:                OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       IO:                OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>     InspectHeap
nothunks>       Int:               OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int"] 47% █████████▍··········
nothunks>             Nothing      53% ██████████▌·········
nothunks>       IntInt:            OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","Tuple2"] 37% ███████▍············
nothunks>             Just ["Tuple2"]       50% ██████████··········
nothunks>             Nothing               12% ██▌·················
nothunks>       SumInt:            OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Either"]       33% ██████▋·············
nothunks>             Just ["Int","Either"] 32% ██████▍·············
nothunks>             Nothing               34% ██████▉·············
nothunks>       ListInt:           OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List"] 22% ████▎···············
nothunks>             Just ["List"]       46% █████████···········
nothunks>             Nothing             33% ██████▌·············
nothunks>       IntListInt:        OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List","Tuple2"]  5% █···················
nothunks>             Just ["Int","Tuple2"]        26% █████▏··············
nothunks>             Just ["List","Tuple2"]       10% █▉··················
nothunks>             Just ["Tuple2"]              50% █████████▉··········
nothunks>             Nothing                      10% █▉··················
nothunks>       SeqInt:              ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
nothunks>     after 15 tests and 1 shrink.
nothunks>     shrink path: 15:b
nothunks>     Just ["Int","Seq"] 27% █████▎··············
nothunks>     Nothing            67% █████████████▎······
nothunks> 
nothunks>         ┏━━ test/Test/NoThunks/Class.hs ━━━
nothunks>     166 ┃ testWithModel :: forall a. FromModel a
nothunks>     167 ┃               => (Maybe ThunkInfo -> Maybe [String] -> Bool)
nothunks>     168 ┃               -> Proxy a
nothunks>     169 ┃               -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
nothunks>     170 ┃               -- can just be @(==)@; however, when we use 'isNormalForm', the
nothunks>     171 ┃               -- context we will get from the model will be too detailed.
nothunks>     172 ┃               -> Property
nothunks>     173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
nothunks>     174 ┃     m :: Model a <- forAll genModel
nothunks>         ┃     │ Wrap
nothunks>         ┃     │   { unwrap =
nothunks>         ┃     │       SeqEnqueue
nothunks>         ┃     │         (IntValue 0)
nothunks>         ┃     │         (SeqEnqueue
nothunks>         ┃     │            (IntValue 0)
nothunks>         ┃     │            (SeqEnqueue
nothunks>         ┃     │               (IntValue 0)
nothunks>         ┃     │               (SeqEnqueue
nothunks>         ┃     │                  (IntValue 0)
nothunks>         ┃     │                  (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
nothunks>         ┃     │   }
nothunks>     175 ┃     collect $ modelUnexpected [] m
nothunks>     176 ┃     fromModel m $ \a -> do
nothunks>     177 ┃       annotate $ show $ modelIsNF [] m
nothunks>         ┃       │ IsNF
nothunks>     178 ┃       isNF <- liftIO $ noThunks [] a
nothunks>     179 ┃       Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
nothunks>         ┃       ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
nothunks>         ┃       │ ━━━ Failed (- lhs) (+ rhs) ━━━
nothunks>         ┃       │ - Just
nothunks>         ┃       │ -   ThunkInfo
nothunks>         ┃       │ -     { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
nothunks>         ┃       │ + Nothing
nothunks> 
nothunks>     This failure can be reproduced by running:
nothunks>     > recheckAt (Seed 16338885027141260430 15778968376244410793) "15:b" EXPECTED FAILURE
nothunks> 
nothunks> OK (0.02s)
nothunks>           ✓ <interactive> passed 1 test.
nothunks>     Model
nothunks>       Int:               OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int"] 52% ██████████▎·········
nothunks>             Nothing      48% █████████▋··········
nothunks>       IntInt:            OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","Tuple2"] 39% ███████▋············
nothunks>             Just ["Tuple2"]       48% █████████▋··········
nothunks>             Nothing               13% ██▌·················
nothunks>       SumInt:            OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Either"]       38% ███████▌············
nothunks>             Just ["Int","Either"] 32% ██████▎·············
nothunks>             Nothing               30% ██████··············
nothunks>       ListInt:           OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List"] 21% ████▏···············
nothunks>             Just ["List"]       44% ████████▊···········
nothunks>             Nothing             35% ██████▉·············
nothunks>       IntListInt:        OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List","Tuple2"]  5% █···················
nothunks>             Just ["Int","Tuple2"]        25% █████···············
nothunks>             Just ["List","Tuple2"]       12% ██▍·················
nothunks>             Just ["Tuple2"]              48% █████████▌··········
nothunks>             Nothing                      10% █▉··················
nothunks>       SeqInt:            OK (0.07s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","Seq"] 44% ████████▉···········
nothunks>             Nothing            56% ███████████·········
nothunks>       AllowThunksIn:     OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","field2","Record"] 26% █████···············
nothunks>             Just ["Record"]                50% █████████▉··········
nothunks>             Nothing                        25% █████···············
nothunks>       Fn:                OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["->"] 25% █████···············
nothunks>             Nothing     75% ██████████████▉·····
nothunks>       IO:                OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["IO"] 23% ████▌···············
nothunks>             Nothing     77% ███████████████▍····
nothunks>       ThunkFreeFn:       OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["->"]       27% █████▎··············
nothunks>             Just ["...","->"] 37% ███████▍············
nothunks>             Nothing           36% ███████▏············
nothunks>       ThunkFreeIO:       OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["...","IO"] 38% ███████▌············
nothunks>             Just ["IO"]       25% █████···············
nothunks>             Nothing           37% ███████▎············
nothunks>     MutableVars
nothunks>       IORef
nothunks>         NotNF:           OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NF:              OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFPure:       OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFPure:          OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFAtomically: OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFAtomically:    OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>       MVar
nothunks>         NotNF:           OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NF:              OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFPure:       OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFPure:          OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFAtomically: OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFAtomically:    OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>       TVar
nothunks>         NotNF:           OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NF:              OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFPure:       OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFPure:          OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFAtomically: OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFAtomically:    OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks> 
nothunks> All 41 tests passed (0.33s)
nothunks> Test suite nothunks-test: PASS
nothunks> Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
nothunks> 1 of 1 test suites (1 of 1 test cases) passed.
nothunks> Running phase: haddockPhase
nothunks> Preprocessing library for nothunks-0.3.0.0...
nothunks> Running Haddock on library for nothunks-0.3.0.0...
nothunks> Warning: The documentation for the following packages are not installed. No
nothunks> links will be generated to these packages: vector-0.13.2.0
nothunks> [1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, nothing ) [HIE file is missing]
nothunks> Haddock coverage:
nothunks> Warning: 'ThunkInfo' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:230:18
nothunks>     * at src/NoThunks/Class.hs:230:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:230:1
nothunks> Warning: 'GHC' is out of scope.
nothunks>     If you qualify the identifier, haddock can try to link it anyway.
nothunks> Warning: 'a' is out of scope.
nothunks>     If you qualify the identifier, haddock can try to link it anyway.
nothunks> Warning: 'AllowThunksIn' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:334:48
nothunks>     * at src/NoThunks/Class.hs:334:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:334:1
nothunks> Warning: 'InspectHeap' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:353:25
nothunks>     * at src/NoThunks/Class.hs:353:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:353:1
nothunks> Warning: 'InspectHeapNamed' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:358:47
nothunks>     * at src/NoThunks/Class.hs:358:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:358:1
nothunks> Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:308:27
nothunks>     * at src/NoThunks/Class.hs:308:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:308:1
nothunks>   95% ( 20 / 21) in 'NoThunks.Class'
nothunks>   Missing documentation for:
nothunks>     Module header
nothunks> Warning: NoThunks.Class: could not find link destinations for:
nothunks>       - NoThunks.Class.Elem
nothunks>       - NoThunks.Class.GShowTypeOf
nothunks>       - NoThunks.Class.GWRecordField
nothunks>       - NoThunks.Class.HasFields
nothunks>       - Data.Vector.Unboxed.Base.Vector
nothunks>       - Data.Vector.Vector
nothunks>       - NoThunks.Class.checkContainsThunks
nothunks> Documentation created: dist/doc/html/nothunks,
nothunks> dist/doc/html/nothunks/nothunks.txt
nothunks> Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0...
nothunks> Running phase: installPhase
nothunks> Installing library in /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
nothunks> Running phase: fixupPhase
nothunks> shrinking RPATHs of ELF executables and libraries in /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0
nothunks> shrinking /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSnothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX-ghc9.12.1.so
nothunks> checking for references to /build/ in /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0...
nothunks> patching script interpreter paths in /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0
nothunks> stripping (with command strip and flags -S -p) in  /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0/lib
nothunks> shrinking RPATHs of ELF executables and libraries in /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc
nothunks> checking for references to /build/ in /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc...
nothunks> patching script interpreter paths in /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc
nothunks (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0
nothunks (post)> Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
nothunks (post)> 
nothunks (post)> Pushing /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc (839.20 KiB)
nothunks (post)> Pushing /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0 (2.88 MiB)
nothunks (post)> 
nothunks (post)> All done.
nothunks (post)> added 2 signatures
nothunks (post)> added 36 signatures
nothunks (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0
nothunks (post)> copying 2 paths...
nothunks (post)> copying path '/nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
nothunks (post)> copying path '/nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
nothunks (post)> copying 1 paths...
nothunks (post)> copying path '/nix/store/36k9aqym0rc2zb6y5425bxw6zz58sbvp-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
nothunks (post)> added 0 signatures
nothunks (post)> added 0 signatures
nothunks (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc /nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0
nothunks (post)> copying 2 paths...
nothunks (post)> copying path '/nix/store/4z0vyd6fkckwp1xqlsjmz3wm746vhac1-nothunks-0.3.0.0-doc' to 'ssh-ng://worker.nix-ci.com'...
nothunks (post)> copying path '/nix/store/ll11q1ddmk65cq1gr3ck1zwmjc6pn0b8-nothunks-0.3.0.0' to 'ssh-ng://worker.nix-ci.com'...
nothunks (post)> copying 1 paths...
nothunks (post)> copying path '/nix/store/36k9aqym0rc2zb6y5425bxw6zz58sbvp-nothunks-0.3.0.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/haa9x0jgbgyl1gncb4dryzcdmhrmvlyr-unordered-containers-0.2.20.drv'...
unordered-containers> Running phase: setupCompilerEnvironmentPhase
unordered-containers> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
unordered-containers> Running phase: unpackPhase
unordered-containers> unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
unordered-containers> source root is unordered-containers-0.2.20
unordered-containers> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
unordered-containers> Running phase: patchPhase
unordered-containers> Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
unordered-containers> Running phase: compileBuildDriverPhase
unordered-containers> setupCompileFlags: -package-db=/build/tmp.sTzFAZmpwm/setup-package.conf.d -threaded
unordered-containers> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.sTzFAZmpwm/Main.o )
unordered-containers> [2 of 2] Linking Setup
unordered-containers> Running phase: updateAutotoolsGnuConfigScriptsPhase
unordered-containers> Running phase: configurePhase
unordered-containers> configureFlags: --verbose --prefix=/nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.sTzFAZmpwm/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
unordered-containers> Using Parsec parser
unordered-containers> Configuring unordered-containers-0.2.20...
unordered-containers> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
unordered-containers> 'ghc' version < 9.12):
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
unordered-containers> 9.12.1
unordered-containers> Flags chosen: debug=False
unordered-containers> Dependency base >=4.10 && <5: using base-4.21.0.0
unordered-containers> Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
unordered-containers> Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
unordered-containers> Dependency template-haskell <2.24: using template-haskell-2.23.0.0
unordered-containers> Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
unordered-containers> Dependency HUnit: using HUnit-1.6.2.0
unordered-containers> Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
unordered-containers> Dependency base: using base-4.21.0.0
unordered-containers> Dependency containers >=0.5.8: using containers-0.7
unordered-containers> Dependency hashable: using hashable-1.4.7.0
unordered-containers> Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
unordered-containers> Dependency random: using random-1.2.1.3
unordered-containers> Dependency tasty >=1.4.0.3: using tasty-1.5.3
unordered-containers> Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
unordered-containers> Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
unordered-containers> Dependency unordered-containers: using unordered-containers-0.2.20
unordered-containers> Source component graph:
unordered-containers>     component lib
unordered-containers>     component test:unordered-containers-tests dependency lib
unordered-containers> Configured component graph:
unordered-containers>     component unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers>         include base-4.21.0.0-f068
unordered-containers>         include deepseq-1.5.1.0-b096
unordered-containers>         include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
unordered-containers>         include template-haskell-2.23.0.0-125a
unordered-containers>     component unordered-containers-0.2.20-8V1CbZs5KiA6Dx9xccQiI7-unordered-containers-tests
unordered-containers>         include ChasingBottoms-1.3.1.15-7UJDQm86uOU1SZ4bdf8VsE
unordered-containers>         include HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
unordered-containers>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
unordered-containers>         include base-4.21.0.0-f068
unordered-containers>         include containers-0.7-647d
unordered-containers>         include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
unordered-containers>         include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
unordered-containers>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
unordered-containers>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
unordered-containers>         include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
unordered-containers>         include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
unordered-containers>         include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers> Linked component graph:
unordered-containers>     unit unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers>         include base-4.21.0.0-f068
unordered-containers>         include deepseq-1.5.1.0-b096
unordered-containers>         include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
unordered-containers>         include template-haskell-2.23.0.0-125a
unordered-containers>         Data.HashMap.Internal=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashSet.Internal
unordered-containers>     unit unordered-containers-0.2.20-8V1CbZs5KiA6Dx9xccQiI7-unordered-containers-tests
unordered-containers>         include ChasingBottoms-1.3.1.15-7UJDQm86uOU1SZ4bdf8VsE
unordered-containers>         include HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
unordered-containers>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
unordered-containers>         include base-4.21.0.0-f068
unordered-containers>         include containers-0.7-647d
unordered-containers>         include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
unordered-containers>         include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
unordered-containers>         include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
unordered-containers>         include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
unordered-containers>         include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
unordered-containers>         include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
unordered-containers>         include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers> Ready component graph:
unordered-containers>     definite unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers>         depends base-4.21.0.0-f068
unordered-containers>         depends deepseq-1.5.1.0-b096
unordered-containers>         depends hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
unordered-containers>         depends template-haskell-2.23.0.0-125a
unordered-containers>     definite unordered-containers-0.2.20-8V1CbZs5KiA6Dx9xccQiI7-unordered-containers-tests
unordered-containers>         depends ChasingBottoms-1.3.1.15-7UJDQm86uOU1SZ4bdf8VsE
unordered-containers>         depends HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
unordered-containers>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
unordered-containers>         depends base-4.21.0.0-f068
unordered-containers>         depends containers-0.7-647d
unordered-containers>         depends hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
unordered-containers>         depends nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
unordered-containers>         depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
unordered-containers>         depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
unordered-containers>         depends tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
unordered-containers>         depends tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
unordered-containers>         depends unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers> Using Cabal-3.14.1.0 compiled by ghc-9.12
unordered-containers> Using compiler: ghc-9.12.1
unordered-containers> Using install prefix:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20
unordered-containers> Executables installed in:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/bin
unordered-containers> Libraries installed in:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers> Dynamic Libraries installed in:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
unordered-containers> Private executables installed in:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20
unordered-containers> Data files installed in:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20
unordered-containers> Documentation installed in:
unordered-containers> /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
unordered-containers> Configuration files installed in:
unordered-containers> /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/etc
unordered-containers> No alex found
unordered-containers> Using ar found on system at:
unordered-containers> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
unordered-containers> No c2hs found
unordered-containers> No cpphs found
unordered-containers> No doctest found
unordered-containers> Using gcc version 14.3.0 given by user at:
unordered-containers> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
unordered-containers> Using ghc version 9.12.1 found on system at:
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
unordered-containers> Using ghc-pkg version 9.12.1 found on system at:
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
unordered-containers> No ghcjs found
unordered-containers> No ghcjs-pkg found
unordered-containers> No greencard found
unordered-containers> Using haddock version 2.30.0 found on system at:
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
unordered-containers> No happy found
unordered-containers> No haskell-suite found
unordered-containers> No haskell-suite-pkg found
unordered-containers> No hmake found
unordered-containers> Using hpc version 0.69 found on system at:
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
unordered-containers> Using hsc2hs version 0.68.10 found on system at:
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
unordered-containers> Using hscolour version 1.25 found on system at:
unordered-containers> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
unordered-containers> No jhc found
unordered-containers> Using ld found on system at:
unordered-containers> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
unordered-containers> No pkg-config found
unordered-containers> Using runghc version 9.12.1 found on system at:
unordered-containers> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
unordered-containers> Using strip version 2.44 found on system at:
unordered-containers> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
unordered-containers> Using tar found on system at:
unordered-containers> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
unordered-containers> No uhc found
unordered-containers> Running phase: buildPhase
unordered-containers> Preprocessing library for unordered-containers-0.2.20...
unordered-containers> Building library for unordered-containers-0.2.20...
unordered-containers> Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
unordered-containers>     -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
unordered-containers>    |
unordered-containers> 12 | {-# LANGUAGE TypeInType            #-}
unordered-containers>    |              ^^^^^^^^^^
unordered-containers> 
unordered-containers> [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
unordered-containers> Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Control.Applicative’ is redundant
unordered-containers>       except perhaps to import instances from ‘Control.Applicative’
unordered-containers>     To import instances alone, use: import Control.Applicative()
unordered-containers>    |
unordered-containers> 83 | import Control.Applicative (liftA2)
unordered-containers>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
unordered-containers>     In the use of ‘sizeofSmallMutableArray#’
unordered-containers>     (imported from GHC.Exts, but defined in GHC.Prim):
unordered-containers>     Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
unordered-containers>     |
unordered-containers> 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
unordered-containers>     |                    ^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
unordered-containers> [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
unordered-containers> [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.o, dist/build/Data/HashMap/Internal/Debug.dyn_o )
unordered-containers> [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
unordered-containers> [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
unordered-containers> [7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
unordered-containers> [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
unordered-containers> [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
unordered-containers> Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
unordered-containers>     -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
unordered-containers>    |
unordered-containers> 12 | {-# LANGUAGE TypeInType            #-}
unordered-containers>    |              ^^^^^^^^^^
unordered-containers> 
unordered-containers> [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
unordered-containers> Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Control.Applicative’ is redundant
unordered-containers>       except perhaps to import instances from ‘Control.Applicative’
unordered-containers>     To import instances alone, use: import Control.Applicative()
unordered-containers>    |
unordered-containers> 83 | import Control.Applicative (liftA2)
unordered-containers>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
unordered-containers>     In the use of ‘sizeofSmallMutableArray#’
unordered-containers>     (imported from GHC.Exts, but defined in GHC.Prim):
unordered-containers>     Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
unordered-containers>     |
unordered-containers> 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
unordered-containers>     |                    ^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
unordered-containers> [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
unordered-containers> [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
unordered-containers> [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
unordered-containers> [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
unordered-containers> [7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
unordered-containers> [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
unordered-containers> [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
unordered-containers> Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
unordered-containers> Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
unordered-containers> [1 of 9] Compiling Properties.List  ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
unordered-containers> [2 of 9] Compiling Regressions      ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
unordered-containers> tests/Regressions.hs:91:16: warning: [GHC-63394] [-Wx-partial]
unordered-containers>     In the use of ‘head’
unordered-containers>     (imported from Prelude, but defined in GHC.Internal.List):
unordered-containers>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
unordered-containers>    |
unordered-containers> 91 |       k      = head keys
unordered-containers>    |                ^^^^
unordered-containers> 
unordered-containers> [3 of 9] Compiling Util.Key         ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
unordered-containers> [4 of 9] Compiling Strictness       ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
unordered-containers> tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Data.Foldable’ is redundant
unordered-containers>       except perhaps to import instances from ‘Data.Foldable’
unordered-containers>     To import instances alone, use: import Data.Foldable()
unordered-containers>   |
unordered-containers> 7 | import Data.Foldable                (foldl')
unordered-containers>   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
unordered-containers> [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
unordered-containers> [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
unordered-containers> [8 of 9] Compiling Properties       ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
unordered-containers> [9 of 9] Compiling Main             ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
unordered-containers> [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
unordered-containers> Running phase: checkPhase
unordered-containers> Running 1 test suites...
unordered-containers> Test suite unordered-containers-tests: RUNNING...
unordered-containers> All
unordered-containers>   Properties
unordered-containers>     Data.HashMap.Lazy
unordered-containers>       instances
unordered-containers>         Eq
unordered-containers>           ==:                              OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           /=:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Ord
unordered-containers>           compare reflexive:               OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare transitive:              OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare antisymmetric:           OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           Ord => Eq:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Read/Show:                         OK (0.07s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Functor:                           OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Foldable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Bifoldable
unordered-containers>           bifoldMap:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldr:                         OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldl:                         OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Hashable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       empty
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 1 test.
unordered-containers>       singleton
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       size:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookup:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       !?:                                  OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       insertWith
unordered-containers>         insertWith:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       delete
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       adjust
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       update
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alter
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alterF
unordered-containers>         model
unordered-containers>           []:                              OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           adjust:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insert:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insertWith:                      OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           delete:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           lookup:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       isSubmapOf
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m ⊆ m:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊆ m1 ∪ m2:                      OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊈ m2  ⇒  m1 ∪ m2 ⊈ m1:          OK
unordered-containers>           +++ OK, passed 100 tests; 14 discarded.
unordered-containers>         m1\m2 ⊆ m1:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK
unordered-containers>           +++ OK, passed 100 tests; 159 discarded.
unordered-containers>         delete k m ⊆ m:                    OK
unordered-containers>           +++ OK, passed 100 tests; 17 discarded.
unordered-containers>         m ⊈ delete k m :                   OK
unordered-containers>           +++ OK, passed 100 tests; 16 discarded.
unordered-containers>         k ∉ m  ⇒  m ⊆ insert k v m:        OK
unordered-containers>           +++ OK, passed 100 tests; 3 discarded.
unordered-containers>         k ∉ m  ⇒  insert k v m ⊈ m:        OK
unordered-containers>           +++ OK, passed 100 tests; 10 discarded.
unordered-containers>       union
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWith
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWithKey
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unions
unordered-containers>         model:                             OK (0.39s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.19s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       difference
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       differenceWith
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersection
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWith
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWithKey
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       compose
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       map
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       traverseWithKey
unordered-containers>         model:                             OK (0.04s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapKeys
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.14s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       foldr:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey:                        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey:                        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey':                       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey':                       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldr':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldMapWithKey:                      OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       filter
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       filterWithKey
unordered-containers>         model:                             OK (0.58s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.20s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybe
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybeWithKey
unordered-containers>         model:                             OK (0.38s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.20s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       elems:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       keys:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromList
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWith
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWithKey
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       toList:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>     Data.HashMap.Strict
unordered-containers>       instances
unordered-containers>         Eq
unordered-containers>           ==:                              OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           /=:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Ord
unordered-containers>           compare reflexive:               OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare transitive:              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare antisymmetric:           OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           Ord => Eq:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Read/Show:                         OK (0.12s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Functor:                           OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Foldable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Bifoldable
unordered-containers>           bifoldMap:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldr:                         OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldl:                         OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Hashable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       empty
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 1 test.
unordered-containers>       singleton
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       size:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookup:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       !?:                                  OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       insertWith
unordered-containers>         insertWith:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       delete
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       adjust
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       update
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alter
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alterF
unordered-containers>         model
unordered-containers>           []:                              OK (0.07s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           adjust:                          OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insert:                          OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insertWith:                      OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           delete:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           lookup:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       isSubmapOf
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m ⊆ m:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊆ m1 ∪ m2:                      OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊈ m2  ⇒  m1 ∪ m2 ⊈ m1:          OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests; 27 discarded.
unordered-containers>         m1\m2 ⊆ m1:                        OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests; 211 discarded.
unordered-containers>         delete k m ⊆ m:                    OK
unordered-containers>           +++ OK, passed 100 tests; 15 discarded.
unordered-containers>         m ⊈ delete k m :                   OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests; 24 discarded.
unordered-containers>         k ∉ m  ⇒  m ⊆ insert k v m:        OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests; 5 discarded.
unordered-containers>         k ∉ m  ⇒  insert k v m ⊈ m:        OK
unordered-containers>           +++ OK, passed 100 tests; 10 discarded.
unordered-containers>       union
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWith
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWithKey
unordered-containers>         model:                             OK (0.04s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unions
unordered-containers>         model:                             OK (0.50s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.37s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       difference
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       differenceWith
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersection
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWith
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWithKey
unordered-containers>         model:                             OK (0.04s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       compose
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       map
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       traverseWithKey
unordered-containers>         model:                             OK (0.09s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapKeys
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.13s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       foldr:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl:                               OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey:                        OK (0.02s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey:                        OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey':                       OK (0.02s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey':                       OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl':                              OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldr':                              OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldMapWithKey:                      OK (0.02s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       filter
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       filterWithKey
unordered-containers>         model:                             OK (0.42s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.30s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybe
unordered-containers>         model:                             OK (0.04s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybeWithKey
unordered-containers>         model:                             OK (0.43s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.31s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       elems:                               OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       keys:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromList
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWith
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWithKey
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       toList:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>     Data.HashSet
unordered-containers>       instances
unordered-containers>         Eq
unordered-containers>           ==:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           == permutations:                 OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           /=:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Ord
unordered-containers>           compare reflexive:               OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare transitive:              OK (0.03s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare antisymmetric:           OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           Ord => Eq:                       OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Read/Show:                         OK (0.13s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Foldable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Hashable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       size:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert:                              OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       delete:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       union:                               OK (0.03s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       map:                                 OK (0.32s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldr:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       filter:                              OK (0.31s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       toList:                              OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>     Data.HashMap.Internal.List
unordered-containers>       isPermutationBy:                     OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       isPermutationBy of different length: OK
unordered-containers>         +++ OK, passed 100 tests; 16 discarded.
unordered-containers>       pUnorderedCompare:                   OK (0.03s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       modelUnorderedCompare
unordered-containers>         reflexive:                         OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         anti-symmetric:                    OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         transitive:                        OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>   Regression tests
unordered-containers>     issue32:                               OK
unordered-containers>     issue39a:                              OK
unordered-containers>     issue39b:                              OK (0.01s)
unordered-containers>       +++ OK, passed 100 tests.
unordered-containers>     issue254 lazy:                         OK
unordered-containers>     issue254 strict:                       OK
unordered-containers>     issue379
unordered-containers>       Lazy.unionWith:                      OK
unordered-containers>       union:                               OK
unordered-containers>       Strict.unionWith:                    OK
unordered-containers>       Strict.unionWithKey:                 OK
unordered-containers>     issue381
unordered-containers>       mapMaybe:                            OK
unordered-containers>       mapMaybeWithKey:                     OK
unordered-containers>     issue382:                              OK
unordered-containers>     issue383:                              OK
unordered-containers>     issue420:                              OK
unordered-containers>   Strictness
unordered-containers>     HashMap.Strict
unordered-containers>       singleton is key-strict:             OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       singleton is value-strict:           OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookup is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookupDefault is key-strict:         OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       findWithDefault is key-strict:       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       ! is key-strict:                     OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       delete is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       adjust is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       adjust is value-strict:              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert is value-strict:              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insertWith is key-strict:            OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insertWith is value-strict:          OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromList is key-strict:              OK
unordered-containers>         +++ OK, passed 1 test.
unordered-containers>       fromList is value-strict:            OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromListWith is key-strict:          OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromListWith is value-strict:        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers> 
unordered-containers> All 256 tests passed (0.66s)
unordered-containers> Test suite unordered-containers-tests: PASS
unordered-containers> Test suite logged to:
unordered-containers> dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
unordered-containers> 1 of 1 test suites (1 of 1 test cases) passed.
unordered-containers> Running phase: haddockPhase
unordered-containers> Preprocessing library for unordered-containers-0.2.20...
unordered-containers> Running Haddock on library for unordered-containers-0.2.20...
unordered-containers> Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
unordered-containers>     -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
unordered-containers>    |
unordered-containers> 12 | {-# LANGUAGE TypeInType            #-}
unordered-containers>    |              ^^^^^^^^^^
unordered-containers> 
unordered-containers> [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing ) [Flags changed]
unordered-containers> Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Control.Applicative’ is redundant
unordered-containers>       except perhaps to import instances from ‘Control.Applicative’
unordered-containers>     To import instances alone, use: import Control.Applicative()
unordered-containers>    |
unordered-containers> 83 | import Control.Applicative (liftA2)
unordered-containers>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
unordered-containers>     In the use of ‘sizeofSmallMutableArray#’
unordered-containers>     (imported from GHC.Exts, but defined in GHC.Prim):
unordered-containers>     Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
unordered-containers>     |
unordered-containers> 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
unordered-containers>     |                    ^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> 
unordered-containers> [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing ) [Flags changed]
unordered-containers> [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing ) [Flags changed]
unordered-containers> [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing ) [Flags changed]
unordered-containers> [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing ) [Flags changed]
unordered-containers> [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing ) [Flags changed]
unordered-containers> [7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, nothing ) [Flags changed]
unordered-containers> [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing ) [Flags changed]
unordered-containers> [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing ) [Flags changed]
unordered-containers> Haddock coverage:
unordered-containers>   33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
unordered-containers>   Missing documentation for:
unordered-containers>     Array (Data/HashMap/Internal/Array.hs:125)
unordered-containers>     MArray (Data/HashMap/Internal/Array.hs:157)
unordered-containers>     new_ (Data/HashMap/Internal/Array.hs:208)
unordered-containers>     singleton (Data/HashMap/Internal/Array.hs:225)
unordered-containers>     singletonM (Data/HashMap/Internal/Array.hs:229)
unordered-containers>     snoc (Data/HashMap/Internal/Array.hs:233)
unordered-containers>     pair (Data/HashMap/Internal/Array.hs:242)
unordered-containers>     length (Data/HashMap/Internal/Array.hs:154)
unordered-containers>     lengthM (Data/HashMap/Internal/Array.hs:162)
unordered-containers>     read (Data/HashMap/Internal/Array.hs:249)
unordered-containers>     write (Data/HashMap/Internal/Array.hs:255)
unordered-containers>     index (Data/HashMap/Internal/Array.hs:262)
unordered-containers>     indexM (Data/HashMap/Internal/Array.hs:274)
unordered-containers>     index# (Data/HashMap/Internal/Array.hs:268)
unordered-containers>     sameArray1 (Data/HashMap/Internal/Array.hs:140)
unordered-containers>     unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
unordered-containers>     unsafeThaw (Data/HashMap/Internal/Array.hs:286)
unordered-containers>     unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
unordered-containers>     run (Data/HashMap/Internal/Array.hs:292)
unordered-containers>     cloneM (Data/HashMap/Internal/Array.hs:314)
unordered-containers>     foldl (Data/HashMap/Internal/Array.hs:404)
unordered-containers>     foldl' (Data/HashMap/Internal/Array.hs:375)
unordered-containers>     foldr (Data/HashMap/Internal/Array.hs:394)
unordered-containers>     foldr' (Data/HashMap/Internal/Array.hs:385)
unordered-containers>     foldMap (Data/HashMap/Internal/Array.hs:417)
unordered-containers>     thaw (Data/HashMap/Internal/Array.hs:436)
unordered-containers>     map (Data/HashMap/Internal/Array.hs:461)
unordered-containers>     traverse (Data/HashMap/Internal/Array.hs:537)
unordered-containers>     traverse' (Data/HashMap/Internal/Array.hs:553)
unordered-containers>     toList (Data/HashMap/Internal/Array.hs:529)
unordered-containers>     fromList (Data/HashMap/Internal/Array.hs:494)
unordered-containers>     fromList' (Data/HashMap/Internal/Array.hs:506)
unordered-containers>   25% (  1 /  4) in 'Data.HashMap.Internal.List'
unordered-containers>   Missing documentation for:
unordered-containers>     isPermutationBy (Data/HashMap/Internal/List.hs:40)
unordered-containers>     deleteBy (Data/HashMap/Internal/List.hs:83)
unordered-containers>     unorderedCompare (Data/HashMap/Internal/List.hs:68)
unordered-containers> Warning: 'at' is out of scope.
unordered-containers>     If you qualify the identifier, haddock can try to link it anyway.
unordered-containers> Warning: 'Leaf' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:225:7
unordered-containers>     * at Data/HashMap/Internal.hs:185:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
unordered-containers>   88% ( 93 /105) in 'Data.HashMap.Internal'
unordered-containers>   Missing documentation for:
unordered-containers>     Leaf (Data/HashMap/Internal.hs:185)
unordered-containers>     intersectionWithKey# (Data/HashMap/Internal.hs:1855)
unordered-containers>     updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
unordered-containers>     equalKeys (Data/HashMap/Internal.hs:511)
unordered-containers>     equalKeys1 (Data/HashMap/Internal.hs:495)
unordered-containers>     lookupRecordCollision (Data/HashMap/Internal.hs:678)
unordered-containers>     LookupRes (Data/HashMap/Internal.hs:657)
unordered-containers>     lookupResToMaybe (Data/HashMap/Internal.hs:660)
unordered-containers>     insert' (Data/HashMap/Internal.hs:806)
unordered-containers>     delete' (Data/HashMap/Internal.hs:1124)
unordered-containers>     insertNewKey (Data/HashMap/Internal.hs:848)
unordered-containers>     insertKeyExists (Data/HashMap/Internal.hs:883)
unordered-containers>   50% (  3 /  6) in 'Data.HashMap.Internal.Debug'
unordered-containers>   Missing documentation for:
unordered-containers>     valid (Data/HashMap/Internal/Debug.hs:98)
unordered-containers>     Validity (Data/HashMap/Internal/Debug.hs:43)
unordered-containers>     SubHashPath (Data/HashMap/Internal/Debug.hs:75)
unordered-containers> Warning: 'lookup' is out of scope.
unordered-containers>     If you qualify the identifier, haddock can try to link it anyway.
unordered-containers> Warning: 'at' is out of scope.
unordered-containers>     If you qualify the identifier, haddock can try to link it anyway.
unordered-containers>  100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
unordered-containers> Warning: 'HashSet' is ambiguous. It is defined
unordered-containers>     * at Data/HashSet/Internal.hs:112:21
unordered-containers>     * at Data/HashSet/Internal.hs:112:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
unordered-containers>  100% ( 35 / 35) in 'Data.HashSet.Internal'
unordered-containers> Warning: 'HashSet' is ambiguous. It is defined
unordered-containers>     * at Data/HashSet/Internal.hs:112:21
unordered-containers>     * at Data/HashSet/Internal.hs:112:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
unordered-containers>  100% ( 32 / 32) in 'Data.HashSet'
unordered-containers>  100% ( 69 / 69) in 'Data.HashMap.Strict'
unordered-containers>  100% ( 69 / 69) in 'Data.HashMap.Lazy'
unordered-containers> Warning: Data.HashMap.Internal: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Warning: Data.HashSet.Internal: could not find link destinations for:
unordered-containers>   - Data.HashSet.Internal.D:R:ItemHashSet
unordered-containers> Warning: Data.HashSet: could not find link destinations for:
unordered-containers>   - Data.HashSet.Internal.D:R:ItemHashSet
unordered-containers> Warning: Data.HashMap.Strict: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Warning: Data.HashMap.Lazy: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Documentation created: dist/doc/html/unordered-containers,
unordered-containers> dist/doc/html/unordered-containers/unordered-containers.txt
unordered-containers> Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
unordered-containers> Running phase: installPhase
unordered-containers> Installing library in /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
unordered-containers> Running phase: fixupPhase
unordered-containers> shrinking RPATHs of ELF executables and libraries in /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20
unordered-containers> shrinking /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSunordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV-ghc9.12.1.so
unordered-containers> checking for references to /build/ in /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20...
unordered-containers> patching script interpreter paths in /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20
unordered-containers> stripping (with command strip and flags -S -p) in  /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20/lib
unordered-containers> shrinking RPATHs of ELF executables and libraries in /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc
unordered-containers> checking for references to /build/ in /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc...
unordered-containers> patching script interpreter paths in /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc
unordered-containers (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20
unordered-containers (post)> Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
unordered-containers (post)> 
unordered-containers (post)> Pushing /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20 (9.78 MiB)
unordered-containers (post)> Pushing /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc (4.46 MiB)
unordered-containers (post)> 
unordered-containers (post)> All done.
unordered-containers (post)> added 2 signatures
unordered-containers (post)> added 2 signatures
unordered-containers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20
unordered-containers (post)> copying 2 paths...
unordered-containers (post)> copying path '/nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
unordered-containers (post)> copying path '/nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
unordered-containers (post)> copying 1 paths...
unordered-containers (post)> copying path '/nix/store/haa9x0jgbgyl1gncb4dryzcdmhrmvlyr-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
unordered-containers (post)> added 0 signatures
unordered-containers (post)> added 0 signatures
unordered-containers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc /nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20
unordered-containers (post)> copying 2 paths...
unordered-containers (post)> copying path '/nix/store/1dqv2hadgx3xcnpqqfka9ymh1svwjh71-unordered-containers-0.2.20-doc' to 'ssh-ng://worker.nix-ci.com'...
unordered-containers (post)> copying path '/nix/store/pf2mk3arh26j5p0gjd1srhf29r6jnvp2-unordered-containers-0.2.20' to 'ssh-ng://worker.nix-ci.com'...
unordered-containers (post)> copying 1 paths...
unordered-containers (post)> copying path '/nix/store/haa9x0jgbgyl1gncb4dryzcdmhrmvlyr-unordered-containers-0.2.20.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/k3q1cz2jhpvxqqwhcprpcd32rhp6q2vj-quickcheck-instances-0.3.32.drv'...
quickcheck-instances> Running phase: setupCompilerEnvironmentPhase
quickcheck-instances> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
quickcheck-instances> Running phase: unpackPhase
quickcheck-instances> unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
quickcheck-instances> source root is quickcheck-instances-0.3.32
quickcheck-instances> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
quickcheck-instances> Running phase: patchPhase
quickcheck-instances> Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
quickcheck-instances> Running phase: compileBuildDriverPhase
quickcheck-instances> setupCompileFlags: -package-db=/build/tmp.aUS7nrBOf5/setup-package.conf.d -threaded
quickcheck-instances> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.aUS7nrBOf5/Main.o )
quickcheck-instances> [2 of 2] Linking Setup
quickcheck-instances> Running phase: updateAutotoolsGnuConfigScriptsPhase
quickcheck-instances> Running phase: configurePhase
quickcheck-instances> configureFlags: --verbose --prefix=/nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.aUS7nrBOf5/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
quickcheck-instances> Using Parsec parser
quickcheck-instances> Configuring quickcheck-instances-0.3.32...
quickcheck-instances> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
quickcheck-instances> 'ghc' version < 9.12):
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
quickcheck-instances> 9.12.1
quickcheck-instances> Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
quickcheck-instances> Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
quickcheck-instances> Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
quickcheck-instances> Dependency base >=4.12.0.0 && <4.22: using base-4.21.0.0
quickcheck-instances> Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
quickcheck-instances> Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
quickcheck-instances> Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
quickcheck-instances> Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
quickcheck-instances> Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
quickcheck-instances> Dependency integer-logarithms >=1.0.3.1 && <1.1: using
quickcheck-instances> integer-logarithms-1.0.4
quickcheck-instances> Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
quickcheck-instances> Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
quickcheck-instances> Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
quickcheck-instances> Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
quickcheck-instances> Dependency strict >=0.5 && <0.6: using strict-0.5.1
quickcheck-instances> Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
quickcheck-instances> Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
quickcheck-instances> Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
quickcheck-instances> Dependency these >=1.2.1 && <1.3: using these-1.2.1
quickcheck-instances> Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
quickcheck-instances> Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.2
quickcheck-instances> Dependency unordered-containers >=0.2.20 && <0.3: using
quickcheck-instances> unordered-containers-0.2.20
quickcheck-instances> Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
quickcheck-instances> Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
quickcheck-instances> Dependency QuickCheck: using QuickCheck-2.14.3
quickcheck-instances> Dependency base: using base-4.21.0.0
quickcheck-instances> Dependency containers: using containers-0.7
quickcheck-instances> Dependency primitive: using primitive-0.9.1.0
quickcheck-instances> Dependency quickcheck-instances: using quickcheck-instances-0.3.32
quickcheck-instances> Dependency tagged: using tagged-0.8.9
quickcheck-instances> Dependency uuid-types: using uuid-types-1.0.6
quickcheck-instances> Source component graph:
quickcheck-instances>     component lib
quickcheck-instances>     component test:self-test dependency lib
quickcheck-instances> Configured component graph:
quickcheck-instances>     component quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances>         include OneTuple-0.4.2-1etABur84rnIpm4BxUeGkM
quickcheck-instances>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
quickcheck-instances>         include array-0.5.8.0-038b
quickcheck-instances>         include base-4.21.0.0-f068
quickcheck-instances>         include bytestring-0.12.2.0-be6d
quickcheck-instances>         include case-insensitive-1.2.1.0-1111wd92GfMLQ0M9sgP9TH
quickcheck-instances>         include containers-0.7-647d
quickcheck-instances>         include data-fix-0.3.4-5Z91m5Lp4p63x0eKjxyDHe
quickcheck-instances>         include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
quickcheck-instances>         include integer-logarithms-1.0.4-A2xX46hbkgB7IChpMOBT0v
quickcheck-instances>         include old-time-1.1.0.4-27MPESX8Qdi6qL3OyG7GpW
quickcheck-instances>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
quickcheck-instances>         include scientific-0.3.8.0-3okI0OjyUAXLySDZVSci1b
quickcheck-instances>         include splitmix-0.1.1-1EvesHEIqnf3WPcxWKF8Uw
quickcheck-instances>         include strict-0.5.1-E9ObxZudiKK9J4xi4Pfq2i
quickcheck-instances>         include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
quickcheck-instances>         include text-2.1.2-5eaa
quickcheck-instances>         include text-short-0.1.6-KmYT3m6Juw2HuCbOYybAlN
quickcheck-instances>         include these-1.2.1-77B7QTdYqCB8IXgulz2Gp9
quickcheck-instances>         include time-compat-1.9.8-2QmdPYKcH0x6Rtj68lHp55
quickcheck-instances>         include transformers-0.6.1.2-199f
quickcheck-instances>         include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
quickcheck-instances>         include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
quickcheck-instances>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
quickcheck-instances>     component quickcheck-instances-0.3.32-GLVoDjQO9W6LtAZCy0oWT7-self-test
quickcheck-instances>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
quickcheck-instances>         include base-4.21.0.0-f068
quickcheck-instances>         include containers-0.7-647d
quickcheck-instances>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
quickcheck-instances>         include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances>         include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
quickcheck-instances>         include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
quickcheck-instances> Linked component graph:
quickcheck-instances>     unit quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances>         include OneTuple-0.4.2-1etABur84rnIpm4BxUeGkM
quickcheck-instances>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
quickcheck-instances>         include array-0.5.8.0-038b
quickcheck-instances>         include base-4.21.0.0-f068
quickcheck-instances>         include bytestring-0.12.2.0-be6d
quickcheck-instances>         include case-insensitive-1.2.1.0-1111wd92GfMLQ0M9sgP9TH
quickcheck-instances>         include containers-0.7-647d
quickcheck-instances>         include data-fix-0.3.4-5Z91m5Lp4p63x0eKjxyDHe
quickcheck-instances>         include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
quickcheck-instances>         include integer-logarithms-1.0.4-A2xX46hbkgB7IChpMOBT0v
quickcheck-instances>         include old-time-1.1.0.4-27MPESX8Qdi6qL3OyG7GpW
quickcheck-instances>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
quickcheck-instances>         include scientific-0.3.8.0-3okI0OjyUAXLySDZVSci1b
quickcheck-instances>         include splitmix-0.1.1-1EvesHEIqnf3WPcxWKF8Uw
quickcheck-instances>         include strict-0.5.1-E9ObxZudiKK9J4xi4Pfq2i
quickcheck-instances>         include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
quickcheck-instances>         include text-2.1.2-5eaa
quickcheck-instances>         include text-short-0.1.6-KmYT3m6Juw2HuCbOYybAlN
quickcheck-instances>         include these-1.2.1-77B7QTdYqCB8IXgulz2Gp9
quickcheck-instances>         include time-compat-1.9.8-2QmdPYKcH0x6Rtj68lHp55
quickcheck-instances>         include transformers-0.6.1.2-199f
quickcheck-instances>         include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
quickcheck-instances>         include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
quickcheck-instances>         include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
quickcheck-instances>         Test.QuickCheck.Instances=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Void
quickcheck-instances>     unit quickcheck-instances-0.3.32-GLVoDjQO9W6LtAZCy0oWT7-self-test
quickcheck-instances>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
quickcheck-instances>         include base-4.21.0.0-f068
quickcheck-instances>         include containers-0.7-647d
quickcheck-instances>         include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
quickcheck-instances>         include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances>         include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
quickcheck-instances>         include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
quickcheck-instances> Ready component graph:
quickcheck-instances>     definite quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances>         depends OneTuple-0.4.2-1etABur84rnIpm4BxUeGkM
quickcheck-instances>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
quickcheck-instances>         depends array-0.5.8.0-038b
quickcheck-instances>         depends base-4.21.0.0-f068
quickcheck-instances>         depends bytestring-0.12.2.0-be6d
quickcheck-instances>         depends case-insensitive-1.2.1.0-1111wd92GfMLQ0M9sgP9TH
quickcheck-instances>         depends containers-0.7-647d
quickcheck-instances>         depends data-fix-0.3.4-5Z91m5Lp4p63x0eKjxyDHe
quickcheck-instances>         depends hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
quickcheck-instances>         depends integer-logarithms-1.0.4-A2xX46hbkgB7IChpMOBT0v
quickcheck-instances>         depends old-time-1.1.0.4-27MPESX8Qdi6qL3OyG7GpW
quickcheck-instances>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
quickcheck-instances>         depends scientific-0.3.8.0-3okI0OjyUAXLySDZVSci1b
quickcheck-instances>         depends splitmix-0.1.1-1EvesHEIqnf3WPcxWKF8Uw
quickcheck-instances>         depends strict-0.5.1-E9ObxZudiKK9J4xi4Pfq2i
quickcheck-instances>         depends tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
quickcheck-instances>         depends text-2.1.2-5eaa
quickcheck-instances>         depends text-short-0.1.6-KmYT3m6Juw2HuCbOYybAlN
quickcheck-instances>         depends these-1.2.1-77B7QTdYqCB8IXgulz2Gp9
quickcheck-instances>         depends time-compat-1.9.8-2QmdPYKcH0x6Rtj68lHp55
quickcheck-instances>         depends transformers-0.6.1.2-199f
quickcheck-instances>         depends unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
quickcheck-instances>         depends uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
quickcheck-instances>         depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
quickcheck-instances>     definite quickcheck-instances-0.3.32-GLVoDjQO9W6LtAZCy0oWT7-self-test
quickcheck-instances>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
quickcheck-instances>         depends base-4.21.0.0-f068
quickcheck-instances>         depends containers-0.7-647d
quickcheck-instances>         depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
quickcheck-instances>         depends quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances>         depends tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
quickcheck-instances>         depends uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
quickcheck-instances> Using Cabal-3.14.1.0 compiled by ghc-9.12
quickcheck-instances> Using compiler: ghc-9.12.1
quickcheck-instances> Using install prefix:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32
quickcheck-instances> Executables installed in:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/bin
quickcheck-instances> Libraries installed in:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances> Dynamic Libraries installed in:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
quickcheck-instances> Private executables installed in:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32
quickcheck-instances> Data files installed in:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32
quickcheck-instances> Documentation installed in:
quickcheck-instances> /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
quickcheck-instances> Configuration files installed in:
quickcheck-instances> /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/etc
quickcheck-instances> No alex found
quickcheck-instances> Using ar found on system at:
quickcheck-instances> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
quickcheck-instances> No c2hs found
quickcheck-instances> No cpphs found
quickcheck-instances> No doctest found
quickcheck-instances> Using gcc version 14.3.0 given by user at:
quickcheck-instances> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
quickcheck-instances> Using ghc version 9.12.1 found on system at:
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
quickcheck-instances> Using ghc-pkg version 9.12.1 found on system at:
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
quickcheck-instances> No ghcjs found
quickcheck-instances> No ghcjs-pkg found
quickcheck-instances> No greencard found
quickcheck-instances> Using haddock version 2.30.0 found on system at:
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
quickcheck-instances> No happy found
quickcheck-instances> No haskell-suite found
quickcheck-instances> No haskell-suite-pkg found
quickcheck-instances> No hmake found
quickcheck-instances> Using hpc version 0.69 found on system at:
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
quickcheck-instances> Using hsc2hs version 0.68.10 found on system at:
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
quickcheck-instances> Using hscolour version 1.25 found on system at:
quickcheck-instances> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
quickcheck-instances> No jhc found
quickcheck-instances> Using ld found on system at:
quickcheck-instances> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
quickcheck-instances> No pkg-config found
quickcheck-instances> Using runghc version 9.12.1 found on system at:
quickcheck-instances> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
quickcheck-instances> Using strip version 2.44 found on system at:
quickcheck-instances> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
quickcheck-instances> Using tar found on system at:
quickcheck-instances> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
quickcheck-instances> No uhc found
quickcheck-instances> Running phase: buildPhase
quickcheck-instances> Preprocessing library for quickcheck-instances-0.3.32...
quickcheck-instances> Building library for quickcheck-instances-0.3.32...
quickcheck-instances> [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.o, dist/build/Test/QuickCheck/Instances/Containers.dyn_o )
quickcheck-instances> [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.o, dist/build/Test/QuickCheck/Instances/CustomPrelude.dyn_o )
quickcheck-instances> [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
quickcheck-instances> [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.o, dist/build/Test/QuickCheck/Instances/ByteString.dyn_o )
quickcheck-instances> [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
quickcheck-instances> [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.o, dist/build/Test/QuickCheck/Instances/DataFix.dyn_o )
quickcheck-instances> [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.o, dist/build/Test/QuickCheck/Instances/Hashable.dyn_o )
quickcheck-instances> [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.o, dist/build/Test/QuickCheck/Instances/Natural.dyn_o )
quickcheck-instances> [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.o, dist/build/Test/QuickCheck/Instances/OldTime.dyn_o )
quickcheck-instances> [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.o, dist/build/Test/QuickCheck/Instances/Primitive.dyn_o )
quickcheck-instances> [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.o, dist/build/Test/QuickCheck/Instances/Array/Byte.dyn_o )
quickcheck-instances> [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.o, dist/build/Test/QuickCheck/Instances/Scientific.dyn_o )
quickcheck-instances> [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.o, dist/build/Test/QuickCheck/Instances/Semigroup.dyn_o )
quickcheck-instances> [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.o, dist/build/Test/QuickCheck/Instances/Solo.dyn_o )
quickcheck-instances> [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.o, dist/build/Test/QuickCheck/Instances/Strict.dyn_o )
quickcheck-instances> [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.o, dist/build/Test/QuickCheck/Instances/Tagged.dyn_o )
quickcheck-instances> [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.o, dist/build/Test/QuickCheck/Instances/Text.dyn_o )
quickcheck-instances> [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
quickcheck-instances> [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
quickcheck-instances> [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
quickcheck-instances> [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
quickcheck-instances> [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
quickcheck-instances> [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
quickcheck-instances> [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
quickcheck-instances> [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
quickcheck-instances> [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
quickcheck-instances> [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
quickcheck-instances> [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
quickcheck-instances> [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
quickcheck-instances> [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
quickcheck-instances> [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
quickcheck-instances> [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
quickcheck-instances> [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
quickcheck-instances> [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
quickcheck-instances> [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
quickcheck-instances> [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
quickcheck-instances> [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.p_o )
quickcheck-instances> [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
quickcheck-instances> [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
quickcheck-instances> [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
quickcheck-instances> [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
quickcheck-instances> [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
quickcheck-instances> [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
quickcheck-instances> [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
quickcheck-instances> [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
quickcheck-instances> [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
quickcheck-instances> [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
quickcheck-instances> [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
quickcheck-instances> [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
quickcheck-instances> [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
quickcheck-instances> [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
quickcheck-instances> [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
quickcheck-instances> Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32...
quickcheck-instances> Building test suite 'self-test' for quickcheck-instances-0.3.32...
quickcheck-instances> [1 of 1] Compiling Main             ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
quickcheck-instances> [2 of 2] Linking dist/build/self-test/self-test
quickcheck-instances> Running phase: checkPhase
quickcheck-instances> Running 1 test suites...
quickcheck-instances> Test suite self-test: RUNNING...
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> Test suite self-test: PASS
quickcheck-instances> Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
quickcheck-instances> 1 of 1 test suites (1 of 1 test cases) passed.
quickcheck-instances> Running phase: haddockPhase
quickcheck-instances> Preprocessing library for quickcheck-instances-0.3.32...
quickcheck-instances> Running Haddock on library for quickcheck-instances-0.3.32...
quickcheck-instances> Warning: The documentation for the following packages are not installed. No
quickcheck-instances> links will be generated to these packages: vector-0.13.2.0
quickcheck-instances> [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing ) [HIE file is missing]
quickcheck-instances> [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing ) [HIE file is missing]
quickcheck-instances> [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing ) [HIE file is missing]
quickcheck-instances> [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing ) [HIE file is missing]
quickcheck-instances> [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing ) [HIE file is missing]
quickcheck-instances> [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing ) [HIE file is missing]
quickcheck-instances> [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing ) [HIE file is missing]
quickcheck-instances> [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing ) [HIE file is missing]
quickcheck-instances> [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing ) [HIE file is missing]
quickcheck-instances> [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing ) [HIE file is missing]
quickcheck-instances> [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing ) [HIE file is missing]
quickcheck-instances> [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing ) [HIE file is missing]
quickcheck-instances> [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing ) [HIE file is missing]
quickcheck-instances> [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing ) [HIE file is missing]
quickcheck-instances> [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing ) [HIE file is missing]
quickcheck-instances> [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing ) [HIE file is missing]
quickcheck-instances> [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing ) [HIE file is missing]
quickcheck-instances> [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing ) [HIE file is missing]
quickcheck-instances> [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing ) [HIE file is missing]
quickcheck-instances> Haddock coverage:
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Containers'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.CaseInsensitive'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.ByteString'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Array'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.DataFix'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Hashable'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Natural'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.OldTime'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Primitive'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Array.Byte'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Scientific'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Semigroup'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Solo'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Strict'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Tagged'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Text'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Text.Short'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.These'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Time'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Transformer'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.UUID'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.UnorderedContainers'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Vector'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Void'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>  100% (  1 /  1) in 'Test.QuickCheck.Instances'
quickcheck-instances> Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
quickcheck-instances>   - Data.Vector.Vector
quickcheck-instances>   - Data.Vector.Primitive.Vector
quickcheck-instances>   - Data.Vector.Unboxed.Base.Vector
quickcheck-instances>   - Data.Vector.Storable.Vector
quickcheck-instances>   - Data.Vector.Unboxed.Base.Unbox
quickcheck-instances> Documentation created: dist/doc/html/quickcheck-instances,
quickcheck-instances> dist/doc/html/quickcheck-instances/quickcheck-instances.txt
quickcheck-instances> Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32...
quickcheck-instances> Running phase: installPhase
quickcheck-instances> Installing library in /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
quickcheck-instances> Running phase: fixupPhase
quickcheck-instances> shrinking RPATHs of ELF executables and libraries in /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32
quickcheck-instances> shrinking /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSquickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx-ghc9.12.1.so
quickcheck-instances> checking for references to /build/ in /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32...
quickcheck-instances> patching script interpreter paths in /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32
quickcheck-instances> stripping (with command strip and flags -S -p) in  /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32/lib
quickcheck-instances> shrinking RPATHs of ELF executables and libraries in /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc
quickcheck-instances> checking for references to /build/ in /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc...
quickcheck-instances> patching script interpreter paths in /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc
quickcheck-instances (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32 /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc
quickcheck-instances (post)> Pushing 2 paths (128 are already present) using zstd to cache sellout ⏳
quickcheck-instances (post)> 
quickcheck-instances (post)> Pushing /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32 (5.43 MiB)
quickcheck-instances (post)> Pushing /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc (1.49 MiB)
quickcheck-instances (post)> 
quickcheck-instances (post)> All done.
quickcheck-instances (post)> added 2 signatures
quickcheck-instances (post)> added 17 signatures
quickcheck-instances (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32 /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc
quickcheck-instances (post)> copying 2 paths...
quickcheck-instances (post)> copying path '/nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...
quickcheck-instances (post)> copying path '/nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
quickcheck-instances (post)> copying 1 paths...
quickcheck-instances (post)> copying path '/nix/store/k3q1cz2jhpvxqqwhcprpcd32rhp6q2vj-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
quickcheck-instances (post)> added 0 signatures
quickcheck-instances (post)> added 0 signatures
quickcheck-instances (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32 /nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc
quickcheck-instances (post)> copying 2 paths...
quickcheck-instances (post)> copying path '/nix/store/h2p1cgzpr21caxqclwlbgz6x1i66qacz-quickcheck-instances-0.3.32-doc' to 'ssh-ng://worker.nix-ci.com'...
quickcheck-instances (post)> copying path '/nix/store/cjyw0r19h9dgb7zvb8ndlmf2q1q29ba4-quickcheck-instances-0.3.32' to 'ssh-ng://worker.nix-ci.com'...
quickcheck-instances (post)> copying 1 paths...
quickcheck-instances (post)> copying path '/nix/store/k3q1cz2jhpvxqqwhcprpcd32rhp6q2vj-quickcheck-instances-0.3.32.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/zh4059nwk2z28s01gwd5dy81332j1s51-extra-1.8.drv'...
extra> Running phase: setupCompilerEnvironmentPhase
extra> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
extra> Running phase: unpackPhase
extra> unpacking source archive /nix/store/djwymlbaqpzn2y2l24hzjxn7wfn797lb-extra-1.8.tar.gz
extra> source root is extra-1.8
extra> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8/test/TestUtil.hs"
extra> Running phase: patchPhase
extra> Running phase: compileBuildDriverPhase
extra> setupCompileFlags: -package-db=/build/tmp.yP9aBIc0as/setup-package.conf.d -threaded
extra> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.yP9aBIc0as/Main.o )
extra> [2 of 2] Linking Setup
extra> Running phase: updateAutotoolsGnuConfigScriptsPhase
extra> Running phase: configurePhase
extra> configureFlags: --verbose --prefix=/nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc/share/doc/extra-1.8 --with-gcc=gcc --package-db=/build/tmp.yP9aBIc0as/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
extra> Using Parsec parser
extra> Configuring extra-1.8...
extra> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
extra> 'ghc' version < 9.12):
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
extra> 9.12.1
extra> Dependency base >=4.9 && <5: using base-4.21.0.0
extra> Dependency clock >=0.7: using clock-0.8.4
extra> Dependency directory: using directory-1.3.9.0
extra> Dependency filepath: using filepath-1.5.4.0
extra> Dependency process: using process-1.6.25.0
extra> Dependency time: using time-1.14
extra> Dependency unix: using unix-2.8.6.0
extra> Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
extra> Dependency base >=4 && <5: using base-4.21.0.0
extra> Dependency directory: using directory-1.3.9.0
extra> Dependency extra: using extra-1.8
extra> Dependency filepath: using filepath-1.5.4.0
extra> Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
extra> Dependency unix: using unix-2.8.6.0
extra> Source component graph:
extra>     component lib
extra>     component test:extra-test dependency lib
extra> Configured component graph:
extra>     component extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra>         include base-4.21.0.0-f068
extra>         include clock-0.8.4-Anpw0cdR7mRADMTnlDMyXN
extra>         include directory-1.3.9.0-9eff
extra>         include filepath-1.5.4.0-7ce6
extra>         include process-1.6.25.0-4623
extra>         include time-1.14-f7a8
extra>         include unix-2.8.6.0-6369
extra>     component extra-1.8-L5li7mcIG4uIAGoQVyko2B-extra-test
extra>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
extra>         include base-4.21.0.0-f068
extra>         include directory-1.3.9.0-9eff
extra>         include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra>         include filepath-1.5.4.0-7ce6
extra>         include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
extra>         include unix-2.8.6.0-6369
extra> Linked component graph:
extra>     unit extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra>         include base-4.21.0.0-f068
extra>         include clock-0.8.4-Anpw0cdR7mRADMTnlDMyXN
extra>         include directory-1.3.9.0-9eff
extra>         include filepath-1.5.4.0-7ce6
extra>         include process-1.6.25.0-4623
extra>         include time-1.14-f7a8
extra>         include unix-2.8.6.0-6369
extra>         Control.Concurrent.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Control.Exception.Extra,Control.Monad.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Control.Monad.Extra,Data.Either.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Either.Extra,Data.Foldable.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.IORef.Extra,Data.List.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Typeable.Extra,Data.Version.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Version.Extra,Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Extra,Numeric.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Numeric.Extra,System.Directory.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Directory.Extra,System.Environment.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Environment.Extra,System.IO.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.IO.Extra,System.Info.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Info.Extra,System.Process.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Process.Extra,System.Time.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Time.Extra,Text.Read.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Text.Read.Extra
extra>     unit extra-1.8-L5li7mcIG4uIAGoQVyko2B-extra-test
extra>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
extra>         include base-4.21.0.0-f068
extra>         include directory-1.3.9.0-9eff
extra>         include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra>         include filepath-1.5.4.0-7ce6
extra>         include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
extra>         include unix-2.8.6.0-6369
extra> Ready component graph:
extra>     definite extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra>         depends base-4.21.0.0-f068
extra>         depends clock-0.8.4-Anpw0cdR7mRADMTnlDMyXN
extra>         depends directory-1.3.9.0-9eff
extra>         depends filepath-1.5.4.0-7ce6
extra>         depends process-1.6.25.0-4623
extra>         depends time-1.14-f7a8
extra>         depends unix-2.8.6.0-6369
extra>     definite extra-1.8-L5li7mcIG4uIAGoQVyko2B-extra-test
extra>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
extra>         depends base-4.21.0.0-f068
extra>         depends directory-1.3.9.0-9eff
extra>         depends extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra>         depends filepath-1.5.4.0-7ce6
extra>         depends quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
extra>         depends unix-2.8.6.0-6369
extra> Using Cabal-3.14.1.0 compiled by ghc-9.12
extra> Using compiler: ghc-9.12.1
extra> Using install prefix: /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8
extra> Executables installed in:
extra> /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/bin
extra> Libraries installed in:
extra> /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra> Dynamic Libraries installed in:
extra> /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
extra> Private executables installed in:
extra> /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/libexec/x86_64-linux-ghc-9.12.1-f739/extra-1.8
extra> Data files installed in:
extra> /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/share/x86_64-linux-ghc-9.12.1-f739/extra-1.8
extra> Documentation installed in:
extra> /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc/share/doc/extra-1.8
extra> Configuration files installed in:
extra> /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/etc
extra> No alex found
extra> Using ar found on system at:
extra> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
extra> No c2hs found
extra> No cpphs found
extra> No doctest found
extra> Using gcc version 14.3.0 given by user at:
extra> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
extra> Using ghc version 9.12.1 found on system at:
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
extra> Using ghc-pkg version 9.12.1 found on system at:
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
extra> No ghcjs found
extra> No ghcjs-pkg found
extra> No greencard found
extra> Using haddock version 2.30.0 found on system at:
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
extra> No happy found
extra> No haskell-suite found
extra> No haskell-suite-pkg found
extra> No hmake found
extra> Using hpc version 0.69 found on system at:
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
extra> Using hsc2hs version 0.68.10 found on system at:
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
extra> Using hscolour version 1.25 found on system at:
extra> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
extra> No jhc found
extra> Using ld found on system at:
extra> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
extra> No pkg-config found
extra> Using runghc version 9.12.1 found on system at:
extra> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
extra> Using strip version 2.44 found on system at:
extra> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
extra> Using tar found on system at:
extra> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
extra> No uhc found
extra> Running phase: buildPhase
extra> Preprocessing library for extra-1.8...
extra> Building library for extra-1.8...
extra> [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.o, dist/build/Data/IORef/Extra.dyn_o )
extra> [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.o, dist/build/Data/Monoid/Extra.dyn_o )
extra> [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.o, dist/build/Data/Tuple/Extra.dyn_o )
extra> [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.o, dist/build/Data/Typeable/Extra.dyn_o )
extra> [ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
extra> [ 6 of 22] Compiling Partial          ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
extra> [ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.o, dist/build/Data/List/Extra.dyn_o )
extra> [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
extra> [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.o, dist/build/Data/List/NonEmpty/Extra.dyn_o )
extra> [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.o, dist/build/Data/Either/Extra.dyn_o )
extra> [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.o, dist/build/Control/Exception/Extra.dyn_o )
extra> [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.o, dist/build/Control/Monad/Extra.dyn_o )
extra> [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.o, dist/build/Data/Foldable/Extra.dyn_o )
extra> [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
extra> [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.o, dist/build/System/Directory/Extra.dyn_o )
extra> [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.o, dist/build/System/Environment/Extra.dyn_o )
extra> [17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.o, dist/build/System/IO/Extra.dyn_o )
extra> [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.o, dist/build/System/Info/Extra.dyn_o )
extra> [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.o, dist/build/System/Process/Extra.dyn_o )
extra> [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.o, dist/build/System/Time/Extra.dyn_o )
extra> [21 of 22] Compiling Extra            ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
extra> [22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.o, dist/build/Text/Read/Extra.dyn_o )
extra> [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
extra> [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
extra> [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
extra> [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
extra> [ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
extra> [ 6 of 22] Compiling Partial          ( src/Partial.hs, dist/build/Partial.p_o )
extra> [ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
extra> [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
extra> [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
extra> [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
extra> [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
extra> [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
extra> [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
extra> [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
extra> [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
extra> [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
extra> [17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
extra> [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
extra> [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
extra> [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
extra> [21 of 22] Compiling Extra            ( src/Extra.hs, dist/build/Extra.p_o )
extra> [22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
extra> Preprocessing test suite 'extra-test' for extra-1.8...
extra> Building test suite 'extra-test' for extra-1.8...
extra> [1 of 4] Compiling TestUtil         ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
extra> [2 of 4] Compiling TestGen          ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
extra> [3 of 4] Compiling TestCustom       ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
extra> [4 of 4] Compiling Test             ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
extra> [5 of 5] Linking dist/build/extra-test/extra-test
extra> Running phase: checkPhase
extra> Running 1 test suites...
extra> Test suite extra-test: RUNNING...
extra> withTempFile
extra> +++ OK, passed 1 test.
extra> captureOutput
extra> +++ OK, passed 1 test.
extra> \(x :: IO Int) -> void (once x) == pure ()
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> join (once x) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> (do y <- once x; y; y) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> (do y <- once x; y ||| y) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> join (onceFork x) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
extra> +++ OK, passed 100 tests.
extra> stringException "test"                           == pure "test"
extra> +++ OK, passed 1 test.
extra> stringException ("test" ++ undefined)            == pure "test<Exception>"
extra> +++ OK, passed 1 test.
extra> stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
extra> +++ OK, passed 1 test.
extra> stringException ['t','e','s','t',undefined]      == pure "test<Exception>"
extra> +++ OK, passed 1 test.
extra> ignore (print 1)    == print 1
extra> +++ OK, passed 1 test.
extra> ignore (fail "die") == pure ()
extra> +++ OK, passed 1 test.
extra> catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
extra> +++ OK, passed 1 test.
extra> seq (errorIO "foo") (print 1) == print 1
extra> +++ OK, passed 1 test.
extra> catch (assertIO True  >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
extra> +++ OK, passed 1 test.
extra> seq (assertIO False) (print 1) == print 1
extra> +++ OK, passed 1 test.
extra> retry 1 (print "x")  == print "x"
extra> +++ OK, passed 1 test.
extra> retry 3 (fail "die") == fail "die"
extra> +++ OK, passed 1 test.
extra> whenJust Nothing  print == pure ()
extra> +++ OK, passed 1 test.
extra> whenJust (Just 1) print == print 1
extra> +++ OK, passed 1 test.
extra> pureIf @Maybe True  5 == Just 5
extra> +++ OK, passed 1 test.
extra> pureIf @Maybe False 5 == Nothing
extra> +++ OK, passed 1 test.
extra> pureIf @[]    True  5 == [5]
extra> +++ OK, passed 1 test.
extra> pureIf @[]    False 5 == []
extra> +++ OK, passed 1 test.
extra> whenMaybe True  (print 1) == fmap Just (print 1)
extra> +++ OK, passed 1 test.
extra> whenMaybe False (print 1) == pure Nothing
extra> +++ OK, passed 1 test.
extra> \(x :: Maybe ()) -> unit x == x
extra> +++ OK, passed 100 tests.
extra> guarded even 2 == [2]
extra> +++ OK, passed 1 test.
extra> guarded odd 2 == Nothing
extra> +++ OK, passed 1 test.
extra> guarded (not.null) "My Name" == Just "My Name"
extra> +++ OK, passed 1 test.
extra> guardedA (return . even) 42    == Just [42]
extra> +++ OK, passed 1 test.
extra> guardedA (return . odd) 42     == Just []
extra> +++ OK, passed 1 test.
extra> guardedA (const Nothing) 42    == (Nothing :: Maybe [Int])
extra> +++ OK, passed 1 test.
extra> fold1M (\x y -> Just x) [] == undefined
extra> +++ OK, passed 1 test.
extra> fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
extra> +++ OK, passed 1 test.
extra> partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
extra> +++ OK, passed 1 test.
extra> partitionM (const Nothing) [1,2,3] == Nothing
extra> +++ OK, passed 1 test.
extra> loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
extra> +++ OK, passed 1 test.
extra> Just True  ||^ undefined  == Just True
extra> +++ OK, passed 1 test.
extra> Just False ||^ Just True  == Just True
extra> +++ OK, passed 1 test.
extra> Just False ||^ Just False == Just False
extra> +++ OK, passed 1 test.
extra> Just False &&^ undefined  == Just False
extra> +++ OK, passed 1 test.
extra> Just True  &&^ Just True  == Just True
extra> +++ OK, passed 1 test.
extra> Just True  &&^ Just False == Just False
extra> +++ OK, passed 1 test.
extra> anyM Just [False,True ,undefined] == Just True
extra> +++ OK, passed 1 test.
extra> anyM Just [False,False,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
extra> +++ OK, passed 100 tests.
extra> allM Just [True,False,undefined] == Just False
extra> +++ OK, passed 1 test.
extra> allM Just [True,True ,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
extra> +++ OK, passed 100 tests.
extra> orM [Just False,Just True ,undefined] == Just True
extra> +++ OK, passed 1 test.
extra> orM [Just False,Just False,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \xs -> Just (or xs) == orM (map Just xs)
extra> +++ OK, passed 100 tests.
extra> andM [Just True,Just False,undefined] == Just False
extra> +++ OK, passed 1 test.
extra> andM [Just True,Just True ,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \xs -> Just (and xs) == andM (map Just xs)
extra> +++ OK, passed 100 tests.
extra> findM (Just . isUpper) "teST"             == Just (Just 'S')
extra> +++ OK, passed 1 test.
extra> findM (Just . isUpper) "test"             == Just Nothing
extra> +++ OK, passed 1 test.
extra> findM (Just . const True) ["x",undefined] == Just (Just "x")
extra> +++ OK, passed 1 test.
extra> fromLeft 1 (Left 3) == 3
extra> +++ OK, passed 1 test.
extra> fromLeft 1 (Right "foo") == 1
extra> +++ OK, passed 1 test.
extra> fromRight 1 (Right 3) == 3
extra> +++ OK, passed 1 test.
extra> fromRight 1 (Left "foo") == 1
extra> +++ OK, passed 1 test.
extra> \x -> fromLeft' (Left  x) == x
extra> +++ OK, passed 100 tests.
extra> \x -> fromLeft' (Right x) == undefined
extra> +++ OK, passed 100 tests.
extra> \x -> fromRight' (Right x) == x
extra> +++ OK, passed 100 tests.
extra> \x -> fromRight' (Left  x) == undefined
extra> +++ OK, passed 100 tests.
extra> \x -> fromEither (Left x ) == x
extra> +++ OK, passed 100 tests.
extra> \x -> fromEither (Right x) == x
extra> +++ OK, passed 100 tests.
extra> \a b -> maybeToEither a (Just b) == Right b
extra> +++ OK, passed 100 tests.
extra> \a -> maybeToEither a Nothing == Left a
extra> +++ OK, passed 100 tests.
extra> \x -> eitherToMaybe (Left x) == Nothing
extra> +++ OK, passed 100 tests.
extra> \x -> eitherToMaybe (Right x) == Just x
extra> +++ OK, passed 100 tests.
extra> mapLeft show (Left 1) == Left "1"
extra> +++ OK, passed 1 test.
extra> mapLeft show (Right True) == Right True
extra> +++ OK, passed 1 test.
extra> mapRight show (Left 1) == Left 1
extra> +++ OK, passed 1 test.
extra> mapRight show (Right True) == Right "True"
extra> +++ OK, passed 1 test.
extra> \xs -> repeatedly (splitAt 3) xs  == chunksOf 3 xs
extra> +++ OK, passed 100 tests.
extra> \xs -> repeatedly word1 (trim xs) == words xs
extra> +++ OK, passed 100 tests.
extra> \xs -> repeatedly line1 xs == lines xs
extra> +++ OK, passed 100 tests.
extra> disjoint [1,2,3] [4,5] == True
extra> +++ OK, passed 1 test.
extra> disjoint [1,2,3] [4,1] == False
extra> +++ OK, passed 1 test.
extra> disjointOrd [1,2,3] [4,5] == True
extra> +++ OK, passed 1 test.
extra> disjointOrd [1,2,3] [4,1] == False
extra> +++ OK, passed 1 test.
extra> disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
extra> +++ OK, passed 1 test.
extra> disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
extra> +++ OK, passed 1 test.
extra> anySame [1,1,2] == True
extra> +++ OK, passed 1 test.
extra> anySame [1,2,3] == False
extra> +++ OK, passed 1 test.
extra> anySame (1:2:1:undefined) == True
extra> +++ OK, passed 1 test.
extra> anySame [] == False
extra> +++ OK, passed 1 test.
extra> \xs -> anySame xs == (length (nub xs) < length xs)
extra> +++ OK, passed 100 tests.
extra> allSame [1,1,2] == False
extra> +++ OK, passed 1 test.
extra> allSame [1,1,1] == True
extra> +++ OK, passed 1 test.
extra> allSame [1]     == True
extra> +++ OK, passed 1 test.
extra> allSame []      == True
extra> +++ OK, passed 1 test.
extra> allSame (1:1:2:undefined) == False
extra> +++ OK, passed 1 test.
extra> \xs -> allSame xs == (length (nub xs) <= 1)
extra> +++ OK, passed 100 tests.
extra> headDef 1 []      == 1
extra> +++ OK, passed 1 test.
extra> headDef 1 [2,3,4] == 2
extra> +++ OK, passed 1 test.
extra> \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
extra> +++ OK, passed 100 tests.
extra> lastDef 1 []      == 1
extra> +++ OK, passed 1 test.
extra> lastDef 1 [2,3,4] == 4
extra> +++ OK, passed 1 test.
extra> \x xs -> lastDef x xs == last (x:xs)
extra> +++ OK, passed 100 tests.
extra> [2,3,4] !? 1    == Just 3
extra> +++ OK, passed 1 test.
extra> [2,3,4] !? (-1) == Nothing
extra> +++ OK, passed 1 test.
extra> []      !? 0    == Nothing
extra> +++ OK, passed 1 test.
extra> notNull []  == False
extra> +++ OK, passed 1 test.
extra> notNull [1] == True
extra> +++ OK, passed 1 test.
extra> \xs -> notNull xs == not (null xs)
extra> +++ OK, passed 100 tests.
extra> list 1 (\v _ -> v - 2) [5,6,7] == 3
extra> +++ OK, passed 1 test.
extra> list 1 (\v _ -> v - 2) []      == 1
extra> +++ OK, passed 1 test.
extra> \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
extra> +++ OK, passed 100 tests.
extra> unsnoc "test" == Just ("tes",'t')
extra> +++ OK, passed 1 test.
extra> unsnoc ""     == Nothing
extra> +++ OK, passed 1 test.
extra> \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
extra> +++ OK, passed 100 tests.
extra> cons 't' "est" == "test"
extra> +++ OK, passed 1 test.
extra> \x xs -> uncons (cons x xs) == Just (x,xs)
extra> +++ OK, passed 100 tests.
extra> snoc "tes" 't' == "test"
extra> +++ OK, passed 1 test.
extra> \xs x -> unsnoc (snoc xs x) == Just (xs,x)
extra> +++ OK, passed 100 tests.
extra> enumerate == [False, True]
extra> +++ OK, passed 1 test.
extra> takeEnd 3 "hello"  == "llo"
extra> +++ OK, passed 1 test.
extra> takeEnd 5 "bye"    == "bye"
extra> +++ OK, passed 1 test.
extra> takeEnd (-1) "bye" == ""
extra> +++ OK, passed 1 test.
extra> \i xs -> takeEnd i xs `isSuffixOf` xs
extra> +++ OK, passed 100 tests.
extra> \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
extra> +++ OK, passed 100 tests.
extra> dropEnd 3 "hello"  == "he"
extra> +++ OK, passed 1 test.
extra> dropEnd 5 "bye"    == ""
extra> +++ OK, passed 1 test.
extra> dropEnd (-1) "bye" == "bye"
extra> +++ OK, passed 1 test.
extra> \i xs -> dropEnd i xs `isPrefixOf` xs
extra> +++ OK, passed 100 tests.
extra> \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
extra> +++ OK, passed 100 tests.
extra> \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
extra> +++ OK, passed 100 tests.
extra> splitAtEnd 3 "hello" == ("he","llo")
extra> +++ OK, passed 1 test.
extra> splitAtEnd 3 "he"    == ("", "he")
extra> +++ OK, passed 1 test.
extra> \i xs -> uncurry (++) (splitAt i xs) == xs
extra> +++ OK, passed 100 tests.
extra> \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
extra> +++ OK, passed 100 tests.
extra> \i xs -> zip [i..] xs == zipFrom i xs
extra> +++ OK, passed 100 tests.
extra> zipFrom False [1..3] == [(False,1),(True, 2)]
extra> +++ OK, passed 1 test.
extra> \i xs -> zipWithFrom (,) i xs == zipFrom i xs
extra> +++ OK, passed 100 tests.
extra> concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
extra> +++ OK, passed 1 test.
extra> concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
extra> +++ OK, passed 1 test.
extra> takeWhileEnd even [2,3,4,6] == [4,6]
extra> +++ OK, passed 1 test.
extra> trim      "  hello   " == "hello"
extra> +++ OK, passed 1 test.
extra> trimStart "  hello   " == "hello   "
extra> +++ OK, passed 1 test.
extra> trimEnd   "  hello   " == "  hello"
extra> +++ OK, passed 1 test.
extra> \s -> trim s == trimEnd (trimStart s)
extra> +++ OK, passed 100 tests.
extra> lower "This is A TEST" == "this is a test"
extra> +++ OK, passed 1 test.
extra> lower "" == ""
extra> +++ OK, passed 1 test.
extra> upper "This is A TEST" == "THIS IS A TEST"
extra> +++ OK, passed 1 test.
extra> upper "" == ""
extra> +++ OK, passed 1 test.
extra> word1 "" == ("", "")
extra> +++ OK, passed 1 test.
extra> word1 "keyword rest of string" == ("keyword","rest of string")
extra> +++ OK, passed 1 test.
extra> word1 "  keyword\n  rest of string" == ("keyword","rest of string")
extra> +++ OK, passed 1 test.
extra> \s -> fst (word1 s) == concat (take 1 $ words s)
extra> +++ OK, passed 100 tests.
extra> \s -> words (snd $ word1 s) == drop 1 (words s)
extra> +++ OK, passed 100 tests.
extra> line1 "" == ("", "")
extra> +++ OK, passed 1 test.
extra> line1 "test" == ("test","")
extra> +++ OK, passed 1 test.
extra> line1 "test\n" == ("test","")
extra> +++ OK, passed 1 test.
extra> line1 "test\nrest" == ("test","rest")
extra> +++ OK, passed 1 test.
extra> line1 "test\nrest\nmore" == ("test","rest\nmore")
extra> +++ OK, passed 1 test.
extra> escapeHTML "this is a test" == "this is a test"
extra> +++ OK, passed 1 test.
extra> escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
extra> +++ OK, passed 1 test.
extra> escapeHTML "t'was another test" == "t&#39;was another test"
extra> +++ OK, passed 1 test.
extra> \xs -> unescapeHTML (escapeHTML xs) == xs
extra> +++ OK, passed 100 tests.
extra> escapeJSON "this is a test" == "this is a test"
extra> +++ OK, passed 1 test.
extra> escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
extra> +++ OK, passed 1 test.
extra> escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
extra> +++ OK, passed 1 test.
extra> \xs -> unescapeJSON (escapeJSON xs) == xs
extra> +++ OK, passed 100 tests.
extra> groupOn abs [1,-1,2] == [[1,-1], [2]]
extra> +++ OK, passed 1 test.
extra> groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
extra> +++ OK, passed 1 test.
extra> maximumOn id [] == undefined
extra> +++ OK, passed 1 test.
extra> maximumOn length ["test","extra","a"] == "extra"
extra> +++ OK, passed 1 test.
extra> minimumOn id [] == undefined
extra> +++ OK, passed 1 test.
extra> minimumOn length ["test","extra","a"] == "a"
extra> +++ OK, passed 1 test.
extra> groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
extra> +++ OK, passed 1 test.
extra> \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
extra> +++ OK, passed 100 tests.
extra> \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
extra> +++ OK, passed 100 tests.
extra> groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
extra> +++ OK, passed 1 test.
extra> groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
extra> +++ OK, passed 1 test.
extra> sum' [1, 2, 3] == 6
extra> +++ OK, passed 1 test.
extra> sumOn' read ["1", "2", "3"] == 6
extra> +++ OK, passed 1 test.
extra> product' [1, 2, 4] == 8
extra> +++ OK, passed 1 test.
extra> productOn' read ["1", "2", "4"] == 8
extra> +++ OK, passed 1 test.
extra> merge "ace" "bd" == "abcde"
extra> +++ OK, passed 1 test.
extra> \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
extra> +++ OK, passed 100 tests.
extra> replace "el" "_" "Hello Bella" == "H_lo B_la"
extra> +++ OK, passed 1 test.
extra> replace "el" "e" "Hello"       == "Helo"
extra> +++ OK, passed 1 test.
extra> replace "" "x" "Hello"         == "xHxexlxlxox"
extra> +++ OK, passed 1 test.
extra> replace "" "x" ""              == "x"
extra> +++ OK, passed 1 test.
extra> \xs ys -> replace xs xs ys == ys
extra> +++ OK, passed 100 tests.
extra> breakEnd isLower "youRE" == ("you","RE")
extra> +++ OK, passed 1 test.
extra> breakEnd isLower "youre" == ("youre","")
extra> +++ OK, passed 1 test.
extra> breakEnd isLower "YOURE" == ("","YOURE")
extra> +++ OK, passed 1 test.
extra> \f xs -> breakEnd (not . f) xs == spanEnd f  xs
extra> +++ OK, passed 100 tests.
extra> spanEnd isUpper "youRE" == ("you","RE")
extra> +++ OK, passed 1 test.
extra> spanEnd (not . isSpace) "x y z" == ("x y ","z")
extra> +++ OK, passed 1 test.
extra> \f xs -> uncurry (++) (spanEnd f xs) == xs
extra> +++ OK, passed 100 tests.
extra> \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
extra> +++ OK, passed 100 tests.
extra> wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
extra> +++ OK, passed 1 test.
extra> \s -> wordsBy isSpace s == words s
extra> +++ OK, passed 100 tests.
extra> linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
extra> +++ OK, passed 1 test.
extra> \s -> linesBy (== '\n') s == lines s
extra> +++ OK, passed 100 tests.
extra> linesBy (== ';') "my;list;here;" == ["my","list","here"]
extra> +++ OK, passed 1 test.
extra> firstJust id [Nothing,Just 3]  == Just 3
extra> +++ OK, passed 1 test.
extra> firstJust id [Nothing,Nothing] == Nothing
extra> +++ OK, passed 1 test.
extra> drop1 ""         == ""
extra> +++ OK, passed 1 test.
extra> drop1 "test"     == "est"
extra> +++ OK, passed 1 test.
extra> \xs -> drop 1 xs == drop1 xs
extra> +++ OK, passed 100 tests.
extra> dropEnd1 ""         == ""
extra> +++ OK, passed 1 test.
extra> dropEnd1 "test"     == "tes"
extra> +++ OK, passed 1 test.
extra> \xs -> dropEnd 1 xs == dropEnd1 xs
extra> +++ OK, passed 100 tests.
extra> mconcatMap Sum [1,2,3] == Sum 6
extra> +++ OK, passed 1 test.
extra> \f xs -> mconcatMap f xs == concatMap f xs
extra> +++ OK, passed 100 tests.
extra> breakOn "::" "a::b::c" == ("a", "::b::c")
extra> +++ OK, passed 1 test.
extra> breakOn "/" "foobar"   == ("foobar", "")
extra> +++ OK, passed 1 test.
extra> \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
extra> +++ OK, passed 100 tests.
extra> breakOnEnd "::" "a::b::c" == ("a::b::", "c")
extra> +++ OK, passed 1 test.
extra> splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
extra> +++ OK, passed 1 test.
extra> splitOn "aaa"  "aaaXaaaXaaaXaaa"  == ["","X","X","X",""]
extra> +++ OK, passed 1 test.
extra> splitOn "x"    "x"                == ["",""]
extra> +++ OK, passed 1 test.
extra> splitOn "x"    ""                 == [""]
extra> +++ OK, passed 1 test.
extra> \s x -> s /= "" ==> intercalate s (splitOn s x) == x
extra> +++ OK, passed 100 tests; 15 discarded.
extra> \c x -> splitOn [c] x                           == split (==c) x
extra> +++ OK, passed 100 tests.
extra> split (== 'a') "aabbaca" == ["","","bb","c",""]
extra> +++ OK, passed 1 test.
extra> split (== 'a') ""        == [""]
extra> +++ OK, passed 1 test.
extra> split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
extra> +++ OK, passed 1 test.
extra> split (== ',') "my,list,here" == ["my","list","here"]
extra> +++ OK, passed 1 test.
extra> dropWhileEnd  isSpace "ab cde  " == "ab cde"
extra> +++ OK, passed 1 test.
extra> dropWhileEnd' isSpace "ab cde  " == "ab cde"
extra> +++ OK, passed 1 test.
extra> last (dropWhileEnd  even [undefined,3]) == undefined
extra> +++ OK, passed 1 test.
extra> last (dropWhileEnd' even [undefined,3]) == 3
extra> +++ OK, passed 1 test.
extra> head (dropWhileEnd  even (3:undefined)) == 3
extra> +++ OK, passed 1 test.
extra> head (dropWhileEnd' even (3:undefined)) == undefined
extra> +++ OK, passed 1 test.
extra> dropPrefix "Mr. " "Mr. Men" == "Men"
extra> +++ OK, passed 1 test.
extra> dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
extra> +++ OK, passed 1 test.
extra> dropSuffix "!" "Hello World!"  == "Hello World"
extra> +++ OK, passed 1 test.
extra> dropSuffix "!" "Hello World!!" == "Hello World!"
extra> +++ OK, passed 1 test.
extra> dropSuffix "!" "Hello World."  == "Hello World."
extra> +++ OK, passed 1 test.
extra> stripSuffix "bar" "foobar" == Just "foo"
extra> +++ OK, passed 1 test.
extra> stripSuffix ""    "baz"    == Just "baz"
extra> +++ OK, passed 1 test.
extra> stripSuffix "foo" "quux"   == Nothing
extra> +++ OK, passed 1 test.
extra> stripInfix "::" "a::b::c" == Just ("a", "b::c")
extra> +++ OK, passed 1 test.
extra> stripInfix "/" "foobar"   == Nothing
extra> +++ OK, passed 1 test.
extra> stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
extra> +++ OK, passed 1 test.
extra> chunksOf 3 "my test" == ["my ","tes","t"]
extra> +++ OK, passed 1 test.
extra> chunksOf 3 "mytest"  == ["myt","est"]
extra> +++ OK, passed 1 test.
extra> chunksOf 8 ""        == []
extra> +++ OK, passed 1 test.
extra> chunksOf 0 "test"    == undefined
extra> +++ OK, passed 1 test.
extra> nubSort "this is a test" == " aehist"
extra> +++ OK, passed 1 test.
extra> \xs -> nubSort xs == nub (sort xs)
extra> +++ OK, passed 100 tests.
extra> nubSortOn length ["a","test","of","this"] == ["a","of","test"]
extra> +++ OK, passed 1 test.
extra> nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
extra> +++ OK, passed 1 test.
extra> nubOrd "this is a test" == "this ae"
extra> +++ OK, passed 1 test.
extra> nubOrd (take 4 ("this" ++ undefined)) == "this"
extra> +++ OK, passed 1 test.
extra> \xs -> nubOrd xs == nub xs
extra> +++ OK, passed 100 tests.
extra> nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
extra> +++ OK, passed 1 test.
extra> nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
extra> +++ OK, passed 1 test.
extra> zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
extra> +++ OK, passed 1 test.
extra> zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
extra> +++ OK, passed 1 test.
extra> zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
extra> +++ OK, passed 1 test.
extra> comparingLength [1,2,3] [False] == GT
extra> +++ OK, passed 1 test.
extra> comparingLength [1,2] "ab" == EQ
extra> +++ OK, passed 1 test.
extra> \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
extra> +++ OK, passed 100 tests.
extra> comparingLength [1,2] (1:2:3:undefined) == LT
extra> +++ OK, passed 1 test.
extra> comparingLength (1:2:3:undefined) [1,2] == GT
extra> +++ OK, passed 1 test.
extra> mwhen True  "test" == "test"
extra> +++ OK, passed 1 test.
extra> mwhen False "test" == ""
extra> +++ OK, passed 1 test.
extra> first succ (1,"test") == (2,"test")
extra> +++ OK, passed 1 test.
extra> second reverse (1,"test") == (1,"tset")
extra> +++ OK, passed 1 test.
extra> firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
extra> +++ OK, passed 1 test.
extra> secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
extra> +++ OK, passed 1 test.
extra> (succ *** reverse) (1,"test") == (2,"tset")
extra> +++ OK, passed 1 test.
extra> (succ &&& pred) 1 == (2,0)
extra> +++ OK, passed 1 test.
extra> dupe 12 == (12, 12)
extra> +++ OK, passed 1 test.
extra> both succ (1,2) == (2,3)
extra> +++ OK, passed 1 test.
extra> first3 succ (1,1,1) == (2,1,1)
extra> +++ OK, passed 1 test.
extra> second3 succ (1,1,1) == (1,2,1)
extra> +++ OK, passed 1 test.
extra> third3 succ (1,1,1) == (1,1,2)
extra> +++ OK, passed 1 test.
extra> \x -> readVersion (showVersion x) == x
extra> +++ OK, passed 100 tests.
extra> readVersion "hello" == undefined
extra> +++ OK, passed 1 test.
extra> showDP 4 pi == "3.1416"
extra> +++ OK, passed 1 test.
extra> showDP 0 pi == "3"
extra> +++ OK, passed 1 test.
extra> showDP 2 3  == "3.00"
extra> +++ OK, passed 1 test.
extra> withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
extra> +++ OK, passed 1 test.
extra> withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
extra> +++ OK, passed 1 test.
extra> listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
extra> +++ OK, passed 1 test.
extra> listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
extra> +++ OK, passed 1 test.
extra> listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
extra> +++ OK, passed 1 test.
extra> listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
extra> +++ OK, passed 1 test.
extra> listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName)    ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
extra> +++ OK, passed 1 test.
extra> listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
extra> +++ OK, passed 1 test.
extra> isWindows == (os == "mingw32")
extra> +++ OK, passed 1 test.
extra> \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
extra> +++ OK, passed 100 tests.
extra> \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
extra> +++ OK, passed 100 tests.
extra> \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
extra> +++ OK, passed 100 tests.
extra> captureOutput (print 1) == pure ("1\n",())
extra> +++ OK, passed 1 test.
extra> withTempFile doesFileExist == pure True
extra> +++ OK, passed 1 test.
extra> (doesFileExist =<< withTempFile pure) == pure False
extra> +++ OK, passed 1 test.
extra> withTempFile readFile' == pure ""
extra> +++ OK, passed 1 test.
extra> withTempDir doesDirectoryExist == pure True
extra> +++ OK, passed 1 test.
extra> (doesDirectoryExist =<< withTempDir pure) == pure False
extra> +++ OK, passed 1 test.
extra> withTempDir listFiles == pure []
extra> +++ OK, passed 1 test.
extra> fileEq "does_not_exist1" "does_not_exist2" == undefined
extra> +++ OK, passed 1 test.
extra> fileEq "does_not_exist" "does_not_exist" == undefined
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
extra> +++ OK, passed 1 test.
extra> fmap (round . fst) (duration $ sleep 1) == pure 1
extra> +++ OK, passed 1 test.
extra> timeout (-3) (print 1) == pure Nothing
extra> +++ OK, passed 1 test.
extra> timeout 0.1  (print 1) == fmap Just (print 1)
extra> +++ OK, passed 1 test.
extra> do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
extra> 0.10023395
extra> +++ OK, passed 1 test.
extra> timeout 0.1  (sleep 2 >> print 1) == pure Nothing
extra> +++ OK, passed 1 test.
extra> showDuration 3.435   == "3.44s"
extra> +++ OK, passed 1 test.
extra> showDuration 623.8   == "10m24s"
extra> +++ OK, passed 1 test.
extra> showDuration 62003.8 == "17h13m"
extra> +++ OK, passed 1 test.
extra> showDuration 1e8     == "27777h47m"
extra> +++ OK, passed 1 test.
extra> do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
extra> +++ OK, passed 1 test.
extra> do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
extra> +++ OK, passed 1 test.
extra> Extra export
extra> +++ OK, passed 1 test.
extra> withTempFile
extra> ....done
extra> withTempDir
extra> ....done
extra> retry
extra> +++ OK, passed 1 test.
extra> barrier
extra> Success (325 tests)
extra> Test suite extra-test: PASS
extra> Test suite logged to: dist/test/extra-1.8-extra-test.log
extra> 1 of 1 test suites (1 of 1 test cases) passed.
extra> Running phase: haddockPhase
extra> Preprocessing library for extra-1.8...
extra> Running Haddock on library for extra-1.8...
extra> [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing ) [HIE file is missing]
extra> [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing ) [HIE file is missing]
extra> [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing ) [HIE file is missing]
extra> [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing ) [HIE file is missing]
extra> [ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, nothing ) [HIE file is missing]
extra> [ 6 of 22] Compiling Partial          ( src/Partial.hs, nothing ) [HIE file is missing]
extra> [ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, nothing ) [HIE file is missing]
extra> [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing ) [HIE file is missing]
extra> [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing ) [HIE file is missing]
extra> [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing ) [HIE file is missing]
extra> [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing ) [HIE file is missing]
extra> [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing ) [HIE file is missing]
extra> [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing ) [HIE file is missing]
extra> [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing ) [HIE file is missing]
extra> [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing ) [HIE file is missing]
extra> [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing ) [HIE file is missing]
extra> [17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, nothing ) [HIE file is missing]
extra> [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing ) [HIE file is missing]
extra> [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing ) [HIE file is missing]
extra> [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing ) [HIE file is missing]
extra> [21 of 22] Compiling Extra            ( src/Extra.hs, nothing ) [HIE file is missing]
extra> [22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, nothing ) [HIE file is missing]
extra> Haddock coverage:
extra>  100% (  6 /  6) in 'Data.IORef.Extra'
extra>  100% (  4 /  4) in 'Data.Monoid.Extra'
extra> Warning: 'Arrow' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 28 / 28) in 'Data.Tuple.Extra'
extra>  100% (  2 /  2) in 'Data.Typeable.Extra'
extra>  100% (  7 /  7) in 'Numeric.Extra'
extra> Warning: 'unzip' is ambiguous. It is defined
extra>     * in ‘GHC.Internal.Data.Functor’
extra>     * in ‘GHC.Internal.List’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Internal.List’
extra> Warning: '(:)' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra> Warning: 'firstJustM' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 85 / 85) in 'Data.List.Extra'
extra> Warning: 'Version' is ambiguous. It is defined
extra>     * in ‘GHC.Internal.Data.Version’
extra>     * in ‘GHC.Internal.Data.Version’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Internal.Data.Version’
extra>  100% (  3 /  3) in 'Data.Version.Extra'
extra>  100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
extra> Warning: 'fromJust' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 11 / 11) in 'Data.Either.Extra'
extra> Warning: 'AssertionFailed' is ambiguous. It is defined
extra>     * in ‘GHC.Internal.IO.Exception’
extra>     * in ‘GHC.Internal.IO.Exception’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
extra> Warning: 'SomeException' is ambiguous. It is defined
extra>     * in ‘GHC.Internal.Exception.Type’
extra>     * in ‘GHC.Internal.Exception.Type’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
extra> Warning: 'ErrorCall' is ambiguous. It is defined
extra>     * in ‘GHC.Internal.Exception’
extra>     * in ‘GHC.Internal.Exception’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Internal.Exception’
extra>  100% ( 21 / 21) in 'Control.Exception.Extra'
extra> Warning: 'find' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra> Warning: 'mconcatMap' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra> Warning: 'partition' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 40 / 40) in 'Control.Monad.Extra'
extra>   92% ( 13 / 14) in 'Data.Foldable.Extra'
extra>   Missing documentation for:
extra>     Module header
extra> Warning: 'Lock' is ambiguous. It is defined
extra>     * at src/Control/Concurrent/Extra.hs:106:16
extra>     * at src/Control/Concurrent/Extra.hs:106:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
extra> Warning: 'Var' is ambiguous. It is defined
extra>     * at src/Control/Concurrent/Extra.hs:146:17
extra>     * at src/Control/Concurrent/Extra.hs:146:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
extra> Warning: 'Barrier' is ambiguous. It is defined
extra>     * at src/Control/Concurrent/Extra.hs:210:21
extra>     * at src/Control/Concurrent/Extra.hs:210:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
extra>  100% ( 27 / 27) in 'Control.Concurrent.Extra'
extra>  100% (  8 /  8) in 'System.Directory.Extra'
extra>  100% (  2 /  2) in 'System.Environment.Extra'
extra>  100% ( 26 / 26) in 'System.IO.Extra'
extra>  100% (  4 /  4) in 'System.Info.Extra'
extra>  100% (  5 /  5) in 'System.Process.Extra'
extra>  100% (  8 /  8) in 'System.Time.Extra'
extra>  100% (270 /270) in 'Extra'
extra>  100% (  2 /  2) in 'Text.Read.Extra'
extra> Warning: Data.Tuple.Extra: could not find link destinations for:
extra>  - GHC.Internal.Generics.Rep1_Solo
extra>  - GHC.Internal.Generics.Rep_Solo
extra> Documentation created: dist/doc/html/extra, dist/doc/html/extra/extra.txt
extra> Preprocessing test suite 'extra-test' for extra-1.8...
extra> Running phase: installPhase
extra> Installing library in /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/extra-1.8-GxUfFMQp4R7HmYwoSoVuga
extra> Running phase: fixupPhase
extra> shrinking RPATHs of ELF executables and libraries in /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8
extra> shrinking /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSextra-1.8-GxUfFMQp4R7HmYwoSoVuga-ghc9.12.1.so
extra> checking for references to /build/ in /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8...
extra> patching script interpreter paths in /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8
extra> stripping (with command strip and flags -S -p) in  /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8/lib
extra> shrinking RPATHs of ELF executables and libraries in /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc
extra> checking for references to /build/ in /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc...
extra> patching script interpreter paths in /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc
extra (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8
extra (post)> Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
extra (post)> 
extra (post)> Pushing /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc (3.07 MiB)
extra (post)> Pushing /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8 (4.45 MiB)
extra (post)> 
extra (post)> All done.
extra (post)> added 2 signatures
extra (post)> added 3 signatures
extra (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8
extra (post)> copying 2 paths...
extra (post)> copying path '/nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc' to 'https://cache.nix-ci.com'...
extra (post)> copying path '/nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8' to 'https://cache.nix-ci.com'...
extra (post)> copying 1 paths...
extra (post)> copying path '/nix/store/zh4059nwk2z28s01gwd5dy81332j1s51-extra-1.8.drv' to 'https://cache.nix-ci.com'...
extra (post)> added 0 signatures
extra (post)> added 0 signatures
extra (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc /nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8
extra (post)> copying 2 paths...
extra (post)> copying path '/nix/store/n4lhwm48s4qxx75y2v488nanih4b0ljr-extra-1.8-doc' to 'ssh-ng://worker.nix-ci.com'...
extra (post)> copying path '/nix/store/q8hd2bgn1pn5s813s1v41wiakab5mnak-extra-1.8' to 'ssh-ng://worker.nix-ci.com'...
extra (post)> copying 1 paths...
extra (post)> copying path '/nix/store/zh4059nwk2z28s01gwd5dy81332j1s51-extra-1.8.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/13gwc5v8mp1ms298j24c5dsmm4q0nx1l-algebraic-graphs-0.7.drv'...
algebraic-graphs> Running phase: setupCompilerEnvironmentPhase
algebraic-graphs> Build with /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1.
algebraic-graphs> Running phase: unpackPhase
algebraic-graphs> unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
algebraic-graphs> source root is algebraic-graphs-0.7
algebraic-graphs> setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
algebraic-graphs> Running phase: patchPhase
algebraic-graphs> Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
algebraic-graphs> Running phase: compileBuildDriverPhase
algebraic-graphs> setupCompileFlags: -package-db=/build/tmp.Fl32Vo5yjJ/setup-package.conf.d -threaded
algebraic-graphs> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.Fl32Vo5yjJ/Main.o )
algebraic-graphs> [2 of 2] Linking Setup
algebraic-graphs> Running phase: updateAutotoolsGnuConfigScriptsPhase
algebraic-graphs> Running phase: configurePhase
algebraic-graphs> configureFlags: --verbose --prefix=/nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.Fl32Vo5yjJ/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/lib
algebraic-graphs> Using Parsec parser
algebraic-graphs> Configuring algebraic-graphs-0.7...
algebraic-graphs> Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
algebraic-graphs> 'ghc' version < 9.12):
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc is version
algebraic-graphs> 9.12.1
algebraic-graphs> Dependency array >=0.4 && <0.6: using array-0.5.8.0
algebraic-graphs> Dependency base >=4.11 && <5: using base-4.21.0.0
algebraic-graphs> Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
algebraic-graphs> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
algebraic-graphs> Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
algebraic-graphs> Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
algebraic-graphs> Dependency algebraic-graphs: using algebraic-graphs-0.7
algebraic-graphs> Dependency array >=0.4 && <0.6: using array-0.5.8.0
algebraic-graphs> Dependency base >=4.11 && <5: using base-4.21.0.0
algebraic-graphs> Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
algebraic-graphs> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
algebraic-graphs> Dependency extra >=1.4 && <2: using extra-1.8
algebraic-graphs> Dependency inspection-testing >=0.4.2.2 && <0.6: using
algebraic-graphs> inspection-testing-0.5.0.3
algebraic-graphs> Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
algebraic-graphs> Source component graph:
algebraic-graphs>     component lib
algebraic-graphs>     component test:main dependency lib
algebraic-graphs> Configured component graph:
algebraic-graphs>     component algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs>         include array-0.5.8.0-038b
algebraic-graphs>         include base-4.21.0.0-f068
algebraic-graphs>         include containers-0.7-647d
algebraic-graphs>         include deepseq-1.5.1.0-b096
algebraic-graphs>         include transformers-0.6.1.2-199f
algebraic-graphs>     component algebraic-graphs-0.7-DUC0aIJJUCuCUbRi0dGT91-main
algebraic-graphs>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
algebraic-graphs>         include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs>         include array-0.5.8.0-038b
algebraic-graphs>         include base-4.21.0.0-f068
algebraic-graphs>         include containers-0.7-647d
algebraic-graphs>         include deepseq-1.5.1.0-b096
algebraic-graphs>         include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
algebraic-graphs>         include inspection-testing-0.5.0.3-6LnOBkVqnE2Cwk8gCmr2Oy
algebraic-graphs>         include transformers-0.6.1.2-199f
algebraic-graphs> Linked component graph:
algebraic-graphs>     unit algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs>         include array-0.5.8.0-038b
algebraic-graphs>         include base-4.21.0.0-f068
algebraic-graphs>         include containers-0.7-647d
algebraic-graphs>         include deepseq-1.5.1.0-b096
algebraic-graphs>         include transformers-0.6.1.2-199f
algebraic-graphs>         Algebra.Graph=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Data.Graph.Typed
algebraic-graphs>     unit algebraic-graphs-0.7-DUC0aIJJUCuCUbRi0dGT91-main
algebraic-graphs>         include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
algebraic-graphs>         include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs>         include array-0.5.8.0-038b
algebraic-graphs>         include base-4.21.0.0-f068
algebraic-graphs>         include containers-0.7-647d
algebraic-graphs>         include deepseq-1.5.1.0-b096
algebraic-graphs>         include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
algebraic-graphs>         include inspection-testing-0.5.0.3-6LnOBkVqnE2Cwk8gCmr2Oy
algebraic-graphs>         include transformers-0.6.1.2-199f
algebraic-graphs> Ready component graph:
algebraic-graphs>     definite algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs>         depends array-0.5.8.0-038b
algebraic-graphs>         depends base-4.21.0.0-f068
algebraic-graphs>         depends containers-0.7-647d
algebraic-graphs>         depends deepseq-1.5.1.0-b096
algebraic-graphs>         depends transformers-0.6.1.2-199f
algebraic-graphs>     definite algebraic-graphs-0.7-DUC0aIJJUCuCUbRi0dGT91-main
algebraic-graphs>         depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
algebraic-graphs>         depends algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs>         depends array-0.5.8.0-038b
algebraic-graphs>         depends base-4.21.0.0-f068
algebraic-graphs>         depends containers-0.7-647d
algebraic-graphs>         depends deepseq-1.5.1.0-b096
algebraic-graphs>         depends extra-1.8-GxUfFMQp4R7HmYwoSoVuga
algebraic-graphs>         depends inspection-testing-0.5.0.3-6LnOBkVqnE2Cwk8gCmr2Oy
algebraic-graphs>         depends transformers-0.6.1.2-199f
algebraic-graphs> Using Cabal-3.14.1.0 compiled by ghc-9.12
algebraic-graphs> Using compiler: ghc-9.12.1
algebraic-graphs> Using install prefix:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7
algebraic-graphs> Executables installed in:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/bin
algebraic-graphs> Libraries installed in:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs> Dynamic Libraries installed in:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
algebraic-graphs> Private executables installed in:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7
algebraic-graphs> Data files installed in:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7
algebraic-graphs> Documentation installed in:
algebraic-graphs> /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
algebraic-graphs> Configuration files installed in:
algebraic-graphs> /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/etc
algebraic-graphs> No alex found
algebraic-graphs> Using ar found on system at:
algebraic-graphs> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
algebraic-graphs> No c2hs found
algebraic-graphs> No cpphs found
algebraic-graphs> No doctest found
algebraic-graphs> Using gcc version 14.3.0 given by user at:
algebraic-graphs> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
algebraic-graphs> Using ghc version 9.12.1 found on system at:
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc
algebraic-graphs> Using ghc-pkg version 9.12.1 found on system at:
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/ghc-pkg-9.12.1
algebraic-graphs> No ghcjs found
algebraic-graphs> No ghcjs-pkg found
algebraic-graphs> No greencard found
algebraic-graphs> Using haddock version 2.30.0 found on system at:
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/haddock-ghc-9.12.1
algebraic-graphs> No happy found
algebraic-graphs> No haskell-suite found
algebraic-graphs> No haskell-suite-pkg found
algebraic-graphs> No hmake found
algebraic-graphs> Using hpc version 0.69 found on system at:
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hpc-ghc-9.12.1
algebraic-graphs> Using hsc2hs version 0.68.10 found on system at:
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
algebraic-graphs> Using hscolour version 1.25 found on system at:
algebraic-graphs> /nix/store/wrs1dkr0pfxm92c5zxrfyy62ifw61ybm-hscolour-1.25/bin/HsColour
algebraic-graphs> No jhc found
algebraic-graphs> Using ld found on system at:
algebraic-graphs> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
algebraic-graphs> No pkg-config found
algebraic-graphs> Using runghc version 9.12.1 found on system at:
algebraic-graphs> /nix/store/qdyj33aqxlbdbpdzgybsizan6ccgvcc7-ghc-9.12.1/bin/runghc-9.12.1
algebraic-graphs> Using strip version 2.44 found on system at:
algebraic-graphs> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
algebraic-graphs> Using tar found on system at:
algebraic-graphs> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
algebraic-graphs> No uhc found
algebraic-graphs> Running phase: buildPhase
algebraic-graphs> Preprocessing library for algebraic-graphs-0.7...
algebraic-graphs> Building library for algebraic-graphs-0.7...
algebraic-graphs> [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
algebraic-graphs> [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
algebraic-graphs> [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
algebraic-graphs> [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
algebraic-graphs> [ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
algebraic-graphs> [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
algebraic-graphs> [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
algebraic-graphs> [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
algebraic-graphs> [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
algebraic-graphs> [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
algebraic-graphs> [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 384 |     exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
algebraic-graphs>     |                                           ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 391 |              pth' = tail v_pth' -- Here we know that v_pth' starts with v
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 395 |              p_v = fst $ head bnd
algebraic-graphs>     |                          ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 397 |              bnd' = tail bnd
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
algebraic-graphs> [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 171 |     vertexIntSet :: ToVertex t ~ Int => t -> IntSet
algebraic-graphs>     |                                ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 197 |     preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                             ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 215 |     postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 303 |     toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                     ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 312 |     toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                           ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                                    ^
algebraic-graphs> 
algebraic-graphs> [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
algebraic-graphs> [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
algebraic-graphs> [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
algebraic-graphs> [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
algebraic-graphs> [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
algebraic-graphs> [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
algebraic-graphs> [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
algebraic-graphs> [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
algebraic-graphs> src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
algebraic-graphs>     |                                         ^
algebraic-graphs> 
algebraic-graphs> [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
algebraic-graphs>     |                                                               ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
algebraic-graphs>     |                                                                              ^
algebraic-graphs> 
algebraic-graphs> [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
algebraic-graphs> [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
algebraic-graphs> [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
algebraic-graphs> [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
algebraic-graphs> [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
algebraic-graphs> [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
algebraic-graphs> [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
algebraic-graphs> [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
algebraic-graphs> [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
algebraic-graphs> [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
algebraic-graphs> [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
algebraic-graphs> [ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
algebraic-graphs> [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
algebraic-graphs> [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
algebraic-graphs> [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
algebraic-graphs> [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
algebraic-graphs> [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
algebraic-graphs> [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 384 |     exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
algebraic-graphs>     |                                           ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 391 |              pth' = tail v_pth' -- Here we know that v_pth' starts with v
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 395 |              p_v = fst $ head bnd
algebraic-graphs>     |                          ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 397 |              bnd' = tail bnd
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
algebraic-graphs> [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 171 |     vertexIntSet :: ToVertex t ~ Int => t -> IntSet
algebraic-graphs>     |                                ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 197 |     preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                             ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 215 |     postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 303 |     toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                     ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 312 |     toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                           ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                                    ^
algebraic-graphs> 
algebraic-graphs> [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
algebraic-graphs> [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
algebraic-graphs> [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
algebraic-graphs> [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
algebraic-graphs> [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
algebraic-graphs> [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
algebraic-graphs> [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
algebraic-graphs> [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
algebraic-graphs> src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
algebraic-graphs>     |                                         ^
algebraic-graphs> 
algebraic-graphs> [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
algebraic-graphs>     |                                                               ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
algebraic-graphs>     |                                                                              ^
algebraic-graphs> 
algebraic-graphs> [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
algebraic-graphs> [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
algebraic-graphs> [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
algebraic-graphs> [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
algebraic-graphs> [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
algebraic-graphs> [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
algebraic-graphs> [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
algebraic-graphs> Preprocessing test suite 'main' for algebraic-graphs-0.7...
algebraic-graphs> Building test suite 'main' for algebraic-graphs-0.7...
algebraic-graphs> [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
algebraic-graphs> [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
algebraic-graphs> [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
algebraic-graphs> [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
algebraic-graphs> [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
algebraic-graphs> test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:71: warning: [GHC-00834] [-Wview-pattern-signatures]
algebraic-graphs>     • Found an unparenthesized pattern signature on the RHS of a view pattern.
algebraic-graphs>     • This code might stop working in a future GHC release
algebraic-graphs>       due to a planned change to the precedence of view patterns,
algebraic-graphs>       unless the view function is an endofunction.
algebraic-graphs>     • Current parse: ‘apply -> (f1 :: Int -> Int)’
algebraic-graphs>       Future parse: ‘(apply -> f1) :: Int -> Int’
algebraic-graphs>     Suggested fix: Parenthesize the RHS of the view pattern
algebraic-graphs>     |
algebraic-graphs> 725 |     test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
algebraic-graphs>     |                                                                       ^^^^^^^^^^^^^^^^^^^^^^^^^
algebraic-graphs> 
algebraic-graphs> test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:99: warning: [GHC-00834] [-Wview-pattern-signatures]
algebraic-graphs>     • Found an unparenthesized pattern signature on the RHS of a view pattern.
algebraic-graphs>     • This code might stop working in a future GHC release
algebraic-graphs>       due to a planned change to the precedence of view patterns,
algebraic-graphs>       unless the view function is an endofunction.
algebraic-graphs>     • Current parse: ‘apply -> (g1 :: Int -> Int)’
algebraic-graphs>       Future parse: ‘(apply -> g1) :: Int -> Int’
algebraic-graphs>     Suggested fix: Parenthesize the RHS of the view pattern
algebraic-graphs>     |
algebraic-graphs> 725 |     test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
algebraic-graphs>     |                                                                                                   ^^^^^^^^^^^^^^^^^^^^^^^^^
algebraic-graphs> 
algebraic-graphs> test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:127: warning: [GHC-00834] [-Wview-pattern-signatures]
algebraic-graphs>     • Found an unparenthesized pattern signature on the RHS of a view pattern.
algebraic-graphs>     • This code might stop working in a future GHC release
algebraic-graphs>       due to a planned change to the precedence of view patterns,
algebraic-graphs>       unless the view function is an endofunction.
algebraic-graphs>     • Current parse: ‘apply -> (f2 :: Int -> Int)’
algebraic-graphs>       Future parse: ‘(apply -> f2) :: Int -> Int’
algebraic-graphs>     Suggested fix: Parenthesize the RHS of the view pattern
algebraic-graphs>     |
algebraic-graphs> 725 |     test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
algebraic-graphs>     |                                                                                                                               ^^^^^^^^^^^^^^^^^^^^^^^^^
algebraic-graphs> 
algebraic-graphs> test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:155: warning: [GHC-00834] [-Wview-pattern-signatures]
algebraic-graphs>     • Found an unparenthesized pattern signature on the RHS of a view pattern.
algebraic-graphs>     • This code might stop working in a future GHC release
algebraic-graphs>       due to a planned change to the precedence of view patterns,
algebraic-graphs>       unless the view function is an endofunction.
algebraic-graphs>     • Current parse: ‘apply -> (g2 :: Int -> Int)’
algebraic-graphs>       Future parse: ‘(apply -> g2) :: Int -> Int’
algebraic-graphs>     Suggested fix: Parenthesize the RHS of the view pattern
algebraic-graphs>     |
algebraic-graphs> 725 |     test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
algebraic-graphs>     |                                                                                                                                                           ^^^^^^^^^^^^^^^^^^^^^^^^^
algebraic-graphs> 
algebraic-graphs> [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
algebraic-graphs> [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
algebraic-graphs> [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
algebraic-graphs> test/Algebra/Graph/Test/Generic.hs:1501:50: warning: [GHC-00834] [-Wview-pattern-signatures]
algebraic-graphs>     • Found an unparenthesized pattern signature on the RHS of a view pattern.
algebraic-graphs>     • This code might stop working in a future GHC release
algebraic-graphs>       due to a planned change to the precedence of view patterns,
algebraic-graphs>       unless the view function is an endofunction.
algebraic-graphs>     • Current parse: ‘apply -> (f :: Int -> Int)’
algebraic-graphs>       Future parse: ‘(apply -> f) :: Int -> Int’
algebraic-graphs>     Suggested fix: Parenthesize the RHS of the view pattern
algebraic-graphs>      |
algebraic-graphs> 1501 |     test "gmap f . gmap g   == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
algebraic-graphs>      |                                                  ^^^^^^^^^^^^^^^^^^^^^^^^
algebraic-graphs> 
algebraic-graphs> test/Algebra/Graph/Test/Generic.hs:1501:77: warning: [GHC-00834] [-Wview-pattern-signatures]
algebraic-graphs>     • Found an unparenthesized pattern signature on the RHS of a view pattern.
algebraic-graphs>     • This code might stop working in a future GHC release
algebraic-graphs>       due to a planned change to the precedence of view patterns,
algebraic-graphs>       unless the view function is an endofunction.
algebraic-graphs>     • Current parse: ‘apply -> (g :: Int -> Int)’
algebraic-graphs>       Future parse: ‘(apply -> g) :: Int -> Int’
algebraic-graphs>     Suggested fix: Parenthesize the RHS of the view pattern
algebraic-graphs>      |
algebraic-graphs> 1501 |     test "gmap f . gmap g   == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
algebraic-graphs>      |                                                                             ^^^^^^^^^^^^^^^^^^^^^^^^
algebraic-graphs> 
algebraic-graphs> [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
algebraic-graphs> [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
algebraic-graphs> [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
algebraic-graphs> [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
algebraic-graphs> [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
algebraic-graphs> [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
algebraic-graphs> [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
algebraic-graphs> [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
algebraic-graphs> [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
algebraic-graphs> [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
algebraic-graphs> [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
algebraic-graphs> [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> inspection testing successful
algebraic-graphs>       expected successes: 58
algebraic-graphs> [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
algebraic-graphs> [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
algebraic-graphs> [23 of 23] Compiling Main             ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
algebraic-graphs> [24 of 24] Linking dist/build/main/main
algebraic-graphs> Running phase: checkPhase
algebraic-graphs> Running 1 test suites...
algebraic-graphs> Test suite main: RUNNING...
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.Show ============
algebraic-graphs> OK: show empty                == "empty"
algebraic-graphs> OK: show (shrink 1)           == "vertex 1"
algebraic-graphs> OK: show (shrink $ 1 + 2)     == "vertices [1,2]"
algebraic-graphs> OK: show (shrink $ 1 * 2)     == "(fromJust . toAcyclic) (edge 1 2)"
algebraic-graphs> OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
algebraic-graphs> OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.fromAcyclic ============
algebraic-graphs> OK: fromAcyclic empty                == empty
algebraic-graphs> OK: fromAcyclic . vertex             == vertex
algebraic-graphs> OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
algebraic-graphs> OK: vertexCount . fromAcyclic        == vertexCount
algebraic-graphs> OK: edgeCount   . fromAcyclic        == edgeCount
algebraic-graphs> OK: isAcyclic   . fromAcyclic        == const True
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.union ============
algebraic-graphs> OK: vertexSet (union x y) == <correct result>
algebraic-graphs> OK: edgeSet   (union x y) == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.join ============
algebraic-graphs> OK: vertexSet (join x y) == <correct result>
algebraic-graphs> OK: edgeSet   (join x y) == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty        x          ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)   empty      ==  False
algebraic-graphs> OK: isSubgraphOf (induce p x) x          ==  True
algebraic-graphs> OK: isSubgraphOf x (transitiveClosure x) ==  True
algebraic-graphs> OK: isSubgraphOf x y                     ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                             == True
algebraic-graphs> OK: isEmpty (vertex x)                        == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x)       == True
algebraic-graphs> OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge 1 2 (shrink $ 1 * 2) == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty            == 0
algebraic-graphs> OK: edgeCount (vertex x)       == 0
algebraic-graphs> OK: edgeCount (shrink $ 1 * 2) == 1
algebraic-graphs> OK: edgeCount                  == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty            == []
algebraic-graphs> OK: edgeList (vertex x)       == []
algebraic-graphs> OK: edgeList (shrink $ 2 * 1) == [(2,1)]
algebraic-graphs> OK: edgeList . transpose      == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty            == []
algebraic-graphs> OK: adjacencyList (vertex x)       == [(x, [])]
algebraic-graphs> OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty            == Set.empty
algebraic-graphs> OK: edgeSet (vertex x)       == Set.empty
algebraic-graphs> OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x empty            == Set.empty
algebraic-graphs> OK: preSet x (vertex x)       == Set.empty
algebraic-graphs> OK: preSet 1 (shrink $ 1 * 2) == Set.empty
algebraic-graphs> OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
algebraic-graphs> OK: Set.member x . preSet x   == const False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x empty            == Set.empty
algebraic-graphs> OK: postSet x (vertex x)       == Set.empty
algebraic-graphs> OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
algebraic-graphs> OK: postSet 2 (shrink $ 1 * 2) == Set.empty
algebraic-graphs> OK: Set.member x . postSet x   == const False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge 1 2 (shrink $ 1 * 2)     == vertices [1,2]
algebraic-graphs> OK: removeEdge x y . removeEdge x y     == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x     == removeVertex x
algebraic-graphs> OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing) == empty
algebraic-graphs> OK: induceJust . vertex . Just  == vertex
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.box ============
algebraic-graphs> OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
algebraic-graphs> 
algebraic-graphs> OK: box x y               ~~ box y x
algebraic-graphs> OK: box x (vertex ())     ~~ x
algebraic-graphs> OK: box x empty           ~~ empty
algebraic-graphs> OK: box x (box y z)       ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y) == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y) == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty                    == empty
algebraic-graphs> OK: transitiveClosure (vertex x)               == vertex x
algebraic-graphs> OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
algebraic-graphs> OK: transitiveClosure . transitiveClosure      == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.topSort ============
algebraic-graphs> OK: topSort empty                          == []
algebraic-graphs> OK: topSort (vertex x)                     == [x]
algebraic-graphs> OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
algebraic-graphs> OK: topSort (join x y)                     == fmap Left (topSort x) ++ fmap Right (topSort y)
algebraic-graphs> OK: Right . topSort                        == AM.topSort . fromAcyclic
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.scc ============
algebraic-graphs> OK:            scc empty               == empty
algebraic-graphs> OK:            scc (vertex x)          == vertex (NonEmpty.vertex x)
algebraic-graphs> OK:            scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
algebraic-graphs> OK: edgeList $ scc (edge 1 2)          == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
algebraic-graphs> OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.toAcyclic ============
algebraic-graphs> OK: toAcyclic (path    [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
algebraic-graphs> OK: toAcyclic (clique  [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
algebraic-graphs> OK: toAcyclic (circuit [1,2,3]) == Nothing
algebraic-graphs> OK: toAcyclic . fromAcyclic     == Just
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
algebraic-graphs> OK: toAcyclicOrd empty       == empty
algebraic-graphs> OK: toAcyclicOrd . vertex    == vertex
algebraic-graphs> OK: toAcyclicOrd (1 + 2)     == shrink (1 + 2)
algebraic-graphs> OK: toAcyclicOrd (1 * 2)     == shrink (1 * 2)
algebraic-graphs> OK: toAcyclicOrd (2 * 1)     == shrink (1 + 2)
algebraic-graphs> OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
algebraic-graphs> OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.shrink ============
algebraic-graphs> OK: shrink . AM.vertex   == vertex
algebraic-graphs> OK: shrink . AM.vertices == vertices
algebraic-graphs> OK: shrink . fromAcyclic == id
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.consistent ============
algebraic-graphs> OK: Arbitrary
algebraic-graphs> OK: empty
algebraic-graphs> OK: vertex
algebraic-graphs> OK: vertices
algebraic-graphs> OK: union
algebraic-graphs> OK: join
algebraic-graphs> OK: transpose
algebraic-graphs> OK: box
algebraic-graphs> OK: transitiveClosure
algebraic-graphs> OK: scc
algebraic-graphs> OK: toAcyclic
algebraic-graphs> OK: toAcyclicOrd
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.fromAdjacencyMap ============
algebraic-graphs> OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.fromAdjacencyIntSets ============
algebraic-graphs> OK: fromAdjacencyIntSets []                                     == empty
algebraic-graphs> OK: fromAdjacencyIntSets [(x, IntSet.empty)]                    == vertex x
algebraic-graphs> OK: fromAdjacencyIntSets [(x, IntSet.singleton y)]              == edge x y
algebraic-graphs> OK: fromAdjacencyIntSets . map (fmap IntSet.fromList)           == stars
algebraic-graphs> OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.closure ============
algebraic-graphs> OK: closure empty           == empty
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.bfsForest ============
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0]        == empty
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
algebraic-graphs> OK: isSubgraphOf (forest $ bfsForest x vs) x == True
algebraic-graphs> OK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
algebraic-graphs> OK: bfsForest x []                           == []
algebraic-graphs> OK: bfsForest empty vs                       == []
algebraic-graphs> OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
algebraic-graphs> OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.bfs ============
algebraic-graphs> OK: bfs (edge 1 2) [0]                                   == []
algebraic-graphs> OK: bfs (edge 1 2) [1]                                   == [[1], [2]]
algebraic-graphs> OK: bfs (edge 1 2) [2]                                   == [[2]]
algebraic-graphs> OK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
algebraic-graphs> OK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
algebraic-graphs> OK: bfs (edge 1 1) [1]                                   == [[1]]
algebraic-graphs> OK: bfs empty vs                                         == []
algebraic-graphs> OK: bfs x []                                             == []
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
algebraic-graphs> OK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
algebraic-graphs> OK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
algebraic-graphs> OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
algebraic-graphs> OK: map concat . transpose . map levels . bfsForest x    == bfs x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfsForest ============
algebraic-graphs> OK: forest $ dfsForest empty              == empty
algebraic-graphs> OK: forest $ dfsForest (edge 1 1)         == vertex 1
algebraic-graphs> OK: forest $ dfsForest (edge 1 2)         == edge 1 2
algebraic-graphs> OK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForest x) x == True
algebraic-graphs> OK: isDfsForestOf (dfsForest x) x         == True
algebraic-graphs> OK: dfsForest . forest . dfsForest        == dfsForest
algebraic-graphs> OK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
algebraic-graphs> OK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
algebraic-graphs> OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfsForestFrom ============
algebraic-graphs> OK: forest $ dfsForestFrom empty      vs             == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
algebraic-graphs> OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
algebraic-graphs> OK: dfsForestFrom x (vertexList x)                   == dfsForest x
algebraic-graphs> OK: dfsForestFrom x []                               == []
algebraic-graphs> OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
algebraic-graphs> OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfs ============
algebraic-graphs> OK: dfs empty      vs    == []
algebraic-graphs> OK: dfs (edge 1 1) [1]   == [1]
algebraic-graphs> OK: dfs (edge 1 2) [0]   == []
algebraic-graphs> OK: dfs (edge 1 2) [1]   == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2]   == [2]
algebraic-graphs> OK: dfs (edge 1 2) [1,2] == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2,1] == [2,1]
algebraic-graphs> OK: dfs x          []    == []
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- dfs x vs ]       == True
algebraic-graphs> OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
algebraic-graphs> OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfs ============
algebraic-graphs> OK: reachable empty              x == []
algebraic-graphs> OK: reachable (vertex 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 2)         0 == []
algebraic-graphs> OK: reachable (edge 1 2)         1 == [1,2]
algebraic-graphs> OK: reachable (edge 1 2)         2 == [2]
algebraic-graphs> OK: reachable (path    [1..8]  ) 4 == [4..8]
algebraic-graphs> OK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
algebraic-graphs> OK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- reachable x y ] == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.topSort ============
algebraic-graphs> OK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
algebraic-graphs> OK: topSort (path [1..5])                      == Right [1..5]
algebraic-graphs> OK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
algebraic-graphs> OK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
algebraic-graphs> OK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
algebraic-graphs> OK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
algebraic-graphs> OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
algebraic-graphs> OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
algebraic-graphs> OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
algebraic-graphs> OK: topSort . vertices     == Right . nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.testIsAcyclic ============
algebraic-graphs> OK: isAcyclic (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isAcyclic (1 * 2 + 2 * 1) == False
algebraic-graphs> OK: isAcyclic . circuit       == null
algebraic-graphs> OK: isAcyclic                 == isRight . topSort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isDfsForestOf ============
algebraic-graphs> OK: isDfsForestOf []                              empty            == True
algebraic-graphs> OK: isDfsForestOf []                              (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
algebraic-graphs> OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isTopSortOf ============
algebraic-graphs> OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      empty           == True
algebraic-graphs> OK: isTopSortOf [x]     (vertex x)      == True
algebraic-graphs> OK: isTopSortOf [x]     (edge x x)      == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.fromAdjacencySets ============
algebraic-graphs> OK: fromAdjacencySets []                                  == empty
algebraic-graphs> OK: fromAdjacencySets [(x, Set.empty)]                    == vertex x
algebraic-graphs> OK: fromAdjacencySets [(x, Set.singleton y)]              == edge x y
algebraic-graphs> OK: fromAdjacencySets . map (fmap Set.fromList)           == stars
algebraic-graphs> OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.closure ============
algebraic-graphs> OK: closure empty           == empty
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.box ============
algebraic-graphs> OK: box x y               ~~ box y x
algebraic-graphs> OK: box x (overlay y z)   == overlay (box x y) (box x z)
algebraic-graphs> OK: box x (vertex ())     ~~ x
algebraic-graphs> OK: box x empty           ~~ empty
algebraic-graphs> OK: box x (box y z)       ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y) == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y) == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.bfsForest ============
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0]        == empty
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
algebraic-graphs> OK: isSubgraphOf (forest $ bfsForest x vs) x == True
algebraic-graphs> OK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
algebraic-graphs> OK: bfsForest x []                           == []
algebraic-graphs> OK: bfsForest empty vs                       == []
algebraic-graphs> OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
algebraic-graphs> OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.bfs ============
algebraic-graphs> OK: bfs (edge 1 2) [0]                                   == []
algebraic-graphs> OK: bfs (edge 1 2) [1]                                   == [[1], [2]]
algebraic-graphs> OK: bfs (edge 1 2) [2]                                   == [[2]]
algebraic-graphs> OK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
algebraic-graphs> OK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
algebraic-graphs> OK: bfs (edge 1 1) [1]                                   == [[1]]
algebraic-graphs> OK: bfs empty vs                                         == []
algebraic-graphs> OK: bfs x []                                             == []
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
algebraic-graphs> OK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
algebraic-graphs> OK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
algebraic-graphs> OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
algebraic-graphs> OK: map concat . transpose . map levels . bfsForest x    == bfs x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfsForest ============
algebraic-graphs> OK: forest $ dfsForest empty              == empty
algebraic-graphs> OK: forest $ dfsForest (edge 1 1)         == vertex 1
algebraic-graphs> OK: forest $ dfsForest (edge 1 2)         == edge 1 2
algebraic-graphs> OK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForest x) x == True
algebraic-graphs> OK: isDfsForestOf (dfsForest x) x         == True
algebraic-graphs> OK: dfsForest . forest . dfsForest        == dfsForest
algebraic-graphs> OK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
algebraic-graphs> OK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
algebraic-graphs> OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfsForestFrom ============
algebraic-graphs> OK: forest $ dfsForestFrom empty      vs             == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
algebraic-graphs> OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
algebraic-graphs> OK: dfsForestFrom x (vertexList x)                   == dfsForest x
algebraic-graphs> OK: dfsForestFrom x []                               == []
algebraic-graphs> OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
algebraic-graphs> OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfs ============
algebraic-graphs> OK: dfs empty      vs    == []
algebraic-graphs> OK: dfs (edge 1 1) [1]   == [1]
algebraic-graphs> OK: dfs (edge 1 2) [0]   == []
algebraic-graphs> OK: dfs (edge 1 2) [1]   == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2]   == [2]
algebraic-graphs> OK: dfs (edge 1 2) [1,2] == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2,1] == [2,1]
algebraic-graphs> OK: dfs x          []    == []
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- dfs x vs ]       == True
algebraic-graphs> OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
algebraic-graphs> OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfs ============
algebraic-graphs> OK: reachable empty              x == []
algebraic-graphs> OK: reachable (vertex 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 2)         0 == []
algebraic-graphs> OK: reachable (edge 1 2)         1 == [1,2]
algebraic-graphs> OK: reachable (edge 1 2)         2 == [2]
algebraic-graphs> OK: reachable (path    [1..8]  ) 4 == [4..8]
algebraic-graphs> OK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
algebraic-graphs> OK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- reachable x y ] == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.topSort ============
algebraic-graphs> OK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
algebraic-graphs> OK: topSort (path [1..5])                      == Right [1..5]
algebraic-graphs> OK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
algebraic-graphs> OK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
algebraic-graphs> OK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
algebraic-graphs> OK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
algebraic-graphs> OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
algebraic-graphs> OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
algebraic-graphs> OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
algebraic-graphs> OK: topSort . vertices     == Right . nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.testIsAcyclic ============
algebraic-graphs> OK: isAcyclic (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isAcyclic (1 * 2 + 2 * 1) == False
algebraic-graphs> OK: isAcyclic . circuit       == null
algebraic-graphs> OK: isAcyclic                 == isRight . topSort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isDfsForestOf ============
algebraic-graphs> OK: isDfsForestOf []                              empty            == True
algebraic-graphs> OK: isDfsForestOf []                              (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
algebraic-graphs> OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isTopSortOf ============
algebraic-graphs> OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      empty           == True
algebraic-graphs> OK: isTopSortOf [x]     (vertex x)      == True
algebraic-graphs> OK: isTopSortOf [x]     (edge x x)      == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.scc ============
algebraic-graphs> OK: scc empty               == empty
algebraic-graphs> OK: scc (vertex x)          == vertex (NonEmpty.vertex x)
algebraic-graphs> OK: scc (vertices xs)       == vertices (map NonEmpty.vertex xs)
algebraic-graphs> OK: scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
algebraic-graphs> OK: scc (edge 1 2)          == edge   (NonEmpty.vertex 1) (NonEmpty.vertex 2)
algebraic-graphs> OK: scc (circuit (1:xs))    == vertex (NonEmpty.circuit1 (1 :| xs))
algebraic-graphs> OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
algebraic-graphs> OK: isAcyclic . scc == const True
algebraic-graphs> OK: isAcyclic x     == (scc x == gmap NonEmpty.vertex x)
algebraic-graphs> OK: scc g == KL.scc g
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Num ============
algebraic-graphs> OK: 0                     == rightVertex 0
algebraic-graphs> OK: swap 1                == leftVertex 1
algebraic-graphs> OK: swap 1 + 2            == vertices [1] [2]
algebraic-graphs> OK: swap 1 * 2            == edge 1 2
algebraic-graphs> OK: swap 1 + 2 * swap 3   == overlay (leftVertex 1) (edge 3 2)
algebraic-graphs> OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Show ============
algebraic-graphs> OK: show empty                 == "empty"
algebraic-graphs> OK: show 1                     == "rightVertex 1"
algebraic-graphs> OK: show (swap 2)              == "leftVertex 2"
algebraic-graphs> OK: show 1 + 2                 == "vertices [] [1,2]"
algebraic-graphs> OK: show (swap (1 + 2))        == "vertices [1,2] []"
algebraic-graphs> OK: show (swap 1 * 2)          == "edge 1 2"
algebraic-graphs> OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
algebraic-graphs> OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Eq ============
algebraic-graphs> OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
algebraic-graphs> 
algebraic-graphs> OK:         x + y == y + x
algebraic-graphs> OK:   x + (y + z) == (x + y) + z
algebraic-graphs> OK:     x * empty == x
algebraic-graphs> OK:     empty * x == x
algebraic-graphs> OK:         x * y == y * x
algebraic-graphs> OK:   x * (y * z) == (x * y) * z
algebraic-graphs> OK:   x * (y + z) == x * y + x * z
algebraic-graphs> OK:   (x + y) * z == x * z + y * z
algebraic-graphs> OK:     x * y * z == x * y + x * z + y * z
algebraic-graphs> OK:     x + empty == x
algebraic-graphs> OK:     empty + x == x
algebraic-graphs> OK:         x + x == x
algebraic-graphs> OK: x * y + x + y == x * y
algebraic-graphs> OK:     x * x * x == x * x
algebraic-graphs> 
algebraic-graphs> OK:  leftVertex x * leftVertex y  ==  leftVertex x + leftVertex y
algebraic-graphs> OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
algebraic-graphs> OK: leftAdjacencyMap empty           == Map.empty
algebraic-graphs> OK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
algebraic-graphs> OK: leftAdjacencyMap (rightVertex x) == Map.empty
algebraic-graphs> OK: leftAdjacencyMap (edge x y)      == Map.singleton x (Set.singleton y)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
algebraic-graphs> OK: rightAdjacencyMap empty           == Map.empty
algebraic-graphs> OK: rightAdjacencyMap (leftVertex x)  == Map.empty
algebraic-graphs> OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
algebraic-graphs> OK: rightAdjacencyMap (edge x y)      == Map.singleton y (Set.singleton x)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty empty           == True
algebraic-graphs> OK: leftAdjacencyMap empty  == Map.empty
algebraic-graphs> OK: rightAdjacencyMap empty == Map.empty
algebraic-graphs> OK: hasVertex x empty       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertex ============
algebraic-graphs> OK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
algebraic-graphs> OK: rightAdjacencyMap (leftVertex x) == Map.empty
algebraic-graphs> OK: hasLeftVertex x (leftVertex y)   == (x == y)
algebraic-graphs> OK: hasRightVertex x (leftVertex y)  == False
algebraic-graphs> OK: hasEdge x y (leftVertex z)       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertex ============
algebraic-graphs> OK: leftAdjacencyMap (rightVertex x)  == Map.empty
algebraic-graphs> OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
algebraic-graphs> OK: hasLeftVertex x (rightVertex y)   == False
algebraic-graphs> OK: hasRightVertex x (rightVertex y)  == (x == y)
algebraic-graphs> OK: hasEdge x y (rightVertex z)       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertex ============
algebraic-graphs> OK: vertex . Left  == leftVertex
algebraic-graphs> OK: vertex . Right == rightVertex
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edge ============
algebraic-graphs> OK: edge x y                     == connect (leftVertex x) (rightVertex y)
algebraic-graphs> OK: leftAdjacencyMap (edge x y)  == Map.singleton x (Set.singleton y)
algebraic-graphs> OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge 1 2 (edge 2 1)       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.connect ============
algebraic-graphs> OK: connect (leftVertex x)     (leftVertex y)     == vertices [x,y] []
algebraic-graphs> OK: connect (leftVertex x)     (rightVertex y)    == edge x y
algebraic-graphs> OK: connect (rightVertex x)    (leftVertex y)     == edge y x
algebraic-graphs> OK: connect (rightVertex x)    (rightVertex y)    == vertices [] [x,y]
algebraic-graphs> OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
algebraic-graphs> OK: isEmpty     (connect x y)                     == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y)                     == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y)                     >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y)                     <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y)                     >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y)                     >= leftVertexCount x * rightVertexCount y
algebraic-graphs> OK: edgeCount   (connect x y)                     <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices [] []                    == empty
algebraic-graphs> OK: vertices [x] []                   == leftVertex x
algebraic-graphs> OK: vertices [] [x]                   == rightVertex x
algebraic-graphs> OK: vertices xs ys                    == overlays (map leftVertex xs ++ map rightVertex ys)
algebraic-graphs> OK: hasLeftVertex  x (vertices xs ys) == elem x xs
algebraic-graphs> OK: hasRightVertex y (vertices xs ys) == elem y ys
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edges ============
algebraic-graphs> OK: edges []            == empty
algebraic-graphs> OK: edges [(x,y)]       == edge x y
algebraic-graphs> OK: edges               == overlays . map (uncurry edge)
algebraic-graphs> OK: hasEdge x y . edges == elem (x,y)
algebraic-graphs> OK: edgeCount   . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.swap ============
algebraic-graphs> OK: swap empty            == empty
algebraic-graphs> OK: swap . leftVertex     == rightVertex
algebraic-graphs> OK: swap (vertices xs ys) == vertices ys xs
algebraic-graphs> OK: swap (edge x y)       == edge y x
algebraic-graphs> OK: swap . edges          == edges . map Data.Tuple.swap
algebraic-graphs> OK: swap . swap           == id
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.toBipartite ============
algebraic-graphs> OK: toBipartite empty                      == empty
algebraic-graphs> OK: toBipartite (vertex (Left x))          == leftVertex x
algebraic-graphs> OK: toBipartite (vertex (Right x))         == rightVertex x
algebraic-graphs> OK: toBipartite (edge (Left x) (Left y))   == vertices [x,y] []
algebraic-graphs> OK: toBipartite (edge (Left x) (Right y))  == edge x y
algebraic-graphs> OK: toBipartite (edge (Right x) (Left y))  == edge y x
algebraic-graphs> OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
algebraic-graphs> OK: toBipartite . clique                   == uncurry biclique . partitionEithers
algebraic-graphs> OK: toBipartite . fromBipartite            == id
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.toBipartiteWith ============
algebraic-graphs> OK: toBipartiteWith f empty == empty
algebraic-graphs> OK: toBipartiteWith Left x  == vertices (vertexList x) []
algebraic-graphs> OK: toBipartiteWith Right x == vertices [] (vertexList x)
algebraic-graphs> OK: toBipartiteWith f       == toBipartite . gmap f
algebraic-graphs> OK: toBipartiteWith id      == toBipartite
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.fromBipartite ============
algebraic-graphs> OK: fromBipartite empty          == empty
algebraic-graphs> OK: fromBipartite (leftVertex x) == vertex (Left x)
algebraic-graphs> OK: fromBipartite (edge x y)     == edges [(Left x, Right y), (Right y, Left x)]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
algebraic-graphs> OK: fromBipartiteWith Left Right             == fromBipartite
algebraic-graphs> OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
algebraic-graphs> OK: fromBipartiteWith id id . edges          == symmetricClosure . edges
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                 == True
algebraic-graphs> OK: isEmpty (overlay empty empty) == True
algebraic-graphs> OK: isEmpty (vertex x)            == False
algebraic-graphs> OK: isEmpty                       == (==) empty
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasLeftVertex ============
algebraic-graphs> OK: hasLeftVertex x empty           == False
algebraic-graphs> OK: hasLeftVertex x (leftVertex y)  == (x == y)
algebraic-graphs> OK: hasLeftVertex x (rightVertex y) == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasRightVertex ============
algebraic-graphs> OK: hasRightVertex x empty           == False
algebraic-graphs> OK: hasRightVertex x (leftVertex y)  == False
algebraic-graphs> OK: hasRightVertex x (rightVertex y) == (x == y)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex . Left  == hasLeftVertex
algebraic-graphs> OK: hasVertex . Right == hasRightVertex
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty      == False
algebraic-graphs> OK: hasEdge x y (vertex z) == False
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: hasEdge x y            == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertexCount ============
algebraic-graphs> OK: leftVertexCount empty           == 0
algebraic-graphs> OK: leftVertexCount (leftVertex x)  == 1
algebraic-graphs> OK: leftVertexCount (rightVertex x) == 0
algebraic-graphs> OK: leftVertexCount (edge x y)      == 1
algebraic-graphs> OK: leftVertexCount . edges         == length . nub . map fst
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertexCount ============
algebraic-graphs> OK: rightVertexCount empty           == 0
algebraic-graphs> OK: rightVertexCount (leftVertex x)  == 0
algebraic-graphs> OK: rightVertexCount (rightVertex x) == 1
algebraic-graphs> OK: rightVertexCount (edge x y)      == 1
algebraic-graphs> OK: rightVertexCount . edges         == length . nub . map snd
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty      == 0
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: vertexCount (edge x y) == 2
algebraic-graphs> OK: vertexCount x          == leftVertexCount x + rightVertexCount x
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount . edges    == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertexList ============
algebraic-graphs> OK: leftVertexList empty              == []
algebraic-graphs> OK: leftVertexList (leftVertex x)     == [x]
algebraic-graphs> OK: leftVertexList (rightVertex x)    == []
algebraic-graphs> OK: leftVertexList . flip vertices [] == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertexList ============
algebraic-graphs> OK: rightVertexList empty           == []
algebraic-graphs> OK: rightVertexList (leftVertex x)  == []
algebraic-graphs> OK: rightVertexList (rightVertex x) == [x]
algebraic-graphs> OK: rightVertexList . vertices []   == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty                             == []
algebraic-graphs> OK: vertexList (vertex x)                        == [x]
algebraic-graphs> OK: vertexList (edge x y)                        == [Left x, Right y]
algebraic-graphs> OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty      == []
algebraic-graphs> OK: edgeList (vertex x) == []
algebraic-graphs> OK: edgeList (edge x y) == [(x,y)]
algebraic-graphs> OK: edgeList . edges    == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertexSet ============
algebraic-graphs> OK: leftVertexSet empty              == Set.empty
algebraic-graphs> OK: leftVertexSet . leftVertex       == Set.singleton
algebraic-graphs> OK: leftVertexSet . rightVertex      == const Set.empty
algebraic-graphs> OK: leftVertexSet . flip vertices [] == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertexSet ============
algebraic-graphs> OK: rightVertexSet empty         == Set.empty
algebraic-graphs> OK: rightVertexSet . leftVertex  == const Set.empty
algebraic-graphs> OK: rightVertexSet . rightVertex == Set.singleton
algebraic-graphs> OK: rightVertexSet . vertices [] == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty                             == Set.empty
algebraic-graphs> OK: vertexSet . vertex                          == Set.singleton
algebraic-graphs> OK: vertexSet (edge x y)                        == Set.fromList [Left x, Right y]
algebraic-graphs> OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
algebraic-graphs> OK: leftAdjacencyList empty            == []
algebraic-graphs> OK: leftAdjacencyList (vertices [] xs) == []
algebraic-graphs> OK: leftAdjacencyList (vertices xs []) == []
algebraic-graphs> OK: leftAdjacencyList (edge x y)       == [(x, [y])]
algebraic-graphs> OK: leftAdjacencyList (star x ys)      == [(x, nub (sort ys))]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
algebraic-graphs> OK: rightAdjacencyList empty            == []
algebraic-graphs> OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
algebraic-graphs> OK: rightAdjacencyList (vertices xs []) == []
algebraic-graphs> OK: rightAdjacencyList (edge x y)       == [(y, [x])]
algebraic-graphs> OK: rightAdjacencyList (star x ys)      == [(y, [x])  | y <- nub (sort ys)]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.evenList ============
algebraic-graphs> OK: evenList []                 == Nil
algebraic-graphs> OK: evenList [(1,2), (3,4)]     == [1, 2, 3, 4] :: List Int Int
algebraic-graphs> OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.oddList ============
algebraic-graphs> OK: oddList 1 []                 == Cons 1 Nil
algebraic-graphs> OK: oddList 1 [(2,3), (4,5)]     == [1, 2, 3, 4, 5] :: List Int Int
algebraic-graphs> OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.path ============
algebraic-graphs> OK: path Nil                   == empty
algebraic-graphs> OK: path (Cons x Nil)          == leftVertex x
algebraic-graphs> OK: path (Cons x (Cons y Nil)) == edge x y
algebraic-graphs> OK: path [1, 2, 3, 4, 5]       == edges [(1,2), (3,2), (3,4), (5,4)]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.circuit ============
algebraic-graphs> OK: circuit []                    == empty
algebraic-graphs> OK: circuit [(x,y)]               == edge x y
algebraic-graphs> OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
algebraic-graphs> OK: circuit . reverse             == swap . circuit . map Data.Tuple.swap
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.biclique ============
algebraic-graphs> OK: biclique [] [] == empty
algebraic-graphs> OK: biclique xs [] == vertices xs []
algebraic-graphs> OK: biclique [] ys == vertices [] ys
algebraic-graphs> OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.star ============
algebraic-graphs> OK: star x []    == leftVertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (leftVertex x) (vertices [] ys)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == leftVertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: star x [y,z]                  == edges [(x,y), (x,z)]
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.mesh ============
algebraic-graphs> OK: mesh xs []           == empty
algebraic-graphs> OK: mesh [] ys           == empty
algebraic-graphs> OK: mesh [x] [y]         == leftVertex (x,y)
algebraic-graphs> OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
algebraic-graphs> OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.removeLeftVertex ============
algebraic-graphs> OK: removeLeftVertex x (leftVertex x)       == empty
algebraic-graphs> OK: removeLeftVertex 1 (leftVertex 2)       == leftVertex 2
algebraic-graphs> OK: removeLeftVertex x (rightVertex y)      == rightVertex y
algebraic-graphs> OK: removeLeftVertex x (edge x y)           == rightVertex y
algebraic-graphs> OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.removeRightVertex ============
algebraic-graphs> OK: removeRightVertex x (rightVertex x)       == empty
algebraic-graphs> OK: removeRightVertex 1 (rightVertex 2)       == rightVertex 2
algebraic-graphs> OK: removeRightVertex x (leftVertex y)        == leftVertex y
algebraic-graphs> OK: removeRightVertex y (edge x y)            == leftVertex x
algebraic-graphs> OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)            == vertices [x] [y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y      == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeLeftVertex x  == removeLeftVertex x
algebraic-graphs> OK: removeEdge x y . removeRightVertex y == removeRightVertex y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.bimap ============
algebraic-graphs> OK: bimap f g empty           == empty
algebraic-graphs> OK: bimap f g . vertex        == vertex . Data.Bifunctor.bimap f g
algebraic-graphs> OK: bimap f g (edge x y)      == edge (f x) (g y)
algebraic-graphs> OK: bimap id id               == id
algebraic-graphs> OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.box ============
algebraic-graphs> OK: box (path [0,1]) (path ['a','b']) == <correct result>
algebraic-graphs> 
algebraic-graphs> OK: box x y                ~~ box y x
algebraic-graphs> OK: box x (box y z)        ~~ box (box x y) z
algebraic-graphs> OK: box x (box y z)        ~~ box (box x y) z
algebraic-graphs> OK: box x (leftVertex ())  ~~ x
algebraic-graphs> OK: box x (rightVertex ()) ~~ swap x
algebraic-graphs> OK: box x empty            ~~ empty
algebraic-graphs> OK: vertexCount (box x y)  <= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount (box x y)    <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> OK: box == boxWith (,) (,) (,) (,)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.consistent ============
algebraic-graphs> OK: consistent empty            == True
algebraic-graphs> OK: consistent (vertex x)       == True
algebraic-graphs> OK: consistent (edge x y)       == True
algebraic-graphs> OK: consistent (edges x)        == True
algebraic-graphs> OK: consistent (toBipartite x)  == True
algebraic-graphs> OK: consistent (swap x)         == True
algebraic-graphs> OK: consistent (circuit xs)     == True
algebraic-graphs> OK: consistent (biclique xs ys) == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
algebraic-graphs> OK: detectParts empty                                       == Right empty
algebraic-graphs> OK: detectParts (vertex 1)                                  == Right (leftVertex 1)
algebraic-graphs> OK: detectParts (edge 1 1)                                  == Left [1]
algebraic-graphs> OK: detectParts (edge 1 2)                                  == Right (edge 1 2)
algebraic-graphs> OK: detectParts (edge 0 (-1))                               == Right (edge (-1) 0)
algebraic-graphs> OK: detectParts (1 * (2 + 3))                               == Right (edges [(1, 2), (1, 3)])
algebraic-graphs> OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5)                 == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
algebraic-graphs> OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6))               == Left [1, 3, 2, 4, 5]
algebraic-graphs> OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5)           == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
algebraic-graphs> OK: detectParts (1 * 2 * 3)                                 == Left [2, 3, 1]
algebraic-graphs> OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2))                 == Left [2]
algebraic-graphs> OK: detectParts (clique [1..10])                            == Left [1, 2, 3]
algebraic-graphs> OK: detectParts (circuit [1..11])                           == Left [1..11]
algebraic-graphs> OK: detectParts (circuit [1..10])                           == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
algebraic-graphs> OK: detectParts (biclique [] xs)                            == Right (vertices xs [])
algebraic-graphs> OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
algebraic-graphs> OK: isRight (detectParts (star x ys))                       == not (elem x ys)
algebraic-graphs> OK: isRight (detectParts (fromBipartite (toBipartite x)))   == True
algebraic-graphs> 
algebraic-graphs> OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
algebraic-graphs> OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
algebraic-graphs> OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
algebraic-graphs> OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
algebraic-graphs> OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
algebraic-graphs> 
algebraic-graphs> ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
algebraic-graphs> OK: show (matching [])                == "matching []"
algebraic-graphs> OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
algebraic-graphs> 
algebraic-graphs> ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
algebraic-graphs> OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
algebraic-graphs> OK: pairOfLeft (matching [])                 == Map.empty
algebraic-graphs> OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
algebraic-graphs> OK: Map.size . pairOfLeft                    == Map.size . pairOfRight
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
algebraic-graphs> OK: pairOfRight (matching [])                 == Map.empty
algebraic-graphs> OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
algebraic-graphs> OK: Map.size . pairOfRight                    == Map.size . pairOfLeft
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.matching ============
algebraic-graphs> OK: matching [(1,'a'), (1,'b')]                   == matching [(1,'b')]
algebraic-graphs> OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
algebraic-graphs> OK: isMatchingOf (matching []) x               == True
algebraic-graphs> OK: isMatchingOf (matching xs) empty           == null xs
algebraic-graphs> OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
algebraic-graphs> OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
algebraic-graphs> OK: matchingSize (matching [])                 == 0
algebraic-graphs> OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
algebraic-graphs> OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
algebraic-graphs> OK: matchingSize (matching xs)                 <= length xs
algebraic-graphs> OK: matchingSize x                             == Map.size . pairOfLeft
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
algebraic-graphs> OK: maxMatching empty                                          == matching []
algebraic-graphs> OK: maxMatching (vertices xs ys)                               == matching []
algebraic-graphs> OK: maxMatching (path [1,2,3,4])                               == matching [(1,2), (3,4)]
algebraic-graphs> OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
algebraic-graphs> OK: matchingSize (maxMatching (star x (y:ys)))                 == 1
algebraic-graphs> OK: matchingSize (maxMatching (biclique xs ys))                == min (length (nub xs)) (length (nub ys))
algebraic-graphs> OK: isMatchingOf (maxMatching x) x                             == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
algebraic-graphs> OK: isVertexCoverOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
algebraic-graphs> OK: isVertexCoverOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
algebraic-graphs> OK: isVertexCoverOf (Set.empty      , Set.empty      ) (edge x y)     == False
algebraic-graphs> OK: isVertexCoverOf (Set.singleton x, ys             ) (edge x y)     == Set.isSubsetOf ys (Set.singleton y)
algebraic-graphs> OK: isVertexCoverOf (xs             , Set.singleton y) (edge x y)     == Set.isSubsetOf xs (Set.singleton x)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
algebraic-graphs> OK: minVertexCover empty                              == (Set.empty, Set.empty)
algebraic-graphs> OK: minVertexCover (vertices xs ys)                   == (Set.empty, Set.empty)
algebraic-graphs> OK: minVertexCover (path [1,2,3])                     == (Set.empty, Set.singleton 2)
algebraic-graphs> OK: minVertexCover (star x (1:2:ys))                  == (Set.singleton x, Set.empty)
algebraic-graphs> OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
algebraic-graphs> OK: vertexCoverSize . minVertexCover                  == matchingSize . maxMatching
algebraic-graphs> OK: isVertexCoverOf (minVertexCover x) x              == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
algebraic-graphs> OK: isIndependentSetOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
algebraic-graphs> OK: isIndependentSetOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
algebraic-graphs> OK: isIndependentSetOf (Set.empty      , Set.empty      ) (edge x y)     == True
algebraic-graphs> OK: isIndependentSetOf (Set.singleton x, ys             ) (edge x y)     == Set.null ys
algebraic-graphs> OK: isIndependentSetOf (xs             , Set.singleton y) (edge x y)     == Set.null xs
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
algebraic-graphs> OK: maxIndependentSet empty                                 == (Set.empty, Set.empty)
algebraic-graphs> OK: maxIndependentSet (vertices xs ys)                      == (Set.fromList xs, Set.fromList ys)
algebraic-graphs> OK: maxIndependentSet (path [1,2,3])                        == (Set.fromList [1,3], Set.empty)
algebraic-graphs> OK: maxIndependentSet (star x (1:2:ys))                     == (Set.empty, Set.fromList (1:2:ys))
algebraic-graphs> OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
algebraic-graphs> OK: independentSetSize (maxIndependentSet x)                == vertexCount x - vertexCoverSize (minVertexCover x)
algebraic-graphs> OK: isIndependentSetOf (maxIndependentSet x) x              == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
algebraic-graphs> OK: augmentingPath (matching [])      empty            == Left (Set.empty, Set.empty)
algebraic-graphs> OK: augmentingPath (matching [])      (edge 1 2)       == Right [1,2]
algebraic-graphs> OK: augmentingPath (matching [(1,2)]) (path [1,2,3])   == Left (Set.empty, Set.singleton 2)
algebraic-graphs> OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
algebraic-graphs> OK: isLeft (augmentingPath (maxMatching x) x)          == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
algebraic-graphs> OK: consistentMatching (matching xs)   == True
algebraic-graphs> OK: consistentMatching (maxMatching x) == True
algebraic-graphs> 
algebraic-graphs> ============ Export.Eq ============
algebraic-graphs> OK: mempty /= literal ""
algebraic-graphs> 
algebraic-graphs> ============ Export.Ord ============
algebraic-graphs> OK: mempty <  literal ""
algebraic-graphs> 
algebraic-graphs> ============ Export.isEmpty ============
algebraic-graphs> OK: isEmpty mempty       == True
algebraic-graphs> OK: isEmpty (literal "") == False
algebraic-graphs> OK: isEmpty x            == (x == mempty)
algebraic-graphs> 
algebraic-graphs> ============ Export.literal ============
algebraic-graphs> OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
algebraic-graphs> OK: literal "I am just a string literal"  == "I am just a string literal"
algebraic-graphs> OK: render . literal                      == id
algebraic-graphs> 
algebraic-graphs> ============ Export.render ============
algebraic-graphs> OK: render (literal "al" <> literal "ga") == "alga"
algebraic-graphs> OK: render mempty                         == mempty
algebraic-graphs> 
algebraic-graphs> ============ Export.<+> ============
algebraic-graphs> OK: x <+> mempty         == x
algebraic-graphs> OK: mempty <+> x         == x
algebraic-graphs> OK: x <+> (y <+> z)      == (x <+> y) <+> z
algebraic-graphs> OK: "name" <+> "surname" == "name surname"
algebraic-graphs> 
algebraic-graphs> ============ Export.brackets ============
algebraic-graphs> OK: brackets "i"    == "[i]"
algebraic-graphs> OK: brackets mempty == "[]"
algebraic-graphs> 
algebraic-graphs> ============ Export.doubleQuotes ============
algebraic-graphs> OK: doubleQuotes "/path/with spaces"   == "\"/path/with spaces\""
algebraic-graphs> OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
algebraic-graphs> 
algebraic-graphs> ============ Export.indent ============
algebraic-graphs> OK: indent 0        == id
algebraic-graphs> OK: indent 1 mempty == " "
algebraic-graphs> 
algebraic-graphs> ============ Export.unlines ============
algebraic-graphs> OK: unlines []                    == mempty
algebraic-graphs> OK: unlines [mempty]              == "\n"
algebraic-graphs> OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
algebraic-graphs> 
algebraic-graphs> ============ Export.export ============
algebraic-graphs> OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
algebraic-graphs> 
algebraic-graphs> ============ Export.Dot.export ============
algebraic-graphs> OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
algebraic-graphs> 
algebraic-graphs> =========== Export.Dot.attributeQuoting ============
algebraic-graphs> OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
algebraic-graphs> 
algebraic-graphs> ============ Export.Dot.exportAsIs ============
algebraic-graphs> OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
algebraic-graphs> 
algebraic-graphs> ============ Export.Dot.exportViaShow ============
algebraic-graphs> OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
algebraic-graphs> 
algebraic-graphs> ============ Graph ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> OK: Theorems of graphs
algebraic-graphs> 
algebraic-graphs> ============ Graph.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Graph.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Graph.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Graph.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Graph.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ Graph.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Graph.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Graph.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Graph.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Graph.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ Graph.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Graph.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Graph.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Graph.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ Graph.size ============
algebraic-graphs> OK: size empty         == 1
algebraic-graphs> OK: size (vertex x)    == 1
algebraic-graphs> OK: size (overlay x y) == size x + size y
algebraic-graphs> OK: size (connect x y) == size x + size y
algebraic-graphs> OK: size x             >= 1
algebraic-graphs> OK: size x             >= vertexCount x
algebraic-graphs> 
algebraic-graphs> ============ Graph.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Graph.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ Graph.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Graph.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Graph.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Graph.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: size (removeEdge x y z)         <= 3 * size z
algebraic-graphs> 
algebraic-graphs> ============ Graph.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Graph.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Graph.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Graph.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Graph.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Graph.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> OK: size (compose x y)                        <= edgeCount x + edgeCount y + 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.(===) ============
algebraic-graphs> OK:     x === x         == True
algebraic-graphs> OK:     x === x + empty == False
algebraic-graphs> OK: x + y === x + y     == True
algebraic-graphs> OK: 1 + 2 === 2 + 1     == False
algebraic-graphs> OK: x + y === x * y     == False
algebraic-graphs> 
algebraic-graphs> ============ Graph.mesh ============
algebraic-graphs> OK: mesh xs     []    == empty
algebraic-graphs> OK: mesh []     ys    == empty
algebraic-graphs> OK: mesh [x]    [y]   == vertex (x, y)
algebraic-graphs> OK: mesh xs     ys    == box (path xs) (path ys)
algebraic-graphs> OK: mesh [1..3] "ab"  == <correct result>
algebraic-graphs> OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
algebraic-graphs> 
algebraic-graphs> ============ Graph.torus ============
algebraic-graphs> OK: torus xs     []    == empty
algebraic-graphs> OK: torus []     ys    == empty
algebraic-graphs> OK: torus [x]    [y]   == edge (x,y) (x,y)
algebraic-graphs> OK: torus xs     ys    == box (circuit xs) (circuit ys)
algebraic-graphs> OK: torus [1,2]  "ab"  == <correct result>
algebraic-graphs> OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.deBruijn ============
algebraic-graphs> OK:           deBruijn 0 xs               == edge [] []
algebraic-graphs> OK: n > 0 ==> deBruijn n []               == empty
algebraic-graphs> OK:           deBruijn 1 [0,1]            == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
algebraic-graphs> OK:           deBruijn 2 "0"              == edge "00" "00"
algebraic-graphs> OK:           deBruijn 2 "01"             == <correct result>
algebraic-graphs> OK:           transpose   (deBruijn n xs) == gmap reverse $ deBruijn n xs
algebraic-graphs> OK:           vertexCount (deBruijn n xs) == (length $ nub xs)^n
algebraic-graphs> OK: n > 0 ==> edgeCount   (deBruijn n xs) == (length $ nub xs)^(n + 1)
algebraic-graphs> 
algebraic-graphs> ============ Graph.splitVertex ============
algebraic-graphs> OK: splitVertex x []                   == removeVertex x
algebraic-graphs> OK: splitVertex x [x]                  == id
algebraic-graphs> OK: splitVertex x [y]                  == replaceVertex x y
algebraic-graphs> OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
algebraic-graphs> 
algebraic-graphs> ============ Graph.bind ============
algebraic-graphs> OK: bind empty f         == empty
algebraic-graphs> OK: bind (vertex x) f    == f x
algebraic-graphs> OK: bind (edge x y) f    == connect (f x) (f y)
algebraic-graphs> OK: bind (vertices xs) f == overlays (map f xs)
algebraic-graphs> OK: bind x (const empty) == empty
algebraic-graphs> OK: bind x vertex        == x
algebraic-graphs> OK: bind (bind x f) g    == bind x (\y -> bind (f y) g)
algebraic-graphs> 
algebraic-graphs> ============ Graph.simplify ============
algebraic-graphs> OK: simplify              == id
algebraic-graphs> OK: size (simplify x)     <= size x
algebraic-graphs> 
algebraic-graphs> ============ Graph.box ============
algebraic-graphs> OK: box x y               ~~ box y x
algebraic-graphs> OK: box x (overlay y z)   == overlay (box x y) (box x z)
algebraic-graphs> OK: box x (vertex ())     ~~ x
algebraic-graphs> OK: box x empty           ~~ empty
algebraic-graphs> OK: box x (box y z)       ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y) == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y) == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ Graph.sparsify ============
algebraic-graphs> OK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
algebraic-graphs> OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
algebraic-graphs> OK: edgeCount   (sparsify x) <= 3 * size x
algebraic-graphs> OK: size        (sparsify x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ Graph.sparsifyKL ============
algebraic-graphs> OK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
algebraic-graphs> OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
algebraic-graphs> OK: length (edges    $ sparsifyKL n x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ Graph.context ============
algebraic-graphs> OK: context (const False) x                   == Nothing
algebraic-graphs> OK: context (== 1)        (edge 1 2)          == Just (Context [   ] [2  ])
algebraic-graphs> OK: context (== 2)        (edge 1 2)          == Just (Context [1  ] [   ])
algebraic-graphs> OK: context (const True ) (edge 1 2)          == Just (Context [1  ] [2  ])
algebraic-graphs> OK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
algebraic-graphs> 
algebraic-graphs> ============ Graph.buildg ============
algebraic-graphs> OK: buildg (\e _ _ _ -> e)                                     == empty
algebraic-graphs> OK: buildg (\_ v _ _ -> v x)                                   == vertex x
algebraic-graphs> OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
algebraic-graphs> OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
algebraic-graphs> OK: buildg (\e v o _ -> foldr o e (map v xs))                  == vertices xs
algebraic-graphs> OK: buildg (\e v o c -> foldg e v o (flip c) g)                == transpose g
algebraic-graphs> 
algebraic-graphs> ============ Internal.List ============
algebraic-graphs> OK: pure 1 <> pure 4 == [1, 4]
algebraic-graphs> 
algebraic-graphs> ============ Graph.Label ============
algebraic-graphs> 
algebraic-graphs> ============ Any: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Distance Int: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Capacity Int: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Minimum (Path Int): instances ============
algebraic-graphs> OK: LeftNearRing
algebraic-graphs> 
algebraic-graphs> ============ PowerSet (Path Int): instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Count Int: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.consistent ============
algebraic-graphs> OK: arbitraryLabelledAdjacencyMap
algebraic-graphs> OK: empty
algebraic-graphs> OK: vertex
algebraic-graphs> OK: edge
algebraic-graphs> OK: overlay
algebraic-graphs> OK: connect
algebraic-graphs> OK: vertices
algebraic-graphs> OK: edges
algebraic-graphs> OK: overlays
algebraic-graphs> OK: fromAdjacencyMaps
algebraic-graphs> OK: removeVertex
algebraic-graphs> OK: removeEdge
algebraic-graphs> OK: replaceVertex
algebraic-graphs> OK: replaceEdge
algebraic-graphs> OK: transpose
algebraic-graphs> OK: gmap
algebraic-graphs> OK: emap
algebraic-graphs> OK: induce
algebraic-graphs> OK: closure
algebraic-graphs> OK: reflexiveClosure
algebraic-graphs> OK: symmetricClosure
algebraic-graphs> OK: transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edge ============
algebraic-graphs> OK: edge e    x y              == connect e (vertex x) (vertex y)
algebraic-graphs> OK: edge zero x y              == vertices [x,y]
algebraic-graphs> OK: hasEdge   x y (edge e x y) == (e /= mempty)
algebraic-graphs> OK: edgeLabel x y (edge e x y) == e
algebraic-graphs> OK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
algebraic-graphs> OK: vertexCount   (edge e 1 1) == 1
algebraic-graphs> OK: vertexCount   (edge e 1 2) == 2
algebraic-graphs> OK: x -<e>- y                  == edge e x y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.connect ============
algebraic-graphs> OK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect e x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect e 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edges ============
algebraic-graphs> OK: edges []        == empty
algebraic-graphs> OK: edges [(e,x,y)] == edge e x y
algebraic-graphs> OK: edges           == overlays . map (\(e, x, y) -> edge e x y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
algebraic-graphs> OK: fromAdjacencyMaps []                                  == empty
algebraic-graphs> OK: fromAdjacencyMaps [(x, Map.empty)]                    == vertex x
algebraic-graphs> OK: fromAdjacencyMaps [(x, Map.singleton y e)]            == if e == zero then vertices [x,y] else edge e x y
algebraic-graphs> OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty      x     ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x) empty ==  False
algebraic-graphs> OK: isSubgraphOf x y              ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                         == True
algebraic-graphs> OK: isEmpty (overlay empty empty)         == True
algebraic-graphs> OK: isEmpty (vertex x)                    == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x)   == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge e x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge e x y)     == (e /= zero)
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeLabel ============
algebraic-graphs> OK: edgeLabel x y empty         == zero
algebraic-graphs> OK: edgeLabel x y (vertex z)    == zero
algebraic-graphs> OK: edgeLabel x y (edge e x y)  == e
algebraic-graphs> OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty        == 0
algebraic-graphs> OK: edgeCount (vertex x)   == 0
algebraic-graphs> OK: edgeCount (edge e x y) == if e == zero then 0 else 1
algebraic-graphs> OK: edgeCount              == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty        == []
algebraic-graphs> OK: edgeList (vertex x)   == []
algebraic-graphs> OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty        == Set.empty
algebraic-graphs> OK: edgeSet (vertex x)   == Set.empty
algebraic-graphs> OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x empty        == Set.empty
algebraic-graphs> OK: preSet x (vertex x)   == Set.empty
algebraic-graphs> OK: preSet 1 (edge e 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x empty        == Set.empty
algebraic-graphs> OK: postSet x (vertex x)   == Set.empty
algebraic-graphs> OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge e 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.skeleton ============
algebraic-graphs> OK: hasEdge x y == hasEdge x y . skeleton
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge e x x)     == empty
algebraic-graphs> OK: removeVertex 1 (edge e 1 2)     == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge e x y)     == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == gmap (\v -> if v == x then y else v)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.replaceEdge ============
algebraic-graphs> OK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
algebraic-graphs> OK: replaceEdge e x y (edge f x y)      == edge e x y
algebraic-graphs> OK: edgeLabel x y (replaceEdge e x y z) == e
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose empty        == empty
algebraic-graphs> OK: transpose (vertex x)   == vertex x
algebraic-graphs> OK: transpose (edge e x y) == edge e y x
algebraic-graphs> OK: transpose . transpose  == id
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.gmap ============
algebraic-graphs> OK: gmap f empty        == empty
algebraic-graphs> OK: gmap f (vertex x)   == vertex (f x)
algebraic-graphs> OK: gmap f (edge e x y) == edge e (f x) (f y)
algebraic-graphs> OK: gmap id             == id
algebraic-graphs> OK: gmap f . gmap g     == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.emap ============
algebraic-graphs> OK: emap h empty           == empty
algebraic-graphs> OK: emap h (vertex x)      == vertex x
algebraic-graphs> OK: emap h (edge e x y)    == edge (h e) x y
algebraic-graphs> OK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
algebraic-graphs> OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
algebraic-graphs> OK: emap id                == id
algebraic-graphs> OK: emap g . emap h        == emap (g . h)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.closure ============
algebraic-graphs> OK: closure empty         == empty
algebraic-graphs> OK: closure (vertex x)    == edge one x x
algebraic-graphs> OK: closure (edge e x x)  == edge one x x
algebraic-graphs> OK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: closure               == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure               == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure     == closure
algebraic-graphs> OK: postSet x (closure y) == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x x)       == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge e x y)        == edge e x y
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edge ============
algebraic-graphs> OK: edge e    x y              == connect e (vertex x) (vertex y)
algebraic-graphs> OK: edge zero x y              == vertices [x,y]
algebraic-graphs> OK: hasEdge   x y (edge e x y) == (e /= mempty)
algebraic-graphs> OK: edgeLabel x y (edge e x y) == e
algebraic-graphs> OK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
algebraic-graphs> OK: vertexCount   (edge e 1 1) == 1
algebraic-graphs> OK: vertexCount   (edge e 1 2) == 2
algebraic-graphs> OK: x -<e>- y                  == edge e x y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.connect ============
algebraic-graphs> OK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect e x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect e 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edges ============
algebraic-graphs> OK: edges []        == empty
algebraic-graphs> OK: edges [(e,x,y)] == edge e x y
algebraic-graphs> OK: edges           == overlays . map (\(e, x, y) -> edge e x y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.foldg ============
algebraic-graphs> OK: foldg empty     vertex        connect             == id
algebraic-graphs> OK: foldg empty     vertex        (fmap flip connect) == transpose
algebraic-graphs> OK: foldg 1         (const 1)     (const (+))         == size
algebraic-graphs> OK: foldg True      (const False) (const (&&))        == isEmpty
algebraic-graphs> OK: foldg False     (== x)        (const (||))        == hasVertex x
algebraic-graphs> OK: foldg Set.empty Set.singleton (const Set.union)   == vertexSet
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.buildg ============
algebraic-graphs> OK: buildg (\e _ _ -> e)                                   == empty
algebraic-graphs> OK: buildg (\_ v _ -> v x)                                 == vertex x
algebraic-graphs> OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
algebraic-graphs> OK: buildg (\e v c -> foldr (c zero) e (map v xs))         == vertices xs
algebraic-graphs> OK: buildg (\e v c -> foldg e v (flip c) g)                == transpose g
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty      x     ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x) empty ==  False
algebraic-graphs> OK: isSubgraphOf x y              ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.isEmpty ============
algebraic-graphs> OK: isEmpty empty                         == True
algebraic-graphs> OK: isEmpty (overlay empty empty)         == True
algebraic-graphs> OK: isEmpty (vertex x)                    == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x)   == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge e x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.size ============
algebraic-graphs> OK: size empty         == 1
algebraic-graphs> OK: size (vertex x)    == 1
algebraic-graphs> OK: size (overlay x y) == size x + size y
algebraic-graphs> OK: size (connect x y) == size x + size y
algebraic-graphs> OK: size x             >= 1
algebraic-graphs> OK: size x             >= vertexCount x
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge e x y)     == (e /= zero)
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeLabel ============
algebraic-graphs> OK: edgeLabel x y empty         == zero
algebraic-graphs> OK: edgeLabel x y (vertex z)    == zero
algebraic-graphs> OK: edgeLabel x y (edge e x y)  == e
algebraic-graphs> OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeCount ============
algebraic-graphs> OK: edgeCount empty        == 0
algebraic-graphs> OK: edgeCount (vertex x)   == 0
algebraic-graphs> OK: edgeCount (edge e x y) == if e == zero then 0 else 1
algebraic-graphs> OK: edgeCount              == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeList ============
algebraic-graphs> OK: edgeList empty        == []
algebraic-graphs> OK: edgeList (vertex x)   == []
algebraic-graphs> OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeSet ============
algebraic-graphs> OK: edgeSet empty        == Set.empty
algebraic-graphs> OK: edgeSet (vertex x)   == Set.empty
algebraic-graphs> OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.preSet ============
algebraic-graphs> OK: preSet x empty        == Set.empty
algebraic-graphs> OK: preSet x (vertex x)   == Set.empty
algebraic-graphs> OK: preSet 1 (edge e 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.postSet ============
algebraic-graphs> OK: postSet x empty        == Set.empty
algebraic-graphs> OK: postSet x (vertex x)   == Set.empty
algebraic-graphs> OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge e 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge e x x)     == empty
algebraic-graphs> OK: removeVertex 1 (edge e 1 2)     == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge e x y)     == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == fmap (\v -> if v == x then y else v)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.replaceEdge ============
algebraic-graphs> OK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
algebraic-graphs> OK: replaceEdge e x y (edge f x y)      == edge e x y
algebraic-graphs> OK: edgeLabel x y (replaceEdge e x y z) == e
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.transpose ============
algebraic-graphs> OK: transpose empty        == empty
algebraic-graphs> OK: transpose (vertex x)   == vertex x
algebraic-graphs> OK: transpose (edge e x y) == edge e y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.fmap ============
algebraic-graphs> OK: fmap f empty        == empty
algebraic-graphs> OK: fmap f (vertex x)   == vertex (f x)
algebraic-graphs> OK: fmap f (edge e x y) == edge e (f x) (f y)
algebraic-graphs> OK: fmap id             == id
algebraic-graphs> OK: fmap f . fmap g     == fmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.emap ============
algebraic-graphs> OK: emap h empty           == empty
algebraic-graphs> OK: emap h (vertex x)      == vertex x
algebraic-graphs> OK: emap h (edge e x y)    == edge (h e) x y
algebraic-graphs> OK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
algebraic-graphs> OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
algebraic-graphs> OK: emap id                == id
algebraic-graphs> OK: emap g . emap h        == emap (g . h)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.closure ============
algebraic-graphs> OK: closure empty         == empty
algebraic-graphs> OK: closure (vertex x)    == edge one x x
algebraic-graphs> OK: closure (edge e x x)  == edge one x x
algebraic-graphs> OK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: closure               == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure               == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure     == closure
algebraic-graphs> OK: postSet x (closure y) == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x x)       == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge e x y)        == edge e x y
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.context ============
algebraic-graphs> OK: context (const False) x                   == Nothing
algebraic-graphs> OK: context (== 1)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context []      [(e,2)])
algebraic-graphs> OK: context (== 2)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] []     )
algebraic-graphs> OK: context (const True ) (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
algebraic-graphs> OK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap ============
algebraic-graphs> OK: Axioms of non-empty graphs
algebraic-graphs> OK: Theorems of non-empty graphs
algebraic-graphs> 
algebraic-graphs> ============ Ord (NonEmpty.AdjacencyMap a) ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Show (NonEmpty.AdjacencyMap a) ============
algebraic-graphs> OK: show (1         :: AdjacencyMap Int) == "vertex 1"
algebraic-graphs> OK: show (1 + 2     :: AdjacencyMap Int) == "vertices1 [1,2]"
algebraic-graphs> OK: show (1 * 2     :: AdjacencyMap Int) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> OK: show (vertex (-1)                             :: AdjacencyMap Int) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)               :: AdjacencyMap Int) == "vertices1 [-2,-1]"
algebraic-graphs> OK: show (vertex (-1) * vertex (-2)               :: AdjacencyMap Int) == "edge (-1) (-2)"
algebraic-graphs> OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
algebraic-graphs> OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.toNonEmpty ============
algebraic-graphs> OK: toNonEmpty empty          == Nothing
algebraic-graphs> OK: toNonEmpty . fromNonEmpty == Just
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
algebraic-graphs> OK: isEmpty . fromNonEmpty    == const False
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.overlay ============
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.connect ============
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertices1 ============
algebraic-graphs> OK: vertices1 [x]           == vertex x
algebraic-graphs> OK: hasVertex x . vertices1 == elem x
algebraic-graphs> OK: vertexCount . vertices1 == length . nub
algebraic-graphs> OK: vertexSet   . vertices1 == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edges1 ============
algebraic-graphs> OK: edges1 [(x,y)]     == edge x y
algebraic-graphs> OK: edges1             == overlays1 . fmap (uncurry edge)
algebraic-graphs> OK: edgeCount . edges1 == length . nub
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.overlays1 ============
algebraic-graphs> OK: overlays1 [x]   == x
algebraic-graphs> OK: overlays1 [x,y] == overlay x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.connects1 ============
algebraic-graphs> OK: connects1 [x]   == x
algebraic-graphs> OK: connects1 [x,y] == connect x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: vertexCount x          >= 1
algebraic-graphs> OK: vertexCount            == length . vertexList1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertexList1 ============
algebraic-graphs> OK: vertexList1 (vertex x)  == [x]
algebraic-graphs> OK: vertexList1 . vertices1 == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges1       == nub . sort . toList
algebraic-graphs> OK: edgeList . transpose    == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet . vertex    == Set.singleton
algebraic-graphs> OK: vertexSet . vertices1 == Set.fromList . toList
algebraic-graphs> OK: vertexSet . clique1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.path1 ============
algebraic-graphs> OK: path1 [x]       == vertex x
algebraic-graphs> OK: path1 [x,y]     == edge x y
algebraic-graphs> OK: path1 . reverse == transpose . path1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.circuit1 ============
algebraic-graphs> OK: circuit1 [x]       == edge x x
algebraic-graphs> OK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
algebraic-graphs> OK: circuit1 . reverse == transpose . circuit1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.clique1 ============
algebraic-graphs> OK: clique1 [x]        == vertex x
algebraic-graphs> OK: clique1 [x,y]      == edge x y
algebraic-graphs> OK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
algebraic-graphs> OK: clique1 . reverse  == transpose . clique1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.biclique1 ============
algebraic-graphs> OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges1 [(x,y), (x,z)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.stars1 ============
algebraic-graphs> OK: stars1 [(x, [] )]               == vertex x
algebraic-graphs> OK: stars1 [(x, [y])]               == edge x y
algebraic-graphs> OK: stars1 [(x, ys )]               == star x ys
algebraic-graphs> OK: stars1                          == overlays1 . fmap (uncurry star)
algebraic-graphs> OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.removeVertex1 ============
algebraic-graphs> OK: removeVertex1 x (vertex x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x (edge x x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices1 [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.gmap ============
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.induce1 ============
algebraic-graphs> OK: induce1 (const True ) x == Just x
algebraic-graphs> OK: induce1 (const False) x == Nothing
algebraic-graphs> OK: induce1 (/= x)          == removeVertex1 x
algebraic-graphs> OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.induceJust1 ============
algebraic-graphs> OK: induceJust1 (vertex Nothing)                               == Nothing
algebraic-graphs> OK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
algebraic-graphs> OK: induceJust1 . gmap Just                                    == Just
algebraic-graphs> OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.closure ============
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges1 [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges1 [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges1 [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path1 $ nub xs)    == clique1 (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.============
algebraic-graphs> OK: Axioms of non-empty graphs
algebraic-graphs> OK: Theorems of non-empty graphs
algebraic-graphs> 
algebraic-graphs> ============ Ord (NonEmpty.Graph a) ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Functor (NonEmpty.Graph a) ============
algebraic-graphs> OK: fmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: fmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: fmap id           == id
algebraic-graphs> OK: fmap f . fmap g   == fmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Monad (NonEmpty.Graph a) ============
algebraic-graphs> OK: (vertex x >>= f)     == f x
algebraic-graphs> OK: (edge x y >>= f)     == connect (f x) (f y)
algebraic-graphs> OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
algebraic-graphs> OK: (x >>= vertex)       == x
algebraic-graphs> OK: ((x >>= f) >>= g)    == (x >>= (\y -> (f y) >>= g))
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.toNonEmpty ============
algebraic-graphs> OK: toNonEmpty empty       == Nothing
algebraic-graphs> OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> OK: size        (vertex x) == 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.overlay ============
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: size        (overlay x y) == size x        + size y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.overlay1 ============
algebraic-graphs> OK:                overlay1 empty x == x
algebraic-graphs> OK: x /= empty ==> overlay1 x     y == overlay (fromJust $ toNonEmpty x) y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.connect ============
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: size        (connect x y) == size x        + size y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertices1 ============
algebraic-graphs> OK: vertices1 [x]           == vertex x
algebraic-graphs> OK: hasVertex x . vertices1 == elem x
algebraic-graphs> OK: vertexCount . vertices1 == length . nub
algebraic-graphs> OK: vertexSet   . vertices1 == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edges1 ============
algebraic-graphs> OK: edges1 [(x,y)]     == edge x y
algebraic-graphs> OK: edges1             == overlays1 . fmap (uncurry edge)
algebraic-graphs> OK: edgeCount . edges1 == length . nub
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.overlays1 ============
algebraic-graphs> OK: overlays1 [x]   == x
algebraic-graphs> OK: overlays1 [x,y] == overlay x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.connects1 ============
algebraic-graphs> OK: connects1 [x]   == x
algebraic-graphs> OK: connects1 [x,y] == connect x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.foldg1 ============
algebraic-graphs> OK: foldg1 vertex    overlay connect        == id
algebraic-graphs> OK: foldg1 vertex    overlay (flip connect) == transpose
algebraic-graphs> OK: foldg1 (const 1) (+)     (+)            == size
algebraic-graphs> OK: foldg1 (== x)    (||)    (||)           == hasVertex x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.(===) ============
algebraic-graphs> OK:     x === x     == True
algebraic-graphs> OK: x + y === x + y == True
algebraic-graphs> OK: 1 + 2 === 2 + 1 == False
algebraic-graphs> OK: x + y === x * y == False
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.size ============
algebraic-graphs> OK: size (vertex x)    == 1
algebraic-graphs> OK: size (overlay x y) == size x + size y
algebraic-graphs> OK: size (connect x y) == size x + size y
algebraic-graphs> OK: size x             >= 1
algebraic-graphs> OK: size x             >= vertexCount x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.hasVertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.hasEdge ============
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertexCount ============
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: vertexCount x          >= 1
algebraic-graphs> OK: vertexCount            == length . vertexList1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edgeCount ============
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertexList1 ============
algebraic-graphs> OK: vertexList1 (vertex x)  == [x]
algebraic-graphs> OK: vertexList1 . vertices1 == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edgeList ============
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges1       == nub . sort . toList
algebraic-graphs> OK: edgeList . transpose    == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertexSet ============
algebraic-graphs> OK: vertexSet . vertex    == Set.singleton
algebraic-graphs> OK: vertexSet . vertices1 == Set.fromList . toList
algebraic-graphs> OK: vertexSet . clique1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edgeSet ============
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.path1 ============
algebraic-graphs> OK: path1 [x]       == vertex x
algebraic-graphs> OK: path1 [x,y]     == edge x y
algebraic-graphs> OK: path1 . reverse == transpose . path1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.circuit1 ============
algebraic-graphs> OK: circuit1 [x]       == edge x x
algebraic-graphs> OK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
algebraic-graphs> OK: circuit1 . reverse == transpose . circuit1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.clique1 ============
algebraic-graphs> OK: clique1 [x]        == vertex x
algebraic-graphs> OK: clique1 [x,y]      == edge x y
algebraic-graphs> OK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
algebraic-graphs> OK: clique1 . reverse  == transpose . clique1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.biclique1 ============
algebraic-graphs> OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges1 [(x,y), (x,z)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.stars1 ============
algebraic-graphs> OK: stars1 [(x, [] )]               == vertex x
algebraic-graphs> OK: stars1 [(x, [y])]               == edge x y
algebraic-graphs> OK: stars1 [(x, ys )]               == star x ys
algebraic-graphs> OK: stars1                          == overlays1 . fmap (uncurry star)
algebraic-graphs> OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.mesh1 ============
algebraic-graphs> OK: mesh1 [x]     [y]        == vertex (x, y)
algebraic-graphs> OK: mesh1 xs      ys         == box (path1 xs) (path1 ys)
algebraic-graphs> OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
algebraic-graphs> OK: size (mesh xs ys)        == max 1 (3 * length xs * length ys - length xs - length ys -1)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.torus1 ============
algebraic-graphs> OK: torus1 [x]   [y]        == edge (x,y) (x,y)
algebraic-graphs> OK: torus1 xs    ys         == box (circuit1 xs) (circuit1 ys)
algebraic-graphs> OK: torus1 [1,2] ['a', 'b'] == <correct result>
algebraic-graphs> OK: size (torus1 xs ys)     == max 1 (3 * length xs * length ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.removeVertex1 ============
algebraic-graphs> OK: removeVertex1 x (vertex x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x (edge x x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices1 [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: size (removeEdge x y z)         <= 3 * size z
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.splitVertex1 ============
algebraic-graphs> OK: splitVertex1 x [x]                 == id
algebraic-graphs> OK: splitVertex1 x [y]                 == replaceVertex x y
algebraic-graphs> OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.transpose ============
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: transpose (box x y)   == box (transpose x) (transpose y)
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.induce1 ============
algebraic-graphs> OK: induce1 (const True ) x == Just x
algebraic-graphs> OK: induce1 (const False) x == Nothing
algebraic-graphs> OK: induce1 (/= x)          == removeVertex1 x
algebraic-graphs> OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.induceJust1 ============
algebraic-graphs> OK: induceJust1 (vertex Nothing)                               == Nothing
algebraic-graphs> OK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
algebraic-graphs> OK: induceJust1 . fmap Just                                    == Just
algebraic-graphs> OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.simplify ============
algebraic-graphs> OK: simplify             ==  id
algebraic-graphs> OK: size (simplify x)    <=  size x
algebraic-graphs> OK: simplify 1           === 1
algebraic-graphs> OK: simplify (1 + 1)     === 1
algebraic-graphs> OK: simplify (1 + 2 + 1) === 1 + 2
algebraic-graphs> OK: simplify (1 * 1 * 1) === 1 * 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.sparsify ============
algebraic-graphs> OK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
algebraic-graphs> OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
algebraic-graphs> OK: edgeCount   (sparsify x) <= 3 * size x
algebraic-graphs> OK: size        (sparsify x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.sparsifyKL ============
algebraic-graphs> OK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
algebraic-graphs> OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
algebraic-graphs> OK: length (edges    $ sparsifyKL n x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.box ============
algebraic-graphs> OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
algebraic-graphs> OK: box x y                             ~~ box y x
algebraic-graphs> OK: box x (overlay y z)                 == overlay (box x y) (box x z)
algebraic-graphs> OK: box x (vertex ())                   ~~ x
algebraic-graphs> OK: box x (box y z)                     ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y)               == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y)               == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y)               <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ Relation ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> 
algebraic-graphs> ============ Relation.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ Relation.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ Relation.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Relation.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Relation.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Relation.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Relation.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Relation.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Relation.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Relation.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Relation.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ Relation.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Relation.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Relation.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Relation.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Relation.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Relation.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ Relation.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Relation.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Relation.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Relation.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ Relation.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Relation.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ Relation.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Relation.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Relation.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Relation.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ Relation.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Relation.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Relation.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Relation.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Relation.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Relation.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> 
algebraic-graphs> ============ Relation.closure ============
algebraic-graphs> OK: closure empty           == empty
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ Relation.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Relation.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ Relation.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Relation.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ ReflexiveRelation ============
algebraic-graphs> OK: Axioms of reflexive graphs
algebraic-graphs> 
algebraic-graphs> ============ TransitiveRelation ============
algebraic-graphs> OK: Axioms of transitive graphs
algebraic-graphs> OK: path xs == (clique xs :: TransitiveRelation Int)
algebraic-graphs> 
algebraic-graphs> ============ PreorderRelation ============
algebraic-graphs> OK: Axioms of preorder graphs
algebraic-graphs> OK: path xs == (clique xs :: PreorderRelation Int)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation ============
algebraic-graphs> OK: Axioms of undirected graphs
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> OK: show (2 * 1    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
algebraic-graphs> OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.toSymmetric ============
algebraic-graphs> OK: toSymmetric (edge 1 2)         == edge 1 2
algebraic-graphs> OK: toSymmetric . fromSymmetric    == id
algebraic-graphs> OK: fromSymmetric    . toSymmetric == symmetricClosure
algebraic-graphs> OK: vertexCount      . toSymmetric == vertexCount
algebraic-graphs> OK: (*2) . edgeCount . toSymmetric >= edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.fromSymmetric ============
algebraic-graphs> OK: fromSymmetric (edge 1 2)    == edges [(1,2), (2,1)]
algebraic-graphs> OK: vertexCount . fromSymmetric == vertexCount
algebraic-graphs> OK: edgeCount   . fromSymmetric <= (*2) . edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 2 1 <  edge 1 3
algebraic-graphs> OK: edge 1 2 == edge 2 1
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: edge x y               == edge y x
algebraic-graphs> OK: edge x y               == edges [(x,y), (y,x)]
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.connect ============
algebraic-graphs> OK: connect x y               == connect y x
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edges ============
algebraic-graphs> OK: edges []             == empty
algebraic-graphs> OK: edges [(x,y)]        == edge x y
algebraic-graphs> OK: edges [(x,y), (y,x)] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> OK: connects           == connects . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> OK: isSubgraphOf (edge x y) (edge y x)       ==  True
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y (edge y x)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (min x y, max x y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(min x y, max y x)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [1])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.neighbours ============
algebraic-graphs> OK: neighbours x empty      == Set.empty
algebraic-graphs> OK: neighbours x (vertex x) == Set.empty
algebraic-graphs> OK: neighbours x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: neighbours y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> OK: path       == path . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> OK: circuit       == circuit . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> OK: clique            == clique . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: removeEdge x y                  == removeEdge y x
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Example.Todo (Holiday) ============
algebraic-graphs> OK: A todo list is semantically Maybe [a]
algebraic-graphs> OK: The overlay operator (+) adds non-dependent items to the todo list
algebraic-graphs> OK: The connect operator (*) adds dependency between items
algebraic-graphs> OK: Contradictory constraints make the todo list impossible to schedule
algebraic-graphs> OK: Introduce item priority to schedule the todo list
algebraic-graphs> OK: Custom connect operators pull/repel arguments during scheduling
algebraic-graphs> 
algebraic-graphs> ============ Example.Todo (Commandline) ============
algebraic-graphs> OK: The pull connect operator maintains command line semantics
algebraic-graphs> OK: Swapping flags are allowed by the commutative overlay opeartor
algebraic-graphs> OK: The usual connect operator breaks semantics
algebraic-graphs> OK: Transform command lines by adding optimisation flag
algebraic-graphs> 
algebraic-graphs> ============ Typed ============
algebraic-graphs> 
algebraic-graphs> ============ Typed.fromAdjacencyMap ============
algebraic-graphs> OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1))                                == array (0,2) [(0,[1]), (1,[]), (2,[0])]
algebraic-graphs> OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1))                                == array (0,1) [(0,[1]), (1,[0])]
algebraic-graphs> OK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == vertexList g
algebraic-graphs> OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
algebraic-graphs> 
algebraic-graphs> ============ Typed.fromAdjacencyIntMap ============
algebraic-graphs> OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1))                             == array (0,2) [(0,[1]), (1,[]), (2,[0])]
algebraic-graphs> OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1))                             == array (0,1) [(0,[1]), (1,[0])]
algebraic-graphs> OK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == IntSet.toAscList (vertexIntSet g)
algebraic-graphs> OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
algebraic-graphs> 
algebraic-graphs> ============ Typed.dfsForest ============
algebraic-graphs> OK: forest (dfsForest % edge 1 1)           == vertex 1
algebraic-graphs> OK: forest (dfsForest % edge 1 2)           == edge 1 2
algebraic-graphs> OK: forest (dfsForest % edge 2 1)           == vertices [1, 2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForest % x) x == True
algebraic-graphs> OK: dfsForest % forest (dfsForest % x)      == dfsForest % x
algebraic-graphs> OK: dfsForest % vertices vs                 == map (\v -> Node v []) (nub $ sort vs)
algebraic-graphs> OK: dfsForest % (3 * (1 + 4) * (1 + 5))     == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Typed.dfsForestFrom ============
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 1) [1]         == vertex 1
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [0]         == empty
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [1]         == edge 1 2
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [2]         == vertex 2
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [2,1]       == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
algebraic-graphs> OK: dfsForestFrom % x $ vertexList x                == dfsForest % x
algebraic-graphs> OK: dfsForestFrom % vertices vs $ vs                == map (\v -> Node v []) (nub vs)
algebraic-graphs> OK: dfsForestFrom % x $ []                          == []
algebraic-graphs> OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Typed.dfs ============
algebraic-graphs> OK: dfs % edge 1 1 $ [1]   == [1]
algebraic-graphs> OK: dfs % edge 1 2 $ [0]   == []
algebraic-graphs> OK: dfs % edge 1 2 $ [1]   == [1,2]
algebraic-graphs> OK: dfs % edge 1 2 $ [2]   == [2]
algebraic-graphs> OK: dfs % edge 1 2 $ [1,2] == [1,2]
algebraic-graphs> OK: dfs % edge 1 2 $ [2,1] == [2,1]
algebraic-graphs> OK: dfs % x        $ []    == []
algebraic-graphs> 
algebraic-graphs> OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4]     == [1,5,4]
algebraic-graphs> OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
algebraic-graphs> 
algebraic-graphs> ============ Typed.topSort ============
algebraic-graphs> OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
algebraic-graphs> OK: topSort % (1 * 2 + 2 * 1) == [1,2]
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected ============
algebraic-graphs> OK: Axioms of undirected graphs
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> OK: show (2 * 1    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
algebraic-graphs> OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.toUndirected ============
algebraic-graphs> OK: toUndirected (edge 1 2)         == edge 1 2
algebraic-graphs> OK: toUndirected . fromUndirected   == id
algebraic-graphs> OK: vertexCount      . toUndirected == vertexCount
algebraic-graphs> OK: (*2) . edgeCount . toUndirected >= edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.fromUndirected ============
algebraic-graphs> OK: fromUndirected (edge 1 2)    == edges [(1,2),(2,1)]
algebraic-graphs> OK: toUndirected . fromUndirected == id
algebraic-graphs> OK: vertexCount . fromUndirected == vertexCount
algebraic-graphs> OK: edgeCount   . fromUndirected <= (*2) . edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.complement ================
algebraic-graphs> OK: complement empty              == empty
algebraic-graphs> OK: complement (vertex x)         == vertex x
algebraic-graphs> OK: complement (edge 1 1)         == edge 1 1
algebraic-graphs> OK: complement (edge 1 2)         == vertices [1, 2]
algebraic-graphs> OK: complement (star 1 [2, 3])    == overlay (vertex 1) (edge 2 3)
algebraic-graphs> OK: complement . complement       == id
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 2 1 <  edge 1 3
algebraic-graphs> OK: edge 1 2 == edge 2 1
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: edge x y               == edge y x
algebraic-graphs> OK: edge x y               == edges [(x,y), (y,x)]
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.connect ============
algebraic-graphs> OK: connect x y               == connect y x
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.edges ============
algebraic-graphs> OK: edges []             == empty
algebraic-graphs> OK: edges [(x,y)]        == edge x y
algebraic-graphs> OK: edges [(x,y), (y,x)] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> OK: connects           == connects . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> OK: isSubgraphOf (edge x y) (edge y x)       ==  True
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> OK: path       == path . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> OK: circuit       == circuit . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> OK: clique            == clique . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: removeEdge x y                  == removeEdge y x
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> Test suite main: PASS
algebraic-graphs> Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
algebraic-graphs> 1 of 1 test suites (1 of 1 test cases) passed.
algebraic-graphs> checkPhase completed in 1 minutes 44 seconds
algebraic-graphs> Running phase: haddockPhase
algebraic-graphs> Preprocessing library for algebraic-graphs-0.7...
algebraic-graphs> Running Haddock on library for algebraic-graphs-0.7...
algebraic-graphs> [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
algebraic-graphs> [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
algebraic-graphs> [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
algebraic-graphs> [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 384 |     exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
algebraic-graphs>     |                                           ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 391 |              pth' = tail v_pth' -- Here we know that v_pth' starts with v
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 395 |              p_v = fst $ head bnd
algebraic-graphs>     |                          ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.Internal.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
algebraic-graphs>     |
algebraic-graphs> 397 |              bnd' = tail bnd
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
algebraic-graphs> [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 171 |     vertexIntSet :: ToVertex t ~ Int => t -> IntSet
algebraic-graphs>     |                                ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 197 |     preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                             ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 215 |     postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 303 |     toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                     ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 312 |     toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                           ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                                    ^
algebraic-graphs> 
algebraic-graphs> [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
algebraic-graphs> [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
algebraic-graphs> [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
algebraic-graphs> [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
algebraic-graphs> [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
algebraic-graphs> [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
algebraic-graphs> [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
algebraic-graphs> [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
algebraic-graphs> src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
algebraic-graphs>     |                                         ^
algebraic-graphs> 
algebraic-graphs> [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
algebraic-graphs>     |                                                               ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix:
algebraic-graphs>       Perhaps you intended to use the ‘TypeOperators’ extension
algebraic-graphs>     |
algebraic-graphs> 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
algebraic-graphs>     |                                                                              ^
algebraic-graphs> 
algebraic-graphs> [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
algebraic-graphs> [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
algebraic-graphs> [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
algebraic-graphs> [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
algebraic-graphs> [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
algebraic-graphs> [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
algebraic-graphs> [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
algebraic-graphs> Haddock coverage:
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>  100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>  100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
algebraic-graphs> Warning: 'nub' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'sort' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>   93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
algebraic-graphs> Warning: 'List' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Internal.hs:50:18
algebraic-graphs>     * at src/Algebra/Graph/Internal.hs:50:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
algebraic-graphs> Warning: 'IsList' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 19 / 19) in 'Algebra.Graph.Internal'
algebraic-graphs> Warning: 'Context' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1400:18
algebraic-graphs>     * at src/Algebra/Graph.hs:1400:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:316:1
algebraic-graphs>  100% ( 61 / 61) in 'Algebra.Graph'
algebraic-graphs> Warning: 'isEmpty' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'vertexCount' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'edgeCount' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'edgeList' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'box' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'adjacencyList' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'hasVertex' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'vertexSet' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'mplus' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
algebraic-graphs> Warning: 'swap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
algebraic-graphs>     * in ‘GHC.Internal.Data.Tuple’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
algebraic-graphs> Warning: 'nub' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs>  100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs> Warning: 'isRight' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'Matching' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
algebraic-graphs>  100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
algebraic-graphs> Warning: 'Optimum' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:442:20
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:442:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
algebraic-graphs> Warning: 'Minimum' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:314:21
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:314:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
algebraic-graphs> Warning: 'Distance' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:241:22
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:241:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
algebraic-graphs> Warning: 'Capacity' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:176:22
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:176:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
algebraic-graphs> Warning: 'Count' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:209:19
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:209:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
algebraic-graphs>  100% ( 37 / 37) in 'Algebra.Graph.Label'
algebraic-graphs> Warning: 'empty' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'edges' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'stars' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'AdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
algebraic-graphs> Warning: 'isEmpty' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'adjacencyList' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'vertexList' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
algebraic-graphs> Warning: 'nub' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'sort' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>   93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>  100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
algebraic-graphs> Warning: 'foldg' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:482:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:98:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
algebraic-graphs>  100% (  8 /  8) in 'Algebra.Graph.ToGraph'
algebraic-graphs> Warning: 'Relation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:157:19
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:157:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs> Warning: 'AdjacencyMap' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 56 / 56) in 'Algebra.Graph.Relation'
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:435:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
algebraic-graphs>  100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
algebraic-graphs> Warning: 'vertexList' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
algebraic-graphs>  100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
algebraic-graphs> Warning: 'Context' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:675:20
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:675:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:191:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
algebraic-graphs> Warning: 'Focus' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:642:18
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:642:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
algebraic-graphs>  100% ( 49 / 49) in 'Algebra.Graph.Labelled'
algebraic-graphs>  100% (  6 /  6) in 'Algebra.Graph.Labelled.Example.Network'
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Labelled.Example.Automaton'
algebraic-graphs> Warning: 'Doc' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Export.hs:57:17
algebraic-graphs>     * at src/Algebra/Graph/Export.hs:57:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
algebraic-graphs>  100% ( 14 / 14) in 'Algebra.Graph.Export'
algebraic-graphs> Warning: 'Style' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Export/Dot.hs:49:18
algebraic-graphs>     * at src/Algebra/Graph/Export/Dot.hs:49:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
algebraic-graphs> Warning: 'Graph' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:253:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
algebraic-graphs>  100% ( 50 / 50) in 'Algebra.Graph.Undirected'
algebraic-graphs>  100% ( 27 / 27) in 'Algebra.Graph.Class'
algebraic-graphs> Warning: 'TransitiveRelation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Transitive.hs:39:32
algebraic-graphs>     * at src/Algebra/Graph/Relation/Transitive.hs:39:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
algebraic-graphs> Warning: 'Transitive' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Relation.Transitive'
algebraic-graphs> Warning: 'ReflexiveRelation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
algebraic-graphs>     * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
algebraic-graphs> Warning: 'Reflexive' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Relation.Reflexive'
algebraic-graphs> Warning: 'PreorderRelation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Preorder.hs:44:30
algebraic-graphs>     * at src/Algebra/Graph/Relation/Preorder.hs:44:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
algebraic-graphs> Warning: 'Preorder' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Relation.Preorder'
algebraic-graphs>    0% (  0 /  8) in 'Algebra.Graph.Example.Todo'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     Module header
algebraic-graphs>     Todo (src/Algebra/Graph/Example/Todo.hs:13)
algebraic-graphs>     todo (src/Algebra/Graph/Example/Todo.hs:42)
algebraic-graphs>     low (src/Algebra/Graph/Example/Todo.hs:23)
algebraic-graphs>     high (src/Algebra/Graph/Example/Todo.hs:27)
algebraic-graphs>     ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
algebraic-graphs>     >*< (src/Algebra/Graph/Example/Todo.hs:39)
algebraic-graphs>     priority (src/Algebra/Graph/Example/Todo.hs:31)
algebraic-graphs> Warning: 'GraphKL' is ambiguous. It is defined
algebraic-graphs>     * at src/Data/Graph/Typed.hs:40:18
algebraic-graphs>     * at src/Data/Graph/Typed.hs:40:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
algebraic-graphs> Warning: 'array' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>   90% ( 10 / 11) in 'Data.Graph.Typed'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     scc (src/Data/Graph/Typed.hs:192)
algebraic-graphs> Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
algebraic-graphs> Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
algebraic-graphs> Warning: Algebra.Graph.Internal: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Internal.D:R:ItemList
algebraic-graphs> Warning: Algebra.Graph: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Rep_Graph
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph1
algebraic-graphs> Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
algebraic-graphs> Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
algebraic-graphs> Warning: Algebra.Graph.Label: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Label.D:R:ItemLabel
algebraic-graphs>       - Algebra.Graph.Label.D:R:ItemMinimum
algebraic-graphs> Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
algebraic-graphs> Warning: Algebra.Graph.ToGraph: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Relation.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.Labelled.D:R:ToVertexGraph
algebraic-graphs> Warning: Algebra.Graph.Relation: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation0
algebraic-graphs> Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation
algebraic-graphs> Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
algebraic-graphs> Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap
algebraic-graphs> Warning: Algebra.Graph.Labelled: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Labelled.Rep_Graph
algebraic-graphs>       - Algebra.Graph.Labelled.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph
algebraic-graphs> Warning: Algebra.Graph.Undirected: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Undirected.Rep_Graph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph0
algebraic-graphs> Warning: Algebra.Graph.Class: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexFUN
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph1
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexMaybe
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexTuple2
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexTuple3
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexUnit
algebraic-graphs>       - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
algebraic-graphs>       - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
algebraic-graphs>       - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
algebraic-graphs>       - Algebra.Graph.Example.Todo.D:R:VertexTodo
algebraic-graphs> Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
algebraic-graphs> Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
algebraic-graphs> Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
algebraic-graphs> Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Example.Todo.D:R:VertexTodo
algebraic-graphs> Documentation created: dist/doc/html/algebraic-graphs,
algebraic-graphs> dist/doc/html/algebraic-graphs/algebraic-graphs.txt
algebraic-graphs> Preprocessing test suite 'main' for algebraic-graphs-0.7...
algebraic-graphs> Running phase: installPhase
algebraic-graphs> Installing library in /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
algebraic-graphs> Running phase: fixupPhase
algebraic-graphs> shrinking RPATHs of ELF executables and libraries in /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7
algebraic-graphs> shrinking /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSalgebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI-ghc9.12.1.so
algebraic-graphs> checking for references to /build/ in /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7...
algebraic-graphs> patching script interpreter paths in /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7
algebraic-graphs> stripping (with command strip and flags -S -p) in  /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/lib
algebraic-graphs> shrinking RPATHs of ELF executables and libraries in /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc
algebraic-graphs> checking for references to /build/ in /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc...
algebraic-graphs> patching script interpreter paths in /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc
algebraic-graphs (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7 /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc
algebraic-graphs (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
algebraic-graphs (post)> 
algebraic-graphs (post)> Pushing /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7 (25.82 MiB)
algebraic-graphs (post)> Pushing /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc (10.41 MiB)
algebraic-graphs (post)> 
algebraic-graphs (post)> All done.
algebraic-graphs (post)> added 2 signatures
algebraic-graphs (post)> added 3 signatures
algebraic-graphs (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7 /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc
algebraic-graphs (post)> copying 2 paths...
algebraic-graphs (post)> copying path '/nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
algebraic-graphs (post)> copying path '/nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
algebraic-graphs (post)> copying 1 paths...
algebraic-graphs (post)> copying path '/nix/store/13gwc5v8mp1ms298j24c5dsmm4q0nx1l-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
algebraic-graphs (post)> added 0 signatures
algebraic-graphs (post)> added 0 signatures
algebraic-graphs (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7 /nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc
algebraic-graphs (post)> copying 2 paths...
algebraic-graphs (post)> copying path '/nix/store/4raknw47aciwq8062awgsw89va20g35h-algebraic-graphs-0.7-doc' to 'ssh-ng://worker.nix-ci.com'...
algebraic-graphs (post)> copying path '/nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7' to 'ssh-ng://worker.nix-ci.com'...
algebraic-graphs (post)> copying 1 paths...
algebraic-graphs (post)> copying path '/nix/store/13gwc5v8mp1ms298j24c5dsmm4q0nx1l-algebraic-graphs-0.7.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/jqrxvjrwkddrjydlz8wklm32s4g2rsm0-ghc-9.12.1-with-packages.drv'...
ghc> /nix/store/118sgr4ai4ydfmb923lyavmpbkxj84n8-doctest-0.24.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/2949lhzs84qkv2bjkv46bxb90f48iicp-hedgehog-1.5/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/59qgvxzkmaq8wsnr7x4wk7yra9i6zjcv-no-recursion-0.3.0.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/12r9j1ybsnxd41z0jy6wwsprqbzywriq-Cabal-3.12.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/88mzwch772i7f01sz08winmi5w3x9lf5-cabal-doctest-1.0.11/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/i881scqi2iqjm2n3y85624marbaa5liq-temporary-1.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/i881scqi2iqjm2n3y85624marbaa5liq-temporary-1.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/qajlzal9ay5s8wss50czfk65dsq1ij7c-ansi-terminal-1.1.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/qajlzal9ay5s8wss50czfk65dsq1ij7c-ansi-terminal-1.1.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/dmgd5b0hyflmmmwnf2kipp4al5r857px-async-2.2.5/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/dmgd5b0hyflmmmwnf2kipp4al5r857px-async-2.2.5/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/p1mwqyza9q1rqncm4x816y59zim5gc48-barbies-2.1.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/p1mwqyza9q1rqncm4x816y59zim5gc48-barbies-2.1.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/klqv17pvmspyki9vdinmnw9prq8d1n37-concurrent-output-1.10.21/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/klqv17pvmspyki9vdinmnw9prq8d1n37-concurrent-output-1.10.21/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/igij0b49dymgkaryvq3vwayklc77q73f-lifted-async-0.10.2.7/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/igij0b49dymgkaryvq3vwayklc77q73f-lifted-async-0.10.2.7/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/2z37kwaakxx7rv9gbzidzpjfrhx2ijjr-mmorph-1.2.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/2z37kwaakxx7rv9gbzidzpjfrhx2ijjr-mmorph-1.2.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/6fi078iwp0bnf2cmp38rn63cyjw3f117-monad-control-1.0.3.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/6fi078iwp0bnf2cmp38rn63cyjw3f117-monad-control-1.0.3.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/xpz4wl2qkkp77svsazhvj1rj7msnjrbl-pretty-show-1.10/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/xpz4wl2qkkp77svsazhvj1rj7msnjrbl-pretty-show-1.10/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/6naj6c7b1i7n4aadha7y21w0vsi663ic-primitive-0.9.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/6naj6c7b1i7n4aadha7y21w0vsi663ic-primitive-0.9.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/7jy5rmj94d2cwbdxrc4pnwxkkdif7z5i-random-1.2.1.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/7jy5rmj94d2cwbdxrc4pnwxkkdif7z5i-random-1.2.1.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/adj29y5x83ah5hrxc71zly9knxqyh2sy-resourcet-1.3.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/adj29y5x83ah5hrxc71zly9knxqyh2sy-resourcet-1.3.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/9anwbb8my8k1as3lmbrgnqk0brwhccw5-safe-exceptions-0.1.7.4/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/9anwbb8my8k1as3lmbrgnqk0brwhccw5-safe-exceptions-0.1.7.4/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/d8r6djnk02fn7c3zzddi45b7j6ammar1-transformers-base-0.4.6/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/d8r6djnk02fn7c3zzddi45b7j6ammar1-transformers-base-0.4.6/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/pxiq1f2z48dw4h162hwh2kqxgyfvpzdd-wl-pprint-annotated-0.1.0.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/pxiq1f2z48dw4h162hwh2kqxgyfvpzdd-wl-pprint-annotated-0.1.0.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/7r2n3av9jjhba1z5d253akqs4bv5ig31-Cabal-syntax-3.12.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/jja8pwfbp3dx9j5q5iy7bfgvbwny0yz8-ansi-terminal-types-1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/jja8pwfbp3dx9j5q5iy7bfgvbwny0yz8-ansi-terminal-types-1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/7wy9v1yd358qmbk9ryqb3ki4p7yrxgj2-hashable-1.4.7.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/7wy9v1yd358qmbk9ryqb3ki4p7yrxgj2-hashable-1.4.7.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/kahxqgf2jz35asgp7bx8zyvn1qiwcblr-distributive-0.6.2.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/kahxqgf2jz35asgp7bx8zyvn1qiwcblr-distributive-0.6.2.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/342jwl67r98gbb59ncj81vf5lla52q3j-constraints-0.14.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/342jwl67r98gbb59ncj81vf5lla52q3j-constraints-0.14.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/mjgx67mmcp65dmiigw10fvvyf7258vy5-lifted-base-0.2.3.12/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/mjgx67mmcp65dmiigw10fvvyf7258vy5-lifted-base-0.2.3.12/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/1j98l6qnql4hhya968kl504gbp4g2rii-transformers-compat-0.7.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/1j98l6qnql4hhya968kl504gbp4g2rii-transformers-compat-0.7.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/c0i5jayvp308xpd4ic4l9m8cy9l08rfl-splitmix-0.1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/c0i5jayvp308xpd4ic4l9m8cy9l08rfl-splitmix-0.1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/b56fmsg0kb68ln7nmxkkxvfv7br3zfja-unliftio-core-0.2.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/b56fmsg0kb68ln7nmxkkxvfv7br3zfja-unliftio-core-0.2.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/m6n9m0zb30rw6kgs5fjqmdx9cm2kn30v-base-orphans-0.9.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/m6n9m0zb30rw6kgs5fjqmdx9cm2kn30v-base-orphans-0.9.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/ki2lrj6qyg9laqhvby34jwbcwnx6n733-tagged-0.8.9/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/ki2lrj6qyg9laqhvby34jwbcwnx6n733-tagged-0.8.9/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/bnm8j03b0h7b2ivmpp9f14n0rzxy9ikb-boring-0.2.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/bnm8j03b0h7b2ivmpp9f14n0rzxy9ikb-boring-0.2.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/2khsg218gz8831bfadhckzw50n02qz8m-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/6n4njizw7b20zdar5ms2kw38jdz33xmb-ghc-9.12.1-with-packages
ghc (post)> Pushing 1 paths (148 are already present) using zstd to cache sellout ⏳
ghc (post)> 
ghc (post)> Pushing /nix/store/6n4njizw7b20zdar5ms2kw38jdz33xmb-ghc-9.12.1-with-packages (6.75 MiB)
ghc (post)> 
ghc (post)> All done.
ghc (post)> added 1 signatures
ghc (post)> added 1 signatures
ghc (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/6n4njizw7b20zdar5ms2kw38jdz33xmb-ghc-9.12.1-with-packages
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/6n4njizw7b20zdar5ms2kw38jdz33xmb-ghc-9.12.1-with-packages' to 'https://cache.nix-ci.com'...
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/jqrxvjrwkddrjydlz8wklm32s4g2rsm0-ghc-9.12.1-with-packages.drv' to 'https://cache.nix-ci.com'...
ghc (post)> added 0 signatures
ghc (post)> added 0 signatures
ghc (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/6n4njizw7b20zdar5ms2kw38jdz33xmb-ghc-9.12.1-with-packages
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/6n4njizw7b20zdar5ms2kw38jdz33xmb-ghc-9.12.1-with-packages' to 'ssh-ng://worker.nix-ci.com'...
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/jqrxvjrwkddrjydlz8wklm32s4g2rsm0-ghc-9.12.1-with-packages.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/80y1lh75sm5bqaid94k5qm9zk1cgp2kv-ghc-shell-for-packages-0.drv'...
ghc-shell-for-packages (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/nd20w6acpgnbj3gkgyrkidmmhld7bvpb-ghc-shell-for-packages-0
ghc-shell-for-packages (post)> Pushing 1 paths (768 are already present) using zstd to cache sellout ⏳
ghc-shell-for-packages (post)> 
ghc-shell-for-packages (post)> Pushing /nix/store/nd20w6acpgnbj3gkgyrkidmmhld7bvpb-ghc-shell-for-packages-0 (336.00 B)
ghc-shell-for-packages (post)> 
ghc-shell-for-packages (post)> All done.
ghc-shell-for-packages (post)> added 1 signatures
ghc-shell-for-packages (post)> added 407 signatures
ghc-shell-for-packages (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/nd20w6acpgnbj3gkgyrkidmmhld7bvpb-ghc-shell-for-packages-0
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/nd20w6acpgnbj3gkgyrkidmmhld7bvpb-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/80y1lh75sm5bqaid94k5qm9zk1cgp2kv-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
ghc-shell-for-packages (post)> added 0 signatures
ghc-shell-for-packages (post)> added 0 signatures
ghc-shell-for-packages (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/nd20w6acpgnbj3gkgyrkidmmhld7bvpb-ghc-shell-for-packages-0
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/nd20w6acpgnbj3gkgyrkidmmhld7bvpb-ghc-shell-for-packages-0' to 'ssh-ng://worker.nix-ci.com'...
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/80y1lh75sm5bqaid94k5qm9zk1cgp2kv-ghc-shell-for-packages-0.drv' to 'ssh-ng://worker.nix-ci.com'...