$ /nix/store/9ypz3flqsrl5xl495mm8h645gadjsxi1-coreutils-9.11/bin/timeout --kill-after=15s 7200s /nix/store/23zk8sgzamrbmj1fday15szf7f2279s8-nix-2.34.7/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link --print-out-paths git+https://github.com/sellout/duoids?ref=do-helpers&rev=4415bc17d6e7dc493e0ba036c397559d9b43477f#packages.x86_64-linux.ghc981_all --print-build-logs[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'extra-experimental-features'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'extra-substituters'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'sandbox'.
Pass '--accept-flake-config' to trust it[m
[33m[35;1mwarning:[0m ignoring untrusted flake configuration setting 'use-registries'.
Pass '--accept-flake-config' to trust it[m
[1;31m[31;1merror (ignored):[0m SQLite database '[35;1m/var/cache/nix-ci-worker/eval-cache-v6/332ac380fc21d537dd399ae00234081c7a9833ea642f2fa8bbeeaa4b8bf81126.sqlite[0m' is busy[m
[2m[m
[33mWaiting for lock on QuickCheck[m
[33mWaiting for lock on pcre-light-0.4.1.3-doc[m
[33mWaiting for lock on prettyprinter-compat-ansi-wl-pprint-1.0.2-doc[m
[33mWaiting for lock on temporary-1.3-doc[m
[33mWaiting for lock on tf-random[m
[1;34mBuilding /nix/store/wqs3nrn6d8wa477i8zwzdn6alwdvb7y3-ansi-wl-pprint-1.0.2.drv[m
[1;34mBuilding /nix/store/jwqgwhdmk07lrcnlw4z5q3dxmfdqfl50-mockery-0.3.5.drv[m
[1;34mBuilding /nix/store/8b2wllamp0dsyr630vf3plvf8d2r5m5x-silently-1.2.5.4.drv[m
[2m[ansi-wl-pprint] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[ansi-wl-pprint] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[mockery] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[mockery] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[silently] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[silently] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[ansi-wl-pprint] [m[1;36mPhase: unpackPhase[m
[2m[ansi-wl-pprint] [munpacking source archive /nix/store/bn4xhlfbrgczm36s7vvcda4d3vmah4vg-ansi-wl-pprint-1.0.2.tar.gz
[2m[ansi-wl-pprint] [msource root is ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ansi-wl-pprint-1.0.2/Text/PrettyPrint/ANSI/Leijen.hs"
[2m[ansi-wl-pprint] [m[1;36mPhase: patchPhase[m
[2m[ansi-wl-pprint] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[ansi-wl-pprint] [msetupCompileFlags: -package-db=/build/tmp.qihxReJb6W/setup-package.conf.d -threaded
[2m[mockery] [m[1;36mPhase: unpackPhase[m
[2m[mockery] [munpacking source archive /nix/store/2j17zwqki29h364gcnxi17f07sn8n67z-mockery-0.3.5.tar.gz
[2m[mockery] [msource root is mockery-0.3.5
[2m[mockery] [msetting SOURCE_DATE_EPOCH to timestamp 1497365837 of file "mockery-0.3.5/test/Test/Mockery/LoggingSpec.hs"
[2m[mockery] [m[1;36mPhase: patchPhase[m
[2m[mockery] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[mockery] [msetupCompileFlags: -package-db=/build/tmp.tfe4xDRdkV/setup-package.conf.d -threaded
[2m[ansi-wl-pprint] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.qihxReJb6W/Main.o )
[2m[silently] [m[1;36mPhase: unpackPhase[m
[2m[silently] [munpacking source archive /nix/store/x34q6jfb0kpc50liiwycz490wiynqqpj-silently-1.2.5.4.tar.gz
[2m[silently] [msource root is silently-1.2.5.4
[2m[silently] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "silently-1.2.5.4/test/Spec.hs"
[2m[silently] [m[1;36mPhase: patchPhase[m
[2m[silently] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[silently] [msetupCompileFlags: -package-db=/build/tmp.hFEcG1h72W/setup-package.conf.d -threaded
[2m[mockery] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.tfe4xDRdkV/Main.o )
[2m[silently] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.hFEcG1h72W/Main.o )
[2m[ansi-wl-pprint] [m[2 of 2] Linking Setup
[2m[mockery] [m[2 of 2] Linking Setup
[2m[silently] [m[2 of 2] Linking Setup
[2m[ansi-wl-pprint] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[ansi-wl-pprint] [m[1;36mPhase: configurePhase[m
[2m[ansi-wl-pprint] [mconfigureFlags: --verbose --prefix=/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc/share/doc/ansi-wl-pprint-1.0.2 --with-gcc=gcc --package-db=/build/tmp.qihxReJb6W/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[ansi-wl-pprint] [mUsing Parsec parser
[2m[ansi-wl-pprint] [mConfiguring ansi-wl-pprint-1.0.2...
[2m[mockery] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[mockery] [m[1;36mPhase: configurePhase[m
[2m[mockery] [mconfigureFlags: --verbose --prefix=/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc/share/doc/mockery-0.3.5 --with-gcc=gcc --package-db=/build/tmp.tfe4xDRdkV/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[mockery] [mUsing Parsec parser
[2m[mockery] [mConfiguring mockery-0.3.5...
[2m[silently] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[silently] [m[1;36mPhase: configurePhase[m
[2m[silently] [mconfigureFlags: --verbose --prefix=/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc/share/doc/silently-1.2.5.4 --with-gcc=gcc --package-db=/build/tmp.hFEcG1h72W/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[silently] [mUsing Parsec parser
[2m[silently] [mConfiguring silently-1.2.5.4...
[2m[ansi-wl-pprint] [mFlags chosen: example=False
[2m[ansi-wl-pprint] [mDependency base >=4.5 && <5: using base-4.19.0.0
[2m[ansi-wl-pprint] [mDependency prettyprinter-compat-ansi-wl-pprint >=1.0.2 && <1.0.3: using
[2m[ansi-wl-pprint] [mprettyprinter-compat-ansi-wl-pprint-1.0.2
[2m[mockery] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[mockery] [mDependency base-compat: using base-compat-0.13.1
[2m[mockery] [mDependency bytestring: using bytestring-0.12.0.2
[2m[mockery] [mDependency directory: using directory-1.3.8.1
[2m[mockery] [mDependency filepath: using filepath-1.4.100.4
[2m[mockery] [mDependency logging-facade: using logging-facade-0.3.1
[2m[mockery] [mDependency temporary: using temporary-1.3
[2m[silently] [mDependency base >=4.3 && <5: using base-4.19.0.0
[2m[silently] [mDependency deepseq: using deepseq-1.5.0.0
[2m[silently] [mDependency directory: using directory-1.3.8.1
[2m[silently] [mDependency base >=4.3 && <5: using base-4.19.0.0
[2m[silently] [mDependency directory: using directory-1.3.8.1
[2m[silently] [mDependency nanospec: using nanospec-0.2.2
[2m[silently] [mDependency silently: using silently-1.2.5.4
[2m[silently] [mDependency temporary: using temporary-1.3
[2m[silently] [mDependency base >=4.3 && <5: using base-4.19.0.0
[2m[silently] [mDependency deepseq: using deepseq-1.5.0.0
[2m[silently] [mDependency directory: using directory-1.3.8.1
[2m[silently] [mDependency nanospec: using nanospec-0.2.2
[2m[silently] [mDependency temporary: using temporary-1.3
[2m[ansi-wl-pprint] [mSource component graph: component lib
[2m[ansi-wl-pprint] [mConfigured component graph:
[2m[ansi-wl-pprint] [m    component ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[ansi-wl-pprint] [m        include base-4.19.0.0-b960
[2m[ansi-wl-pprint] [m        include prettyprinter-compat-ansi-wl-pprint-1.0.2-GSYTcx9xHBv8nm7np3duJd
[2m[ansi-wl-pprint] [mLinked component graph:
[2m[ansi-wl-pprint] [m    unit ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[ansi-wl-pprint] [m        include base-4.19.0.0-b960
[2m[ansi-wl-pprint] [m        include prettyprinter-compat-ansi-wl-pprint-1.0.2-GSYTcx9xHBv8nm7np3duJd
[2m[ansi-wl-pprint] [m        Text.PrettyPrint.ANSI.Leijen=ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS:Text.PrettyPrint.ANSI.Leijen
[2m[ansi-wl-pprint] [mReady component graph:
[2m[ansi-wl-pprint] [m    definite ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[ansi-wl-pprint] [m        depends base-4.19.0.0-b960
[2m[ansi-wl-pprint] [m        depends prettyprinter-compat-ansi-wl-pprint-1.0.2-GSYTcx9xHBv8nm7np3duJd
[2m[ansi-wl-pprint] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[ansi-wl-pprint] [mUsing compiler: ghc-9.8.1
[2m[ansi-wl-pprint] [mUsing install prefix:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [mExecutables installed in:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/bin
[2m[ansi-wl-pprint] [mLibraries installed in:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[ansi-wl-pprint] [mDynamic Libraries installed in:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[ansi-wl-pprint] [mPrivate executables installed in:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/libexec/x86_64-linux-ghc-9.8.1/ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [mData files installed in:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/share/x86_64-linux-ghc-9.8.1/ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [mDocumentation installed in:
[2m[ansi-wl-pprint] [m/nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc/share/doc/ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [mConfiguration files installed in:
[2m[ansi-wl-pprint] [m/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/etc
[2m[ansi-wl-pprint] [mNo alex found
[2m[ansi-wl-pprint] [mUsing ar found on system at:
[2m[ansi-wl-pprint] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[ansi-wl-pprint] [mNo c2hs found
[2m[ansi-wl-pprint] [mNo cpphs found
[2m[ansi-wl-pprint] [mNo doctest found
[2m[ansi-wl-pprint] [mUsing gcc version 14.3.0 given by user at:
[2m[ansi-wl-pprint] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[ansi-wl-pprint] [mUsing ghc version 9.8.1 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[ansi-wl-pprint] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[ansi-wl-pprint] [mNo ghcjs found
[2m[ansi-wl-pprint] [mNo ghcjs-pkg found
[2m[ansi-wl-pprint] [mNo greencard found
[2m[ansi-wl-pprint] [mUsing haddock version 2.30.0 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[ansi-wl-pprint] [mNo happy found
[2m[ansi-wl-pprint] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[ansi-wl-pprint] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[ansi-wl-pprint] [mNo hmake found
[2m[ansi-wl-pprint] [mUsing hpc version 0.69 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[ansi-wl-pprint] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[ansi-wl-pprint] [mUsing hscolour version 1.25 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[ansi-wl-pprint] [mNo jhc found
[2m[ansi-wl-pprint] [mUsing ld found on system at:
[2m[ansi-wl-pprint] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[ansi-wl-pprint] [mNo pkg-config found
[2m[ansi-wl-pprint] [mUsing runghc version 9.8.1 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[ansi-wl-pprint] [mUsing strip version 2.44 found on system at:
[2m[ansi-wl-pprint] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[ansi-wl-pprint] [mUsing tar found on system at:
[2m[ansi-wl-pprint] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[ansi-wl-pprint] [mNo uhc found
[2m[ansi-wl-pprint] [m[1;36mPhase: buildPhase[m
[2m[mockery] [mSource component graph: component lib
[2m[mockery] [mConfigured component graph:
[2m[mockery] [m    component mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[mockery] [m        include base-4.19.0.0-b960
[2m[mockery] [m        include base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
[2m[mockery] [m        include bytestring-0.12.0.2-4690
[2m[mockery] [m        include directory-1.3.8.1-6a8e
[2m[mockery] [m        include filepath-1.4.100.4-fa1c
[2m[mockery] [m        include logging-facade-0.3.1-GKd2f25uZaOERjeFbSCycV
[2m[mockery] [m        include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[mockery] [mLinked component graph:
[2m[mockery] [m    unit mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[mockery] [m        include base-4.19.0.0-b960
[2m[mockery] [m        include base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
[2m[mockery] [m        include bytestring-0.12.0.2-4690
[2m[mockery] [m        include directory-1.3.8.1-6a8e
[2m[mockery] [m        include filepath-1.4.100.4-fa1c
[2m[mockery] [m        include logging-facade-0.3.1-GKd2f25uZaOERjeFbSCycV
[2m[mockery] [m        include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[mockery] [m        Test.Mockery.Directory=mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC:Test.Mockery.Directory,Test.Mockery.Environment=mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC:Test.Mockery.Environment,Test.Mockery.Logging=mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC:Test.Mockery.Logging
[2m[mockery] [mReady component graph:
[2m[mockery] [m    definite mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[mockery] [m        depends base-4.19.0.0-b960
[2m[mockery] [m        depends base-compat-0.13.1-Eotc18fTsmWG4LIuz3QQXm
[2m[mockery] [m        depends bytestring-0.12.0.2-4690
[2m[mockery] [m        depends directory-1.3.8.1-6a8e
[2m[mockery] [m        depends filepath-1.4.100.4-fa1c
[2m[mockery] [m        depends logging-facade-0.3.1-GKd2f25uZaOERjeFbSCycV
[2m[mockery] [m        depends temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[mockery] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[mockery] [mUsing compiler: ghc-9.8.1
[2m[mockery] [mUsing install prefix:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5
[2m[mockery] [mExecutables installed in:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/bin
[2m[mockery] [mLibraries installed in:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[mockery] [mDynamic Libraries installed in:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[mockery] [mPrivate executables installed in:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/libexec/x86_64-linux-ghc-9.8.1/mockery-0.3.5
[2m[mockery] [mData files installed in:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/share/x86_64-linux-ghc-9.8.1/mockery-0.3.5
[2m[mockery] [mDocumentation installed in:
[2m[mockery] [m/nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc/share/doc/mockery-0.3.5
[2m[mockery] [mConfiguration files installed in:
[2m[mockery] [m/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/etc
[2m[mockery] [mNo alex found
[2m[mockery] [mUsing ar found on system at:
[2m[mockery] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[mockery] [mNo c2hs found
[2m[mockery] [mNo cpphs found
[2m[mockery] [mNo doctest found
[2m[mockery] [mUsing gcc version 14.3.0 given by user at:
[2m[mockery] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[mockery] [mUsing ghc version 9.8.1 found on system at:
[2m[mockery] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[mockery] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[mockery] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[mockery] [mNo ghcjs found
[2m[mockery] [mNo ghcjs-pkg found
[2m[mockery] [mNo greencard found
[2m[mockery] [mUsing haddock version 2.30.0 found on system at:
[2m[mockery] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[mockery] [mNo happy found
[2m[mockery] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[mockery] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[mockery] [mNo hmake found
[2m[mockery] [mUsing hpc version 0.69 found on system at:
[2m[mockery] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[mockery] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[mockery] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[mockery] [mUsing hscolour version 1.25 found on system at:
[2m[mockery] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[mockery] [mNo jhc found
[2m[mockery] [mUsing ld found on system at:
[2m[mockery] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[mockery] [mNo pkg-config found
[2m[mockery] [mUsing runghc version 9.8.1 found on system at:
[2m[mockery] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[mockery] [mUsing strip version 2.44 found on system at:
[2m[mockery] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[mockery] [mUsing tar found on system at:
[2m[mockery] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[mockery] [mNo uhc found
[2m[ansi-wl-pprint] [mPreprocessing library for ansi-wl-pprint-1.0.2..
[2m[ansi-wl-pprint] [mBuilding library for ansi-wl-pprint-1.0.2..
[2m[silently] [mSource component graph:
[2m[silently] [m    component test:spec-generic
[2m[silently] [m    component lib
[2m[silently] [m    component test:spec-specific dependency lib
[2m[silently] [mConfigured component graph:
[2m[silently] [m    component silently-1.2.5.4-FLzzp8C869W4c2QjJz98Kd-spec-generic
[2m[silently] [m        include base-4.19.0.0-b960
[2m[silently] [m        include deepseq-1.5.0.0-412f
[2m[silently] [m        include directory-1.3.8.1-6a8e
[2m[silently] [m        include nanospec-0.2.2-LPLNzT4nYk5D69jrclRloW
[2m[silently] [m        include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[silently] [m    component silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m        include base-4.19.0.0-b960
[2m[silently] [m        include deepseq-1.5.0.0-412f
[2m[silently] [m        include directory-1.3.8.1-6a8e
[2m[silently] [m    component silently-1.2.5.4-8Uzy5C3R3rTJ96WjJcXJVM-spec-specific
[2m[silently] [m        include base-4.19.0.0-b960
[2m[silently] [m        include directory-1.3.8.1-6a8e
[2m[silently] [m        include nanospec-0.2.2-LPLNzT4nYk5D69jrclRloW
[2m[silently] [m        include silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m        include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[silently] [mLinked component graph:
[2m[silently] [m    unit silently-1.2.5.4-FLzzp8C869W4c2QjJz98Kd-spec-generic
[2m[silently] [m        include base-4.19.0.0-b960
[2m[silently] [m        include deepseq-1.5.0.0-412f
[2m[silently] [m        include directory-1.3.8.1-6a8e
[2m[silently] [m        include nanospec-0.2.2-LPLNzT4nYk5D69jrclRloW
[2m[silently] [m        include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[silently] [m    unit silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m        include base-4.19.0.0-b960
[2m[silently] [m        include deepseq-1.5.0.0-412f
[2m[silently] [m        include directory-1.3.8.1-6a8e
[2m[silently] [m        System.IO.Silently=silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT:System.IO.Silently
[2m[silently] [m    unit silently-1.2.5.4-8Uzy5C3R3rTJ96WjJcXJVM-spec-specific
[2m[silently] [m        include base-4.19.0.0-b960
[2m[silently] [m        include directory-1.3.8.1-6a8e
[2m[silently] [m        include nanospec-0.2.2-LPLNzT4nYk5D69jrclRloW
[2m[silently] [m        include silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m        include temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[silently] [mReady component graph:
[2m[silently] [m    definite silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m        depends base-4.19.0.0-b960
[2m[silently] [m        depends deepseq-1.5.0.0-412f
[2m[silently] [m        depends directory-1.3.8.1-6a8e
[2m[silently] [m    definite silently-1.2.5.4-FLzzp8C869W4c2QjJz98Kd-spec-generic
[2m[silently] [m        depends base-4.19.0.0-b960
[2m[silently] [m        depends deepseq-1.5.0.0-412f
[2m[silently] [m        depends directory-1.3.8.1-6a8e
[2m[silently] [m        depends nanospec-0.2.2-LPLNzT4nYk5D69jrclRloW
[2m[silently] [m        depends temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[silently] [m    definite silently-1.2.5.4-8Uzy5C3R3rTJ96WjJcXJVM-spec-specific
[2m[silently] [m        depends base-4.19.0.0-b960
[2m[silently] [m        depends directory-1.3.8.1-6a8e
[2m[silently] [m        depends nanospec-0.2.2-LPLNzT4nYk5D69jrclRloW
[2m[silently] [m        depends silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m        depends temporary-1.3-6LDbtKZIJMrKol9xVw5U4b
[2m[silently] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[silently] [mUsing compiler: ghc-9.8.1
[2m[silently] [mUsing install prefix:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4
[2m[silently] [mExecutables installed in:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/bin
[2m[silently] [mLibraries installed in:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [mDynamic Libraries installed in:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[silently] [mPrivate executables installed in:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/libexec/x86_64-linux-ghc-9.8.1/silently-1.2.5.4
[2m[silently] [mData files installed in:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/share/x86_64-linux-ghc-9.8.1/silently-1.2.5.4
[2m[silently] [mDocumentation installed in:
[2m[silently] [m/nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc/share/doc/silently-1.2.5.4
[2m[silently] [mConfiguration files installed in:
[2m[silently] [m/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/etc
[2m[silently] [mNo alex found
[2m[silently] [mUsing ar found on system at:
[2m[silently] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[silently] [mNo c2hs found
[2m[silently] [mNo cpphs found
[2m[silently] [mNo doctest found
[2m[silently] [mUsing gcc version 14.3.0 given by user at:
[2m[silently] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[silently] [mUsing ghc version 9.8.1 found on system at:
[2m[silently] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[silently] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[silently] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[silently] [mNo ghcjs found
[2m[silently] [mNo ghcjs-pkg found
[2m[silently] [mNo greencard found
[2m[silently] [mUsing haddock version 2.30.0 found on system at:
[2m[silently] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[silently] [mNo happy found
[2m[silently] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[silently] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[silently] [mNo hmake found
[2m[silently] [mUsing hpc version 0.69 found on system at:
[2m[silently] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[silently] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[silently] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[silently] [mUsing hscolour version 1.25 found on system at:
[2m[silently] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[silently] [mNo jhc found
[2m[silently] [mUsing ld found on system at:
[2m[silently] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[silently] [mNo pkg-config found
[2m[silently] [mUsing runghc version 9.8.1 found on system at:
[2m[silently] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[silently] [mUsing strip version 2.44 found on system at:
[2m[silently] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[silently] [mUsing tar found on system at:
[2m[silently] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[silently] [mNo uhc found
[2m[ansi-wl-pprint] [m[1 of 1] Compiling Text.PrettyPrint.ANSI.Leijen ( Text/PrettyPrint/ANSI/Leijen.hs, dist/build/Text/PrettyPrint/ANSI/Leijen.o, dist/build/Text/PrettyPrint/ANSI/Leijen.dyn_o )
[2m[mockery] [m[1;36mPhase: buildPhase[m
[2m[ansi-wl-pprint] [m
[2m[ansi-wl-pprint] [m[;1mText/PrettyPrint/ANSI/Leijen.hs:165:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-15328[0m[0m[;1m] [[;1m[35m-Wdeprecations[0m[0m[;1m][0m[0m[;1m
[2m[ansi-wl-pprint] [m    Module ‘Text.PrettyPrint.ANSI.Leijen’ is deprecated:
[2m[ansi-wl-pprint] [m      "Compatibility module for users of ansi-wl-pprint - use \"Prettyprinter\" instead"[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m    |[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m165 |[0m[0m [;1m[35mimport "prettyprinter-compat-ansi-wl-pprint"  Text.PrettyPrint.ANSI.Leijen[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[silently] [m[1;36mPhase: buildPhase[m
[2m[mockery] [mPreprocessing library for mockery-0.3.5..
[2m[mockery] [mBuilding library for mockery-0.3.5..
[2m[silently] [mPreprocessing library for silently-1.2.5.4..
[2m[silently] [mBuilding library for silently-1.2.5.4..
[2m[ansi-wl-pprint] [m[1 of 1] Compiling Text.PrettyPrint.ANSI.Leijen ( Text/PrettyPrint/ANSI/Leijen.hs, dist/build/Text/PrettyPrint/ANSI/Leijen.p_o )
[2m[mockery] [m[1 of 4] Compiling Paths_mockery    ( dist/build/autogen/Paths_mockery.hs, dist/build/Paths_mockery.o, dist/build/Paths_mockery.dyn_o )
[2m[ansi-wl-pprint] [m
[2m[ansi-wl-pprint] [m[;1mText/PrettyPrint/ANSI/Leijen.hs:165:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-15328[0m[0m[;1m] [[;1m[35m-Wdeprecations[0m[0m[;1m][0m[0m[;1m
[2m[ansi-wl-pprint] [m    Module ‘Text.PrettyPrint.ANSI.Leijen’ is deprecated:
[2m[ansi-wl-pprint] [m      "Compatibility module for users of ansi-wl-pprint - use \"Prettyprinter\" instead"[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m    |[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m165 |[0m[0m [;1m[35mimport "prettyprinter-compat-ansi-wl-pprint"  Text.PrettyPrint.ANSI.Leijen[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[silently] [m[1 of 1] Compiling System.IO.Silently ( src/System/IO/Silently.hs, dist/build/System/IO/Silently.o, dist/build/System/IO/Silently.dyn_o )
[2m[mockery] [m[2 of 4] Compiling Test.Mockery.Directory ( src/Test/Mockery/Directory.hs, dist/build/Test/Mockery/Directory.o, dist/build/Test/Mockery/Directory.dyn_o )
[2m[mockery] [m[3 of 4] Compiling Test.Mockery.Environment ( src/Test/Mockery/Environment.hs, dist/build/Test/Mockery/Environment.o, dist/build/Test/Mockery/Environment.dyn_o )
[2m[mockery] [m[4 of 4] Compiling Test.Mockery.Logging ( src/Test/Mockery/Logging.hs, dist/build/Test/Mockery/Logging.o, dist/build/Test/Mockery/Logging.dyn_o )
[2m[mockery] [m[1 of 4] Compiling Paths_mockery    ( dist/build/autogen/Paths_mockery.hs, dist/build/Paths_mockery.p_o )
[2m[silently] [m[1 of 1] Compiling System.IO.Silently ( src/System/IO/Silently.hs, dist/build/System/IO/Silently.p_o )
[2m[mockery] [m[2 of 4] Compiling Test.Mockery.Directory ( src/Test/Mockery/Directory.hs, dist/build/Test/Mockery/Directory.p_o )
[2m[mockery] [m[3 of 4] Compiling Test.Mockery.Environment ( src/Test/Mockery/Environment.hs, dist/build/Test/Mockery/Environment.p_o )
[2m[mockery] [m[4 of 4] Compiling Test.Mockery.Logging ( src/Test/Mockery/Logging.hs, dist/build/Test/Mockery/Logging.p_o )
[2m[ansi-wl-pprint] [m[1;36mPhase: checkPhase[m
[2m[ansi-wl-pprint] [mPackage has no test suites.
[2m[ansi-wl-pprint] [m[1;36mPhase: haddockPhase[m
[2m[ansi-wl-pprint] [mPreprocessing library for ansi-wl-pprint-1.0.2..
[2m[ansi-wl-pprint] [mRunning Haddock on library for ansi-wl-pprint-1.0.2..
[2m[ansi-wl-pprint] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[ansi-wl-pprint] [m[1 of 1] Compiling Text.PrettyPrint.ANSI.Leijen ( Text/PrettyPrint/ANSI/Leijen.hs, nothing )
[2m[ansi-wl-pprint] [m
[2m[ansi-wl-pprint] [m[;1mText/PrettyPrint/ANSI/Leijen.hs:165:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-15328[0m[0m[;1m] [[;1m[35m-Wdeprecations[0m[0m[;1m][0m[0m[;1m
[2m[ansi-wl-pprint] [m    Module ‘Text.PrettyPrint.ANSI.Leijen’ is deprecated:
[2m[ansi-wl-pprint] [m      "Compatibility module for users of ansi-wl-pprint - use \"Prettyprinter\" instead"[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m    |[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m165 |[0m[0m [;1m[35mimport "prettyprinter-compat-ansi-wl-pprint"  Text.PrettyPrint.ANSI.Leijen[0m[0m
[2m[ansi-wl-pprint] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[ansi-wl-pprint] [mHaddock coverage:
[2m[ansi-wl-pprint] [mWarning: 'String' is out of scope.
[2m[ansi-wl-pprint] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[ansi-wl-pprint] [m  18% ( 26 /141) in 'Text.PrettyPrint.ANSI.Leijen'
[2m[ansi-wl-pprint] [m  Missing documentation for:
[2m[ansi-wl-pprint] [m    Doc
[2m[ansi-wl-pprint] [m    empty
[2m[ansi-wl-pprint] [m    char
[2m[ansi-wl-pprint] [m    text
[2m[ansi-wl-pprint] [m    string
[2m[ansi-wl-pprint] [m    int
[2m[ansi-wl-pprint] [m    integer
[2m[ansi-wl-pprint] [m    float
[2m[ansi-wl-pprint] [m    double
[2m[ansi-wl-pprint] [m    rational
[2m[ansi-wl-pprint] [m    bool
[2m[ansi-wl-pprint] [m    nest
[2m[ansi-wl-pprint] [m    line
[2m[ansi-wl-pprint] [m    linebreak
[2m[ansi-wl-pprint] [m    group
[2m[ansi-wl-pprint] [m    softline
[2m[ansi-wl-pprint] [m    softbreak
[2m[ansi-wl-pprint] [m    hardline
[2m[ansi-wl-pprint] [m    flatAlt
[2m[ansi-wl-pprint] [m    align
[2m[ansi-wl-pprint] [m    hang
[2m[ansi-wl-pprint] [m    indent
[2m[ansi-wl-pprint] [m    encloseSep
[2m[ansi-wl-pprint] [m    list
[2m[ansi-wl-pprint] [m    tupled
[2m[ansi-wl-pprint] [m    semiBraces
[2m[ansi-wl-pprint] [m    <+>
[2m[ansi-wl-pprint] [m    <$>
[2m[ansi-wl-pprint] [m    </>
[2m[ansi-wl-pprint] [m    <$$>
[2m[ansi-wl-pprint] [m    <//>
[2m[ansi-wl-pprint] [m    hsep
[2m[ansi-wl-pprint] [m    vsep
[2m[ansi-wl-pprint] [m    fillSep
[2m[ansi-wl-pprint] [m    sep
[2m[ansi-wl-pprint] [m    hcat
[2m[ansi-wl-pprint] [m    vcat
[2m[ansi-wl-pprint] [m    fillCat
[2m[ansi-wl-pprint] [m    cat
[2m[ansi-wl-pprint] [m    punctuate
[2m[ansi-wl-pprint] [m    fill
[2m[ansi-wl-pprint] [m    fillBreak
[2m[ansi-wl-pprint] [m    enclose
[2m[ansi-wl-pprint] [m    squotes
[2m[ansi-wl-pprint] [m    dquotes
[2m[ansi-wl-pprint] [m    parens
[2m[ansi-wl-pprint] [m    angles
[2m[ansi-wl-pprint] [m    braces
[2m[ansi-wl-pprint] [m    brackets
[2m[ansi-wl-pprint] [m    lparen
[2m[ansi-wl-pprint] [m    rparen
[2m[ansi-wl-pprint] [m    langle
[2m[ansi-wl-pprint] [m    rangle
[2m[ansi-wl-pprint] [m    lbrace
[2m[ansi-wl-pprint] [m    rbrace
[2m[ansi-wl-pprint] [m    lbracket
[2m[ansi-wl-pprint] [m    rbracket
[2m[ansi-wl-pprint] [m    squote
[2m[ansi-wl-pprint] [m    dquote
[2m[ansi-wl-pprint] [m    semi
[2m[ansi-wl-pprint] [m    colon
[2m[ansi-wl-pprint] [m    comma
[2m[ansi-wl-pprint] [m    space
[2m[ansi-wl-pprint] [m    dot
[2m[ansi-wl-pprint] [m    backslash
[2m[ansi-wl-pprint] [m    equals
[2m[ansi-wl-pprint] [m    black
[2m[ansi-wl-pprint] [m    red
[2m[ansi-wl-pprint] [m    green
[2m[ansi-wl-pprint] [m    yellow
[2m[ansi-wl-pprint] [m    blue
[2m[ansi-wl-pprint] [m    magenta
[2m[ansi-wl-pprint] [m    cyan
[2m[ansi-wl-pprint] [m    white
[2m[ansi-wl-pprint] [m    dullblack
[2m[ansi-wl-pprint] [m    dullred
[2m[ansi-wl-pprint] [m    dullgreen
[2m[ansi-wl-pprint] [m    dullyellow
[2m[ansi-wl-pprint] [m    dullblue
[2m[ansi-wl-pprint] [m    dullmagenta
[2m[ansi-wl-pprint] [m    dullcyan
[2m[ansi-wl-pprint] [m    dullwhite
[2m[ansi-wl-pprint] [m    onblack
[2m[ansi-wl-pprint] [m    onred
[2m[ansi-wl-pprint] [m    ongreen
[2m[ansi-wl-pprint] [m    onyellow
[2m[ansi-wl-pprint] [m    onblue
[2m[ansi-wl-pprint] [m    onmagenta
[2m[ansi-wl-pprint] [m    oncyan
[2m[ansi-wl-pprint] [m    onwhite
[2m[ansi-wl-pprint] [m    ondullblack
[2m[ansi-wl-pprint] [m    ondullred
[2m[ansi-wl-pprint] [m    ondullgreen
[2m[ansi-wl-pprint] [m    ondullyellow
[2m[ansi-wl-pprint] [m    ondullblue
[2m[ansi-wl-pprint] [m    ondullmagenta
[2m[ansi-wl-pprint] [m    ondullcyan
[2m[ansi-wl-pprint] [m    ondullwhite
[2m[ansi-wl-pprint] [m    bold
[2m[ansi-wl-pprint] [m    debold
[2m[ansi-wl-pprint] [m    underline
[2m[ansi-wl-pprint] [m    deunderline
[2m[ansi-wl-pprint] [m    plain
[2m[ansi-wl-pprint] [m    SimpleDoc
[2m[ansi-wl-pprint] [m    renderPretty
[2m[ansi-wl-pprint] [m    renderCompact
[2m[ansi-wl-pprint] [m    renderSmart
[2m[ansi-wl-pprint] [m    displayS
[2m[ansi-wl-pprint] [m    displayIO
[2m[ansi-wl-pprint] [m    putDoc
[2m[ansi-wl-pprint] [m    hPutDoc
[2m[ansi-wl-pprint] [m    column
[2m[ansi-wl-pprint] [m    columns
[2m[ansi-wl-pprint] [m    nesting
[2m[ansi-wl-pprint] [m    width
[2m[silently] [mPreprocessing test suite 'spec-generic' for silently-1.2.5.4..
[2m[silently] [mBuilding test suite 'spec-generic' for silently-1.2.5.4..
[2m[silently] [m[1 of 2] Compiling System.IO.Silently ( src/System/IO/Silently.hs, dist/build/spec-generic/spec-generic-tmp/System/IO/Silently.o )
[2m[mockery] [m[1;36mPhase: haddockPhase[m
[2m[silently] [m[2 of 2] Compiling Main             ( test/Spec.hs, dist/build/spec-generic/spec-generic-tmp/Main.o )
[2m[mockery] [mPreprocessing library for mockery-0.3.5..
[2m[mockery] [mRunning Haddock on library for mockery-0.3.5..
[2m[mockery] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[silently] [m[3 of 3] Linking dist/build/spec-generic/spec-generic
[2m[mockery] [m[1 of 4] Compiling Paths_mockery    ( dist/build/autogen/Paths_mockery.hs, nothing )
[2m[mockery] [m[2 of 4] Compiling Test.Mockery.Directory ( src/Test/Mockery/Directory.hs, nothing )
[2m[mockery] [m[3 of 4] Compiling Test.Mockery.Environment ( src/Test/Mockery/Environment.hs, nothing )
[2m[mockery] [m[4 of 4] Compiling Test.Mockery.Logging ( src/Test/Mockery/Logging.hs, nothing )
[2m[mockery] [mHaddock coverage:
[2m[mockery] [m  80% (  4 /  5) in 'Test.Mockery.Directory'
[2m[mockery] [m  Missing documentation for:
[2m[mockery] [m    Module header
[2m[mockery] [m  66% (  2 /  3) in 'Test.Mockery.Environment'
[2m[mockery] [m  Missing documentation for:
[2m[mockery] [m    Module header
[2m[mockery] [mWarning: 'captureLogsMessages' is out of scope.
[2m[mockery] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[mockery] [m  50% (  2 /  4) in 'Test.Mockery.Logging'
[2m[mockery] [m  Missing documentation for:
[2m[mockery] [m    Module header
[2m[mockery] [m    LogLevel
[2m[silently] [mPreprocessing test suite 'spec-specific' for silently-1.2.5.4..
[2m[silently] [mBuilding test suite 'spec-specific' for silently-1.2.5.4..
[2m[silently] [m[1 of 1] Compiling Main             ( test/Spec.hs, dist/build/spec-specific/spec-specific-tmp/Main.o )
[2m[silently] [m[2 of 2] Linking dist/build/spec-specific/spec-specific
[2m[silently] [m[1;36mPhase: checkPhase[m
[2m[silently] [mRunning 2 test suites...
[2m[silently] [mTest suite spec-generic: RUNNING...
[2m[silently] [m/hSilence/prevents output to a given handle/ OK
[2m[silently] [m/capture/captures stdout/ OK
[2m[silently] [m/hCapture/preserves NoBuffering/ OK
[2m[silently] [m/hCapture/preserves LineBuffering/ OK
[2m[silently] [m/hCapture/preserves BlockBuffering Nothing/ OK
[2m[silently] [m5 example(s), 0 failure(s)
[2m[silently] [mTest suite spec-generic: PASS
[2m[silently] [mTest suite logged to: dist/test/silently-1.2.5.4-spec-generic.log
[2m[silently] [mTest suite spec-specific: RUNNING...
[2m[silently] [m/hSilence/prevents output to a given handle/ OK
[2m[silently] [m/capture/captures stdout/ OK
[2m[silently] [m/hCapture/preserves NoBuffering/ OK
[2m[silently] [m/hCapture/preserves LineBuffering/ OK
[2m[silently] [m/hCapture/preserves BlockBuffering Nothing/ OK
[2m[silently] [m5 example(s), 0 failure(s)
[2m[silently] [mTest suite spec-specific: PASS
[2m[silently] [mTest suite logged to: dist/test/silently-1.2.5.4-spec-specific.log
[2m[silently] [m2 of 2 test suites (2 of 2 test cases) passed.
[2m[silently] [m[1;36mPhase: haddockPhase[m
[2m[silently] [mPreprocessing library for silently-1.2.5.4..
[2m[silently] [mRunning Haddock on library for silently-1.2.5.4..
[2m[silently] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[silently] [m[1 of 1] Compiling System.IO.Silently ( src/System/IO/Silently.hs, nothing )
[2m[silently] [mHaddock coverage:
[2m[silently] [m 100% (  7 /  7) in 'System.IO.Silently'
[2m[ansi-wl-pprint] [mDocumentation created: dist/doc/html/ansi-wl-pprint/,
[2m[ansi-wl-pprint] [mdist/doc/html/ansi-wl-pprint/ansi-wl-pprint.txt
[2m[ansi-wl-pprint] [m[1;36mPhase: installPhase[m
[2m[ansi-wl-pprint] [mInstalling library in /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[ansi-wl-pprint] [m[1;36mPhase: fixupPhase[m
[2m[ansi-wl-pprint] [mshrinking RPATHs of ELF executables and libraries in /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [mshrinking /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS-ghc9.8.1.so
[2m[ansi-wl-pprint] [mchecking for references to /build/ in /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2...
[2m[ansi-wl-pprint] [mpatching script interpreter paths in /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2
[2m[ansi-wl-pprint] [mstripping (with command strip and flags -S -p) in  /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2/lib
[2m[ansi-wl-pprint] [mshrinking RPATHs of ELF executables and libraries in /nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc
[2m[ansi-wl-pprint] [mchecking for references to /build/ in /nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc...
[2m[ansi-wl-pprint] [mpatching script interpreter paths in /nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc
[2m[ansi-wl-pprint:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2 /nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc[m
[2m[ansi-wl-pprint:post-build] [m[2mPushing 2 paths (79 are already present) using zstd to cache sellout ⏳[m
[2m[ansi-wl-pprint:post-build] [m[2m[m
[2m[ansi-wl-pprint:post-build] [m[2mPushing /nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc (431.62 KiB)[m
[2m[ansi-wl-pprint:post-build] [m[2mPushing /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2 (63.71 KiB)[m
[2m[ansi-wl-pprint:post-build] [m[2m[m
[2m[ansi-wl-pprint:post-build] [m[2mAll done.[m
[2m[ansi-wl-pprint:post-build] [m[2mUploading to the NixCI cache: /nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2 /nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc[m
[2m[ansi-wl-pprint:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ansi-wl-pprint:post-build] [m[2mcopying 2 paths...[m
[2m[ansi-wl-pprint:post-build] [m[2mcopying path '/nix/store/fl9yvfa14vfly4kk7y059l9aq83fp6zw-ansi-wl-pprint-1.0.2-doc' to 'https://cache.nix-ci.com'...[m
[2m[ansi-wl-pprint:post-build] [m[2mcopying path '/nix/store/1ycpmnpzmhwvhpbvbxzjbaxvj88q83k0-ansi-wl-pprint-1.0.2' to 'https://cache.nix-ci.com'...[m
[2m[ansi-wl-pprint:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ansi-wl-pprint:post-build] [m[2mcopying 1 paths...[m
[2m[ansi-wl-pprint:post-build] [m[2mcopying path '/nix/store/wqs3nrn6d8wa477i8zwzdn6alwdvb7y3-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 1 of 72 built (2 building)[m
[1;34mBuilding /nix/store/l1y2qyg3frmkh2pz2yylxwzjp1jk30xd-test-framework-0.8.2.2.drv[m
[2m[mockery] [mDocumentation created: dist/doc/html/mockery/,
[2m[mockery] [mdist/doc/html/mockery/mockery.txt
[2m[mockery] [m[1;36mPhase: installPhase[m
[2m[mockery] [mInstalling library in /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[mockery] [m[1;36mPhase: fixupPhase[m
[2m[mockery] [mshrinking RPATHs of ELF executables and libraries in /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5
[2m[mockery] [mshrinking /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSmockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC-ghc9.8.1.so
[2m[mockery] [mchecking for references to /build/ in /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5...
[2m[mockery] [mpatching script interpreter paths in /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5
[2m[mockery] [mstripping (with command strip and flags -S -p) in  /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5/lib
[2m[mockery] [mshrinking RPATHs of ELF executables and libraries in /nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc
[2m[mockery] [mchecking for references to /build/ in /nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc...
[2m[mockery] [mpatching script interpreter paths in /nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc
[2m[silently] [mDocumentation created: dist/doc/html/silently/,
[2m[silently] [mdist/doc/html/silently/silently.txt
[2m[silently] [mPreprocessing test suite 'spec-generic' for silently-1.2.5.4..
[2m[silently] [mPreprocessing test suite 'spec-specific' for silently-1.2.5.4..
[2m[silently] [m[1;36mPhase: installPhase[m
[2m[silently] [mInstalling library in /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
[2m[silently] [m[1;36mPhase: fixupPhase[m
[2m[silently] [mshrinking RPATHs of ELF executables and libraries in /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4
[2m[silently] [mshrinking /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSsilently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT-ghc9.8.1.so
[2m[silently] [mchecking for references to /build/ in /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4...
[2m[silently] [mpatching script interpreter paths in /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4
[2m[silently] [mstripping (with command strip and flags -S -p) in  /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4/lib
[2m[silently] [mshrinking RPATHs of ELF executables and libraries in /nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc
[2m[silently] [mchecking for references to /build/ in /nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc...
[2m[silently] [mpatching script interpreter paths in /nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc
[2m[mockery:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5 /nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc[m
[2m[mockery:post-build] [m[2mPushing 2 paths (78 are already present) using zstd to cache sellout ⏳[m
[2m[mockery:post-build] [m[2m[m
[2m[mockery:post-build] [m[2mPushing /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5 (542.45 KiB)[m
[2m[mockery:post-build] [m[2mPushing /nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc (245.77 KiB)[m
[2m[mockery:post-build] [m[2m[m
[2m[mockery:post-build] [m[2mAll done.[m
[2m[mockery:post-build] [m[2mUploading to the NixCI cache: /nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5 /nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc[m
[2m[mockery:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[mockery:post-build] [m[2mcopying 2 paths...[m
[2m[mockery:post-build] [m[2mcopying path '/nix/store/mpr41gzxa7wwi2zwch5xdvvip28rj86a-mockery-0.3.5-doc' to 'https://cache.nix-ci.com'...[m
[2m[mockery:post-build] [m[2mcopying path '/nix/store/4nzhrp6gclbmjp6jl1prsg0i17s7ikpi-mockery-0.3.5' to 'https://cache.nix-ci.com'...[m
[2m[mockery:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[mockery:post-build] [m[2mcopying 1 paths...[m
[2m[mockery:post-build] [m[2mcopying path '/nix/store/jwqgwhdmk07lrcnlw4z5q3dxmfdqfl50-mockery-0.3.5.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 2 of 71 built (2 building)[m
[2m[silently:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4 /nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc[m
[2m[silently:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[silently:post-build] [m[2m[m
[2m[silently:post-build] [m[2mPushing /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4 (200.84 KiB)[m
[2m[silently:post-build] [m[2mPushing /nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc (178.75 KiB)[m
[2m[silently:post-build] [m[2m[m
[2m[silently:post-build] [m[2mAll done.[m
[2m[silently:post-build] [m[2mUploading to the NixCI cache: /nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4 /nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc[m
[2m[silently:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[silently:post-build] [m[2mcopying 2 paths...[m
[2m[silently:post-build] [m[2mcopying path '/nix/store/npxfcx05p4xr2dnh1w3p85q9gxp55qmm-silently-1.2.5.4-doc' to 'https://cache.nix-ci.com'...[m
[2m[silently:post-build] [m[2mcopying path '/nix/store/a81kwqmn4b8vzz1pqv38j5n2lkd1p40p-silently-1.2.5.4' to 'https://cache.nix-ci.com'...[m
[2m[silently:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[silently:post-build] [m[2mcopying 1 paths...[m
[2m[silently:post-build] [m[2mcopying path '/nix/store/8b2wllamp0dsyr630vf3plvf8d2r5m5x-silently-1.2.5.4.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 3 of 72 built (1 building)[m
[2m[test-framework] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[test-framework] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[test-framework] [m[1;36mPhase: unpackPhase[m
[2m[test-framework] [munpacking source archive /nix/store/jvn8x410nymnkbq9zjq90xzva68v924n-test-framework-0.8.2.2.tar.gz
[2m[test-framework] [msource root is test-framework-0.8.2.2
[2m[test-framework] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "test-framework-0.8.2.2/test/Tests.hs"
[2m[test-framework] [m[1;36mPhase: patchPhase[m
[2m[test-framework] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[test-framework] [msetupCompileFlags: -package-db=/build/tmp.0sLd6TTqUf/setup-package.conf.d -threaded
[2m[test-framework] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.0sLd6TTqUf/Main.o )
[2m[test-framework] [m[2 of 2] Linking Setup
[2m[test-framework] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[test-framework] [m[1;36mPhase: configurePhase[m
[2m[test-framework] [mconfigureFlags: --verbose --prefix=/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc/share/doc/test-framework-0.8.2.2 --with-gcc=gcc --package-db=/build/tmp.0sLd6TTqUf/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[test-framework] [mUsing Parsec parser
[2m[test-framework] [mConfiguring test-framework-0.8.2.2...
[2m[test-framework] [mDependency ansi-terminal >=0.6.3 && <1.2: using ansi-terminal-1.1.2
[2m[test-framework] [mDependency ansi-wl-pprint >=0.6.7 && <1.1: using ansi-wl-pprint-1.0.2
[2m[test-framework] [mDependency base >=4.9 && <5: using base-4.19.0.0
[2m[test-framework] [mDependency containers >=0.5.7 && <1: using containers-0.6.8
[2m[test-framework] [mDependency hostname >=1.0 && <1.1: using hostname-1.0
[2m[test-framework] [mDependency old-locale >=1.0 && <1.1: using old-locale-1.0.0.7
[2m[test-framework] [mDependency random >=1.1 && <1.4: using random-1.2.1.3
[2m[test-framework] [mDependency regex-posix >=0.95.2 && <0.97: using regex-posix-0.96.0.2
[2m[test-framework] [mDependency time >=1.6 && <1.15: using time-1.12.2
[2m[test-framework] [mDependency xml >=1.3.14 && <1.4: using xml-1.3.14
[2m[test-framework] [mSource component graph: component lib
[2m[test-framework] [mConfigured component graph:
[2m[test-framework] [m    component test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[test-framework] [m        include ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[test-framework] [m        include base-4.19.0.0-b960
[2m[test-framework] [m        include containers-0.6.8-4775
[2m[test-framework] [m        include hostname-1.0-GbZNebKyGObKhf11nXk5IG
[2m[test-framework] [m        include old-locale-1.0.0.7-JvGJCesas0h775J4qUxryh
[2m[test-framework] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[test-framework] [m        include regex-posix-0.96.0.2-1sTP9k5P7WIQYaZBb7oG3
[2m[test-framework] [m        include time-1.12.2-d26d
[2m[test-framework] [m        include xml-1.3.14-7cTJsVnLLkXCgHCEPuMfIH
[2m[test-framework] [mLinked component graph:
[2m[test-framework] [m    unit test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[test-framework] [m        include ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[test-framework] [m        include base-4.19.0.0-b960
[2m[test-framework] [m        include containers-0.6.8-4775
[2m[test-framework] [m        include hostname-1.0-GbZNebKyGObKhf11nXk5IG
[2m[test-framework] [m        include old-locale-1.0.0.7-JvGJCesas0h775J4qUxryh
[2m[test-framework] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[test-framework] [m        include regex-posix-0.96.0.2-1sTP9k5P7WIQYaZBb7oG3
[2m[test-framework] [m        include time-1.12.2-d26d
[2m[test-framework] [m        include xml-1.3.14-7cTJsVnLLkXCgHCEPuMfIH
[2m[test-framework] [m        Test.Framework=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework,Test.Framework.Options=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Options,Test.Framework.Providers.API=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Providers.API,Test.Framework.Runners.API=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Runners.API,Test.Framework.Runners.Console=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Runners.Console,Test.Framework.Runners.Options=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Runners.Options,Test.Framework.Runners.TestPattern=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Runners.TestPattern,Test.Framework.Seed=test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm:Test.Framework.Seed
[2m[test-framework] [mReady component graph:
[2m[test-framework] [m    definite test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework] [m        depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[test-framework] [m        depends ansi-wl-pprint-1.0.2-7BlYglJijYAEWtSDtoJjFS
[2m[test-framework] [m        depends base-4.19.0.0-b960
[2m[test-framework] [m        depends containers-0.6.8-4775
[2m[test-framework] [m        depends hostname-1.0-GbZNebKyGObKhf11nXk5IG
[2m[test-framework] [m        depends old-locale-1.0.0.7-JvGJCesas0h775J4qUxryh
[2m[test-framework] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[test-framework] [m        depends regex-posix-0.96.0.2-1sTP9k5P7WIQYaZBb7oG3
[2m[test-framework] [m        depends time-1.12.2-d26d
[2m[test-framework] [m        depends xml-1.3.14-7cTJsVnLLkXCgHCEPuMfIH
[2m[test-framework] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[test-framework] [mUsing compiler: ghc-9.8.1
[2m[test-framework] [mUsing install prefix:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2
[2m[test-framework] [mExecutables installed in:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/bin
[2m[test-framework] [mLibraries installed in:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework] [mDynamic Libraries installed in:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[test-framework] [mPrivate executables installed in:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/libexec/x86_64-linux-ghc-9.8.1/test-framework-0.8.2.2
[2m[test-framework] [mData files installed in:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/share/x86_64-linux-ghc-9.8.1/test-framework-0.8.2.2
[2m[test-framework] [mDocumentation installed in:
[2m[test-framework] [m/nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc/share/doc/test-framework-0.8.2.2
[2m[test-framework] [mConfiguration files installed in:
[2m[test-framework] [m/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/etc
[2m[test-framework] [mNo alex found
[2m[test-framework] [mUsing ar found on system at:
[2m[test-framework] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[test-framework] [mNo c2hs found
[2m[test-framework] [mNo cpphs found
[2m[test-framework] [mNo doctest found
[2m[test-framework] [mUsing gcc version 14.3.0 given by user at:
[2m[test-framework] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[test-framework] [mUsing ghc version 9.8.1 found on system at:
[2m[test-framework] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[test-framework] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[test-framework] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[test-framework] [mNo ghcjs found
[2m[test-framework] [mNo ghcjs-pkg found
[2m[test-framework] [mNo greencard found
[2m[test-framework] [mUsing haddock version 2.30.0 found on system at:
[2m[test-framework] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[test-framework] [mNo happy found
[2m[test-framework] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[test-framework] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[test-framework] [mNo hmake found
[2m[test-framework] [mUsing hpc version 0.69 found on system at:
[2m[test-framework] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[test-framework] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[test-framework] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[test-framework] [mUsing hscolour version 1.25 found on system at:
[2m[test-framework] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[test-framework] [mNo jhc found
[2m[test-framework] [mUsing ld found on system at:
[2m[test-framework] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[test-framework] [mNo pkg-config found
[2m[test-framework] [mUsing runghc version 9.8.1 found on system at:
[2m[test-framework] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[test-framework] [mUsing strip version 2.44 found on system at:
[2m[test-framework] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[test-framework] [mUsing tar found on system at:
[2m[test-framework] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[test-framework] [mNo uhc found
[2m[test-framework] [m[1;36mPhase: buildPhase[m
[2m[test-framework] [mPreprocessing library for test-framework-0.8.2.2..
[2m[test-framework] [mBuilding library for test-framework-0.8.2.2..
[2m[test-framework] [m[ 1 of 24] Compiling Test.Framework.Improving ( src/Test/Framework/Improving.hs, dist/build/Test/Framework/Improving.o, dist/build/Test/Framework/Improving.dyn_o )
[2m[test-framework] [m[ 2 of 24] Compiling Test.Framework.Runners.Console.Colors ( src/Test/Framework/Runners/Console/Colors.hs, dist/build/Test/Framework/Runners/Console/Colors.o, dist/build/Test/Framework/Runners/Console/Colors.dyn_o )
[2m[test-framework] [m[ 3 of 24] Compiling Test.Framework.Runners.Console.ProgressBar ( src/Test/Framework/Runners/Console/ProgressBar.hs, dist/build/Test/Framework/Runners/Console/ProgressBar.o, dist/build/Test/Framework/Runners/Console/ProgressBar.dyn_o )
[2m[test-framework] [m[ 4 of 24] Compiling Test.Framework.Runners.Console.Utilities ( src/Test/Framework/Runners/Console/Utilities.hs, dist/build/Test/Framework/Runners/Console/Utilities.o, dist/build/Test/Framework/Runners/Console/Utilities.dyn_o )
[2m[test-framework] [m[ 5 of 24] Compiling Test.Framework.Runners.Processors ( src/Test/Framework/Runners/Processors.hs, dist/build/Test/Framework/Runners/Processors.o, dist/build/Test/Framework/Runners/Processors.dyn_o )
[2m[test-framework] [m[ 6 of 24] Compiling Test.Framework.Runners.ThreadPool ( src/Test/Framework/Runners/ThreadPool.hs, dist/build/Test/Framework/Runners/ThreadPool.o, dist/build/Test/Framework/Runners/ThreadPool.dyn_o )
[2m[test-framework] [m[ 7 of 24] Compiling Test.Framework.Utilities ( src/Test/Framework/Utilities.hs, dist/build/Test/Framework/Utilities.o, dist/build/Test/Framework/Utilities.dyn_o )
[2m[test-framework] [m[ 8 of 24] Compiling Test.Framework.Seed ( src/Test/Framework/Seed.hs, dist/build/Test/Framework/Seed.o, dist/build/Test/Framework/Seed.dyn_o )
[2m[test-framework] [m[ 9 of 24] Compiling Test.Framework.Runners.TimedConsumption ( src/Test/Framework/Runners/TimedConsumption.hs, dist/build/Test/Framework/Runners/TimedConsumption.o, dist/build/Test/Framework/Runners/TimedConsumption.dyn_o )
[2m[test-framework] [m[10 of 24] Compiling Test.Framework.Runners.TestPattern ( src/Test/Framework/Runners/TestPattern.hs, dist/build/Test/Framework/Runners/TestPattern.o, dist/build/Test/Framework/Runners/TestPattern.dyn_o )
[2m[test-framework] [m[11 of 24] Compiling Test.Framework.Runners.Console.Table ( src/Test/Framework/Runners/Console/Table.hs, dist/build/Test/Framework/Runners/Console/Table.o, dist/build/Test/Framework/Runners/Console/Table.dyn_o )
[2m[test-framework] [m
[2m[test-framework] [m[;1msrc/Test/Framework/Runners/Console/Table.hs:45:73: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[test-framework] [m    In the use of ‘tail’
[2m[test-framework] [m    (imported from Prelude, but defined in GHC.List):
[2m[test-framework] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[test-framework] [m[;1m[34m   |[0m[0m
[2m[test-framework] [m[;1m[34m45 |[0m[0m eitherSideSeperator columns = zipWith (||) (False:column_is_seperator) ([;1m[35mtail[0m[0m column_is_seperator ++ [False])
[2m[test-framework] [m[;1m[34m   |[0m[0m[;1m[35m                                                                         ^^^^[0m[0m
[2m[test-framework] [m[12 of 24] Compiling Test.Framework.Options ( src/Test/Framework/Options.hs, dist/build/Test/Framework/Options.o, dist/build/Test/Framework/Options.dyn_o )
[2m[test-framework] [m[13 of 24] Compiling Test.Framework.Runners.Options ( src/Test/Framework/Runners/Options.hs, dist/build/Test/Framework/Runners/Options.o, dist/build/Test/Framework/Runners/Options.dyn_o )
[2m[test-framework] [m[14 of 24] Compiling Test.Framework.Core ( src/Test/Framework/Core.hs, dist/build/Test/Framework/Core.o, dist/build/Test/Framework/Core.dyn_o )
[2m[test-framework] [m[15 of 24] Compiling Test.Framework.Runners.Core ( src/Test/Framework/Runners/Core.hs, dist/build/Test/Framework/Runners/Core.o, dist/build/Test/Framework/Runners/Core.dyn_o )
[2m[test-framework] [m[16 of 24] Compiling Test.Framework.Runners.XML.JUnitWriter ( src/Test/Framework/Runners/XML/JUnitWriter.hs, dist/build/Test/Framework/Runners/XML/JUnitWriter.o, dist/build/Test/Framework/Runners/XML/JUnitWriter.dyn_o )
[2m[test-framework] [m[17 of 24] Compiling Test.Framework.Runners.Statistics ( src/Test/Framework/Runners/Statistics.hs, dist/build/Test/Framework/Runners/Statistics.o, dist/build/Test/Framework/Runners/Statistics.dyn_o )
[2m[test-framework] [m[18 of 24] Compiling Test.Framework.Runners.XML ( src/Test/Framework/Runners/XML.hs, dist/build/Test/Framework/Runners/XML.o, dist/build/Test/Framework/Runners/XML.dyn_o )
[2m[test-framework] [m[19 of 24] Compiling Test.Framework.Runners.Console.Statistics ( src/Test/Framework/Runners/Console/Statistics.hs, dist/build/Test/Framework/Runners/Console/Statistics.o, dist/build/Test/Framework/Runners/Console/Statistics.dyn_o )
[2m[test-framework] [m[20 of 24] Compiling Test.Framework.Runners.API ( src/Test/Framework/Runners/API.hs, dist/build/Test/Framework/Runners/API.o, dist/build/Test/Framework/Runners/API.dyn_o )
[2m[test-framework] [m[21 of 24] Compiling Test.Framework.Runners.Console.Run ( src/Test/Framework/Runners/Console/Run.hs, dist/build/Test/Framework/Runners/Console/Run.o, dist/build/Test/Framework/Runners/Console/Run.dyn_o )
[2m[test-framework] [m[22 of 24] Compiling Test.Framework.Runners.Console ( src/Test/Framework/Runners/Console.hs, dist/build/Test/Framework/Runners/Console.o, dist/build/Test/Framework/Runners/Console.dyn_o )
[2m[test-framework] [m[23 of 24] Compiling Test.Framework.Providers.API ( src/Test/Framework/Providers/API.hs, dist/build/Test/Framework/Providers/API.o, dist/build/Test/Framework/Providers/API.dyn_o )
[2m[test-framework] [m[24 of 24] Compiling Test.Framework   ( src/Test/Framework.hs, dist/build/Test/Framework.o, dist/build/Test/Framework.dyn_o )
[2m[test-framework] [m[ 1 of 24] Compiling Test.Framework.Improving ( src/Test/Framework/Improving.hs, dist/build/Test/Framework/Improving.p_o )
[2m[test-framework] [m[ 2 of 24] Compiling Test.Framework.Runners.Console.Colors ( src/Test/Framework/Runners/Console/Colors.hs, dist/build/Test/Framework/Runners/Console/Colors.p_o )
[2m[test-framework] [m[ 3 of 24] Compiling Test.Framework.Runners.Console.ProgressBar ( src/Test/Framework/Runners/Console/ProgressBar.hs, dist/build/Test/Framework/Runners/Console/ProgressBar.p_o )
[2m[test-framework] [m[ 4 of 24] Compiling Test.Framework.Runners.Console.Utilities ( src/Test/Framework/Runners/Console/Utilities.hs, dist/build/Test/Framework/Runners/Console/Utilities.p_o )
[2m[test-framework] [m[ 5 of 24] Compiling Test.Framework.Runners.Processors ( src/Test/Framework/Runners/Processors.hs, dist/build/Test/Framework/Runners/Processors.p_o )
[2m[test-framework] [m[ 6 of 24] Compiling Test.Framework.Runners.ThreadPool ( src/Test/Framework/Runners/ThreadPool.hs, dist/build/Test/Framework/Runners/ThreadPool.p_o )
[2m[test-framework] [m[ 7 of 24] Compiling Test.Framework.Utilities ( src/Test/Framework/Utilities.hs, dist/build/Test/Framework/Utilities.p_o )
[2m[test-framework] [m[ 8 of 24] Compiling Test.Framework.Seed ( src/Test/Framework/Seed.hs, dist/build/Test/Framework/Seed.p_o )
[2m[test-framework] [m[ 9 of 24] Compiling Test.Framework.Runners.TimedConsumption ( src/Test/Framework/Runners/TimedConsumption.hs, dist/build/Test/Framework/Runners/TimedConsumption.p_o )
[2m[test-framework] [m[10 of 24] Compiling Test.Framework.Runners.TestPattern ( src/Test/Framework/Runners/TestPattern.hs, dist/build/Test/Framework/Runners/TestPattern.p_o )
[2m[test-framework] [m[11 of 24] Compiling Test.Framework.Runners.Console.Table ( src/Test/Framework/Runners/Console/Table.hs, dist/build/Test/Framework/Runners/Console/Table.p_o )
[2m[test-framework] [m
[2m[test-framework] [m[;1msrc/Test/Framework/Runners/Console/Table.hs:45:73: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[test-framework] [m    In the use of ‘tail’
[2m[test-framework] [m    (imported from Prelude, but defined in GHC.List):
[2m[test-framework] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[test-framework] [m[;1m[34m   |[0m[0m
[2m[test-framework] [m[;1m[34m45 |[0m[0m eitherSideSeperator columns = zipWith (||) (False:column_is_seperator) ([;1m[35mtail[0m[0m column_is_seperator ++ [False])
[2m[test-framework] [m[;1m[34m   |[0m[0m[;1m[35m                                                                         ^^^^[0m[0m
[2m[test-framework] [m[12 of 24] Compiling Test.Framework.Options ( src/Test/Framework/Options.hs, dist/build/Test/Framework/Options.p_o )
[2m[test-framework] [m[13 of 24] Compiling Test.Framework.Runners.Options ( src/Test/Framework/Runners/Options.hs, dist/build/Test/Framework/Runners/Options.p_o )
[2m[test-framework] [m[14 of 24] Compiling Test.Framework.Core ( src/Test/Framework/Core.hs, dist/build/Test/Framework/Core.p_o )
[2m[test-framework] [m[15 of 24] Compiling Test.Framework.Runners.Core ( src/Test/Framework/Runners/Core.hs, dist/build/Test/Framework/Runners/Core.p_o )
[2m[test-framework] [m[16 of 24] Compiling Test.Framework.Runners.XML.JUnitWriter ( src/Test/Framework/Runners/XML/JUnitWriter.hs, dist/build/Test/Framework/Runners/XML/JUnitWriter.p_o )
[2m[test-framework] [m[17 of 24] Compiling Test.Framework.Runners.Statistics ( src/Test/Framework/Runners/Statistics.hs, dist/build/Test/Framework/Runners/Statistics.p_o )
[2m[test-framework] [m[18 of 24] Compiling Test.Framework.Runners.XML ( src/Test/Framework/Runners/XML.hs, dist/build/Test/Framework/Runners/XML.p_o )
[2m[test-framework] [m[19 of 24] Compiling Test.Framework.Runners.Console.Statistics ( src/Test/Framework/Runners/Console/Statistics.hs, dist/build/Test/Framework/Runners/Console/Statistics.p_o )
[2m[test-framework] [m[20 of 24] Compiling Test.Framework.Runners.API ( src/Test/Framework/Runners/API.hs, dist/build/Test/Framework/Runners/API.p_o )
[2m[test-framework] [m[21 of 24] Compiling Test.Framework.Runners.Console.Run ( src/Test/Framework/Runners/Console/Run.hs, dist/build/Test/Framework/Runners/Console/Run.p_o )
[2m[test-framework] [m[22 of 24] Compiling Test.Framework.Runners.Console ( src/Test/Framework/Runners/Console.hs, dist/build/Test/Framework/Runners/Console.p_o )
[2m[test-framework] [m[23 of 24] Compiling Test.Framework.Providers.API ( src/Test/Framework/Providers/API.hs, dist/build/Test/Framework/Providers/API.p_o )
[2m[test-framework] [m[24 of 24] Compiling Test.Framework   ( src/Test/Framework.hs, dist/build/Test/Framework.p_o )
[2m[test-framework] [m[1;36mPhase: haddockPhase[m
[2m[test-framework] [mPreprocessing library for test-framework-0.8.2.2..
[2m[test-framework] [mRunning Haddock on library for test-framework-0.8.2.2..
[2m[test-framework] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[test-framework] [m[ 1 of 24] Compiling Test.Framework.Improving ( src/Test/Framework/Improving.hs, nothing )
[2m[test-framework] [m[ 2 of 24] Compiling Test.Framework.Runners.Console.Colors ( src/Test/Framework/Runners/Console/Colors.hs, nothing )
[2m[test-framework] [m[ 3 of 24] Compiling Test.Framework.Runners.Console.ProgressBar ( src/Test/Framework/Runners/Console/ProgressBar.hs, nothing )
[2m[test-framework] [m[ 4 of 24] Compiling Test.Framework.Runners.Console.Utilities ( src/Test/Framework/Runners/Console/Utilities.hs, nothing )
[2m[test-framework] [m[ 5 of 24] Compiling Test.Framework.Runners.Processors ( src/Test/Framework/Runners/Processors.hs, nothing )
[2m[test-framework] [m[ 6 of 24] Compiling Test.Framework.Runners.ThreadPool ( src/Test/Framework/Runners/ThreadPool.hs, nothing )
[2m[test-framework] [m[ 7 of 24] Compiling Test.Framework.Utilities ( src/Test/Framework/Utilities.hs, nothing )
[2m[test-framework] [m[ 8 of 24] Compiling Test.Framework.Seed ( src/Test/Framework/Seed.hs, nothing )
[2m[test-framework] [m[ 9 of 24] Compiling Test.Framework.Runners.TimedConsumption ( src/Test/Framework/Runners/TimedConsumption.hs, nothing )
[2m[test-framework] [m[10 of 24] Compiling Test.Framework.Runners.TestPattern ( src/Test/Framework/Runners/TestPattern.hs, nothing )
[2m[test-framework] [m[11 of 24] Compiling Test.Framework.Runners.Console.Table ( src/Test/Framework/Runners/Console/Table.hs, nothing )
[2m[test-framework] [m
[2m[test-framework] [m[;1msrc/Test/Framework/Runners/Console/Table.hs:45:73: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[test-framework] [m    In the use of ‘tail’
[2m[test-framework] [m    (imported from Prelude, but defined in GHC.List):
[2m[test-framework] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[test-framework] [m[;1m[34m   |[0m[0m
[2m[test-framework] [m[;1m[34m45 |[0m[0m eitherSideSeperator columns = zipWith (||) (False:column_is_seperator) ([;1m[35mtail[0m[0m column_is_seperator ++ [False])
[2m[test-framework] [m[;1m[34m   |[0m[0m[;1m[35m                                                                         ^^^^[0m[0m
[2m[test-framework] [m[12 of 24] Compiling Test.Framework.Options ( src/Test/Framework/Options.hs, nothing )
[2m[test-framework] [m[13 of 24] Compiling Test.Framework.Runners.Options ( src/Test/Framework/Runners/Options.hs, nothing )
[2m[test-framework] [m[14 of 24] Compiling Test.Framework.Core ( src/Test/Framework/Core.hs, nothing )
[2m[test-framework] [m[15 of 24] Compiling Test.Framework.Runners.Core ( src/Test/Framework/Runners/Core.hs, nothing )
[2m[test-framework] [m[16 of 24] Compiling Test.Framework.Runners.XML.JUnitWriter ( src/Test/Framework/Runners/XML/JUnitWriter.hs, nothing )
[2m[test-framework] [m[17 of 24] Compiling Test.Framework.Runners.Statistics ( src/Test/Framework/Runners/Statistics.hs, nothing )
[2m[test-framework] [m[18 of 24] Compiling Test.Framework.Runners.XML ( src/Test/Framework/Runners/XML.hs, nothing )
[2m[test-framework] [m[19 of 24] Compiling Test.Framework.Runners.Console.Statistics ( src/Test/Framework/Runners/Console/Statistics.hs, nothing )
[2m[test-framework] [m[20 of 24] Compiling Test.Framework.Runners.API ( src/Test/Framework/Runners/API.hs, nothing )
[2m[test-framework] [m[21 of 24] Compiling Test.Framework.Runners.Console.Run ( src/Test/Framework/Runners/Console/Run.hs, nothing )
[2m[test-framework] [m[22 of 24] Compiling Test.Framework.Runners.Console ( src/Test/Framework/Runners/Console.hs, nothing )
[2m[test-framework] [m[23 of 24] Compiling Test.Framework.Providers.API ( src/Test/Framework/Providers/API.hs, nothing )
[2m[test-framework] [m[24 of 24] Compiling Test.Framework   ( src/Test/Framework.hs, nothing )
[2m[test-framework] [mHaddock coverage:
[2m[test-framework] [m  25% (  1 /  4) in 'Test.Framework.Seed'
[2m[test-framework] [m  Missing documentation for:
[2m[test-framework] [m    Module header
[2m[test-framework] [m    Seed (src/Test/Framework/Seed.hs:10)
[2m[test-framework] [m    newStdGenWithKnownSeed (src/Test/Framework/Seed.hs:30)
[2m[test-framework] [m   0% (  0 /  4) in 'Test.Framework.Runners.TestPattern'
[2m[test-framework] [m  Missing documentation for:
[2m[test-framework] [m    Module header
[2m[test-framework] [m    TestPattern (src/Test/Framework/Runners/TestPattern.hs:30)
[2m[test-framework] [m    parseTestPattern (src/Test/Framework/Runners/TestPattern.hs:41)
[2m[test-framework] [m    testPatternMatches (src/Test/Framework/Runners/TestPattern.hs:61)
[2m[test-framework] [m   0% (  0 /  4) in 'Test.Framework.Options'
[2m[test-framework] [m  Missing documentation for:
[2m[test-framework] [m    Module header
[2m[test-framework] [m    TestOptions (src/Test/Framework/Options.hs:10)
[2m[test-framework] [m    CompleteTestOptions (src/Test/Framework/Options.hs:11)
[2m[test-framework] [m    TestOptions' (src/Test/Framework/Options.hs:12)
[2m[test-framework] [mWarning: Test.Framework.Runners.Options: Could not find documentation for exported module: Test.Framework.Runners.Options
[2m[test-framework] [m   0% (  0 /  6) in 'Test.Framework.Runners.Options'
[2m[test-framework] [m  Missing documentation for:
[2m[test-framework] [m    Module header
[2m[test-framework] [m    ColorMode (src/Test/Framework/Runners/Options.hs:13)
[2m[test-framework] [m    RunnerOptions (src/Test/Framework/Runners/Options.hs:15)
[2m[test-framework] [m    RunnerOptions' (src/Test/Framework/Runners/Options.hs:17)
[2m[test-framework] [m    CompleteRunnerOptions (src/Test/Framework/Runners/Options.hs:16)
[2m[test-framework] [m    TestPattern (src/Test/Framework/Runners/TestPattern.hs:30)
[2m[test-framework] [mWarning: 'Test' is ambiguous. It is defined
[2m[test-framework] [m    * at src/Test/Framework/Core.hs:40:13
[2m[test-framework] [m    * at src/Test/Framework/Core.hs:40:1
[2m[test-framework] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework] [m    by specifying the type/value namespace explicitly.
[2m[test-framework] [m    Defaulting to the one defined at src/Test/Framework/Core.hs:40:1
[2m[test-framework] [mWarning: 'Test' is ambiguous. It is defined
[2m[test-framework] [m    * at src/Test/Framework/Core.hs:40:13
[2m[test-framework] [m    * at src/Test/Framework/Core.hs:40:1
[2m[test-framework] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework] [m    by specifying the type/value namespace explicitly.
[2m[test-framework] [m    Defaulting to the one defined at src/Test/Framework/Core.hs:40:1
[2m[test-framework] [mWarning: 'RunDescription' is ambiguous. It is defined
[2m[test-framework] [m    * at src/Test/Framework/Runners/XML/JUnitWriter.hs:23:23
[2m[test-framework] [m    * at src/Test/Framework/Runners/XML/JUnitWriter.hs:23:1
[2m[test-framework] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework] [m    by specifying the type/value namespace explicitly.
[2m[test-framework] [m    Defaulting to the one defined at src/Test/Framework/Runners/XML/JUnitWriter.hs:23:1
[2m[test-framework] [mWarning: 'TestCount' is ambiguous. It is defined
[2m[test-framework] [m    * at src/Test/Framework/Runners/Statistics.hs:17:21
[2m[test-framework] [m    * at src/Test/Framework/Runners/Statistics.hs:17:1
[2m[test-framework] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework] [m    by specifying the type/value namespace explicitly.
[2m[test-framework] [m    Defaulting to the one defined at src/Test/Framework/Runners/Statistics.hs:17:1
[2m[test-framework] [mWarning: 'issueTests' is out of scope.
[2m[test-framework] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[test-framework] [m 100% (  4 /  4) in 'Test.Framework.Runners.API'
[2m[test-framework] [mWarning: 'RunnerOptions' is ambiguous. It is defined
[2m[test-framework] [m    * at src/Test/Framework/Runners/Options.hs:17:25
[2m[test-framework] [m    * at src/Test/Framework/Runners/Options.hs:15:1
[2m[test-framework] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework] [m    by specifying the type/value namespace explicitly.
[2m[test-framework] [m    Defaulting to the one defined at src/Test/Framework/Runners/Options.hs:15:1
[2m[test-framework] [m  75% (  6 /  8) in 'Test.Framework.Runners.Console'
[2m[test-framework] [m  Missing documentation for:
[2m[test-framework] [m    Module header
[2m[test-framework] [m    defaultMain (src/Test/Framework/Runners/Console.hs:115)
[2m[test-framework] [mWarning: 'Test' is ambiguous. It is defined
[2m[test-framework] [m    * at src/Test/Framework/Core.hs:40:13
[2m[test-framework] [m    * at src/Test/Framework/Core.hs:40:1
[2m[test-framework] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework] [m    by specifying the type/value namespace explicitly.
[2m[test-framework] [m    Defaulting to the one defined at src/Test/Framework/Core.hs:40:1
[2m[test-framework] [m  43% ( 16 / 37) in 'Test.Framework.Providers.API'
[2m[test-framework] [m  Missing documentation for:
[2m[test-framework] [m    MutuallyExcluded (src/Test/Framework/Core.hs:63)
[2m[test-framework] [m    liftIO (src/Test/Framework/Improving.hs:76)
[2m[test-framework] [m    :~> (src/Test/Framework/Improving.hs:14)
[2m[test-framework] [m    bimapImproving (src/Test/Framework/Improving.hs:22)
[2m[test-framework] [m    improvingLast (src/Test/Framework/Improving.hs:26)
[2m[test-framework] [m    consumeImproving (src/Test/Framework/Improving.hs:30)
[2m[test-framework] [m    ImprovingIO (src/Test/Framework/Improving.hs:34)
[2m[test-framework] [m    yieldImprovement (src/Test/Framework/Improving.hs:50)
[2m[test-framework] [m    runImprovingIO (src/Test/Framework/Improving.hs:62)
[2m[test-framework] [m    tunnelImprovingIO (src/Test/Framework/Improving.hs:59)
[2m[test-framework] [m    orElse (src/Test/Framework/Utilities.hs:26)
[2m[test-framework] [m    K (src/Test/Framework/Utilities.hs:10)
[2m[test-framework] [m    secondsToMicroseconds (src/Test/Framework/Utilities.hs:14)
[2m[test-framework] [m    microsecondsToPicoseconds (src/Test/Framework/Utilities.hs:17)
[2m[test-framework] [m    listToMaybeLast (src/Test/Framework/Utilities.hs:20)
[2m[test-framework] [m    mappendBy (src/Test/Framework/Utilities.hs:23)
[2m[test-framework] [m    onLeft (src/Test/Framework/Utilities.hs:29)
[2m[test-framework] [m    onRight (src/Test/Framework/Utilities.hs:32)
[2m[test-framework] [m    mapAccumLM (src/Test/Framework/Utilities.hs:51)
[2m[test-framework] [m    padRight (src/Test/Framework/Utilities.hs:58)
[2m[test-framework] [m    dropLast (src/Test/Framework/Utilities.hs:61)
[2m[test-framework] [m 100% ( 12 / 12) in 'Test.Framework'
[2m[test-framework] [mDocumentation created: dist/doc/html/test-framework/,
[2m[test-framework] [mdist/doc/html/test-framework/test-framework.txt
[2m[test-framework] [m[1;36mPhase: installPhase[m
[2m[test-framework] [mInstalling library in /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework] [m[1;36mPhase: fixupPhase[m
[2m[test-framework] [mshrinking RPATHs of ELF executables and libraries in /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2
[2m[test-framework] [mshrinking /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStest-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm-ghc9.8.1.so
[2m[test-framework] [mchecking for references to /build/ in /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2...
[2m[test-framework] [mpatching script interpreter paths in /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2
[2m[test-framework] [mstripping (with command strip and flags -S -p) in  /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2/lib
[2m[test-framework] [mshrinking RPATHs of ELF executables and libraries in /nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc
[2m[test-framework] [mchecking for references to /build/ in /nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc...
[2m[test-framework] [mpatching script interpreter paths in /nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc
[2m[test-framework:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2 /nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc[m
[2m[test-framework:post-build] [m[2mPushing 2 paths (95 are already present) using zstd to cache sellout ⏳[m
[2m[test-framework:post-build] [m[2m[m
[2m[test-framework:post-build] [m[2mPushing /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2 (4.27 MiB)[m
[2m[test-framework:post-build] [m[2mPushing /nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc (1.22 MiB)[m
[2m[test-framework:post-build] [m[2m[m
[2m[test-framework:post-build] [m[2mAll done.[m
[2m[test-framework:post-build] [m[2mUploading to the NixCI cache: /nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2 /nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc[m
[2m[test-framework:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[test-framework:post-build] [m[2mcopying 2 paths...[m
[2m[test-framework:post-build] [m[2mcopying path '/nix/store/ws0j8diz0l59y5nks9gv0isg0wkzdbkp-test-framework-0.8.2.2-doc' to 'https://cache.nix-ci.com'...[m
[2m[test-framework:post-build] [m[2mcopying path '/nix/store/1j5rgy3d77v3f62vw5g5qdaiyrxdg0n0-test-framework-0.8.2.2' to 'https://cache.nix-ci.com'...[m
[2m[test-framework:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[test-framework:post-build] [m[2mcopying 1 paths...[m
[2m[test-framework:post-build] [m[2mcopying path '/nix/store/l1y2qyg3frmkh2pz2yylxwzjp1jk30xd-test-framework-0.8.2.2.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 4 of 70 built[m
[1;34mBuilding /nix/store/aj925bazd0gz4x0sw1z2k5jxgyj7qi35-test-framework-hunit-0.3.0.2.drv[m
[2m[test-framework-hunit] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[test-framework-hunit] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[test-framework-hunit] [m[1;36mPhase: unpackPhase[m
[2m[test-framework-hunit] [munpacking source archive /nix/store/8j6xq1nrhz00xbk1ibxvi8w9kgn58p26-test-framework-hunit-0.3.0.2.tar.gz
[2m[test-framework-hunit] [msource root is test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [msetting SOURCE_DATE_EPOCH to timestamp 1441381336 of file "test-framework-hunit-0.3.0.2/Test/Framework/Providers/HUnit.hs"
[2m[test-framework-hunit] [m[1;36mPhase: patchPhase[m
[2m[test-framework-hunit] [mReplace Cabal file with edited version from mirror://hackage/test-framework-hunit-0.3.0.2/revision/3.cabal.
[2m[test-framework-hunit] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[test-framework-hunit] [msetupCompileFlags: -package-db=/build/tmp.GaIlipTsXo/setup-package.conf.d -threaded
[2m[test-framework-hunit] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.GaIlipTsXo/Main.o )
[2m[test-framework-hunit] [m[2 of 2] Linking Setup
[2m[test-framework-hunit] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[test-framework-hunit] [m[1;36mPhase: configurePhase[m
[2m[test-framework-hunit] [mconfigureFlags: --verbose --prefix=/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc/share/doc/test-framework-hunit-0.3.0.2 --with-gcc=gcc --package-db=/build/tmp.GaIlipTsXo/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[test-framework-hunit] [mUsing Parsec parser
[2m[test-framework-hunit] [mWarning: test-framework-hunit.cabal:33:61: version operators used. To use
[2m[test-framework-hunit] [mversion operators the package needs to specify at least 'cabal-version: >=
[2m[test-framework-hunit] [m1.8'.
[2m[test-framework-hunit] [mWarning: test-framework-hunit.cabal:30:53: version operators used. To use
[2m[test-framework-hunit] [mversion operators the package needs to specify at least 'cabal-version: >=
[2m[test-framework-hunit] [m1.8'.
[2m[test-framework-hunit] [mWarning: test-framework-hunit.cabal:28:73: version operators used. To use
[2m[test-framework-hunit] [mversion operators the package needs to specify at least 'cabal-version: >=
[2m[test-framework-hunit] [m1.8'.
[2m[test-framework-hunit] [mWarning: test-framework-hunit.cabal:28:114: version operators used. To use
[2m[test-framework-hunit] [mversion operators the package needs to specify at least 'cabal-version: >=
[2m[test-framework-hunit] [m1.8'.
[2m[test-framework-hunit] [mConfiguring test-framework-hunit-0.3.0.2...
[2m[test-framework-hunit] [mFlags chosen: base3=False, base4=True
[2m[test-framework-hunit] [mDependency HUnit >=1.2 && <1.7: using HUnit-1.6.2.0
[2m[test-framework-hunit] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[test-framework-hunit] [mDependency extensible-exceptions >=0.1.1 && <0.2.0: using
[2m[test-framework-hunit] [mextensible-exceptions-0.1.1.4
[2m[test-framework-hunit] [mDependency test-framework >=0.2.0: using test-framework-0.8.2.2
[2m[test-framework-hunit] [mSource component graph: component lib
[2m[test-framework-hunit] [mConfigured component graph:
[2m[test-framework-hunit] [m    component test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[test-framework-hunit] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[test-framework-hunit] [m        include base-4.19.0.0-b960
[2m[test-framework-hunit] [m        include extensible-exceptions-0.1.1.4-DescwQrseeb5jgeIAsctUw
[2m[test-framework-hunit] [m        include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework-hunit] [mLinked component graph:
[2m[test-framework-hunit] [m    unit test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[test-framework-hunit] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[test-framework-hunit] [m        include base-4.19.0.0-b960
[2m[test-framework-hunit] [m        include extensible-exceptions-0.1.1.4-DescwQrseeb5jgeIAsctUw
[2m[test-framework-hunit] [m        include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework-hunit] [m        Test.Framework.Providers.HUnit=test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm:Test.Framework.Providers.HUnit
[2m[test-framework-hunit] [mReady component graph:
[2m[test-framework-hunit] [m    definite test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[test-framework-hunit] [m        depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[test-framework-hunit] [m        depends base-4.19.0.0-b960
[2m[test-framework-hunit] [m        depends extensible-exceptions-0.1.1.4-DescwQrseeb5jgeIAsctUw
[2m[test-framework-hunit] [m        depends test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[test-framework-hunit] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[test-framework-hunit] [mUsing compiler: ghc-9.8.1
[2m[test-framework-hunit] [mUsing install prefix:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [mExecutables installed in:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/bin
[2m[test-framework-hunit] [mLibraries installed in:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[test-framework-hunit] [mDynamic Libraries installed in:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[test-framework-hunit] [mPrivate executables installed in:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/libexec/x86_64-linux-ghc-9.8.1/test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [mData files installed in:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/share/x86_64-linux-ghc-9.8.1/test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [mDocumentation installed in:
[2m[test-framework-hunit] [m/nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc/share/doc/test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [mConfiguration files installed in:
[2m[test-framework-hunit] [m/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/etc
[2m[test-framework-hunit] [mNo alex found
[2m[test-framework-hunit] [mUsing ar found on system at:
[2m[test-framework-hunit] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[test-framework-hunit] [mNo c2hs found
[2m[test-framework-hunit] [mNo cpphs found
[2m[test-framework-hunit] [mNo doctest found
[2m[test-framework-hunit] [mUsing gcc version 14.3.0 given by user at:
[2m[test-framework-hunit] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[test-framework-hunit] [mUsing ghc version 9.8.1 found on system at:
[2m[test-framework-hunit] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[test-framework-hunit] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[test-framework-hunit] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[test-framework-hunit] [mNo ghcjs found
[2m[test-framework-hunit] [mNo ghcjs-pkg found
[2m[test-framework-hunit] [mNo greencard found
[2m[test-framework-hunit] [mUsing haddock version 2.30.0 found on system at:
[2m[test-framework-hunit] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[test-framework-hunit] [mNo happy found
[2m[test-framework-hunit] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[test-framework-hunit] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[test-framework-hunit] [mNo hmake found
[2m[test-framework-hunit] [mUsing hpc version 0.69 found on system at:
[2m[test-framework-hunit] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[test-framework-hunit] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[test-framework-hunit] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[test-framework-hunit] [mUsing hscolour version 1.25 found on system at:
[2m[test-framework-hunit] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[test-framework-hunit] [mNo jhc found
[2m[test-framework-hunit] [mUsing ld found on system at:
[2m[test-framework-hunit] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[test-framework-hunit] [mNo pkg-config found
[2m[test-framework-hunit] [mUsing runghc version 9.8.1 found on system at:
[2m[test-framework-hunit] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[test-framework-hunit] [mUsing strip version 2.44 found on system at:
[2m[test-framework-hunit] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[test-framework-hunit] [mUsing tar found on system at:
[2m[test-framework-hunit] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[test-framework-hunit] [mNo uhc found
[2m[test-framework-hunit] [m[1;36mPhase: buildPhase[m
[2m[test-framework-hunit] [mPreprocessing library for test-framework-hunit-0.3.0.2..
[2m[test-framework-hunit] [mBuilding library for test-framework-hunit-0.3.0.2..
[2m[test-framework-hunit] [m[1 of 1] Compiling Test.Framework.Providers.HUnit ( Test/Framework/Providers/HUnit.hs, dist/build/Test/Framework/Providers/HUnit.o, dist/build/Test/Framework/Providers/HUnit.dyn_o )
[2m[test-framework-hunit] [m[1 of 1] Compiling Test.Framework.Providers.HUnit ( Test/Framework/Providers/HUnit.hs, dist/build/Test/Framework/Providers/HUnit.p_o )
[2m[test-framework-hunit] [m[1;36mPhase: checkPhase[m
[2m[test-framework-hunit] [mPackage has no test suites.
[2m[test-framework-hunit] [m[1;36mPhase: haddockPhase[m
[2m[test-framework-hunit] [mPreprocessing library for test-framework-hunit-0.3.0.2..
[2m[test-framework-hunit] [mRunning Haddock on library for test-framework-hunit-0.3.0.2..
[2m[test-framework-hunit] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[test-framework-hunit] [m[1 of 1] Compiling Test.Framework.Providers.HUnit ( Test/Framework/Providers/HUnit.hs, nothing )
[2m[test-framework-hunit] [mHaddock coverage:
[2m[test-framework-hunit] [mWarning: 'Test' is ambiguous. It is defined
[2m[test-framework-hunit] [m    * in ‘Test.HUnit.Base’
[2m[test-framework-hunit] [m    * in ‘Test.Framework.Core’
[2m[test-framework-hunit] [m    * in ‘Test.Framework.Core’
[2m[test-framework-hunit] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[test-framework-hunit] [m    by specifying the type/value namespace explicitly.
[2m[test-framework-hunit] [m    Defaulting to the one defined in ‘Test.Framework.Core’
[2m[test-framework-hunit] [m 100% (  3 /  3) in 'Test.Framework.Providers.HUnit'
[2m[test-framework-hunit] [mDocumentation created: dist/doc/html/test-framework-hunit/,
[2m[test-framework-hunit] [mdist/doc/html/test-framework-hunit/test-framework-hunit.txt
[2m[test-framework-hunit] [m[1;36mPhase: installPhase[m
[2m[test-framework-hunit] [mInstalling library in /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[test-framework-hunit] [m[1;36mPhase: fixupPhase[m
[2m[test-framework-hunit] [mshrinking RPATHs of ELF executables and libraries in /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [mshrinking /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStest-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm-ghc9.8.1.so
[2m[test-framework-hunit] [mchecking for references to /build/ in /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2...
[2m[test-framework-hunit] [mpatching script interpreter paths in /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2
[2m[test-framework-hunit] [mstripping (with command strip and flags -S -p) in  /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2/lib
[2m[test-framework-hunit] [mshrinking RPATHs of ELF executables and libraries in /nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc
[2m[test-framework-hunit] [mchecking for references to /build/ in /nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc...
[2m[test-framework-hunit] [mpatching script interpreter paths in /nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc
[2m[test-framework-hunit:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2 /nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc[m
[2m[test-framework-hunit:post-build] [m[2mPushing 2 paths (103 are already present) using zstd to cache sellout ⏳[m
[2m[test-framework-hunit:post-build] [m[2m[m
[2m[test-framework-hunit:post-build] [m[2mPushing /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2 (262.35 KiB)[m
[2m[test-framework-hunit:post-build] [m[2mPushing /nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc (156.77 KiB)[m
[2m[test-framework-hunit:post-build] [m[2m[m
[2m[test-framework-hunit:post-build] [m[2mAll done.[m
[2m[test-framework-hunit:post-build] [m[2mUploading to the NixCI cache: /nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2 /nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc[m
[2m[test-framework-hunit:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[test-framework-hunit:post-build] [m[2mcopying 2 paths...[m
[2m[test-framework-hunit:post-build] [m[2mcopying path '/nix/store/qvc0kwhxzynmcd93y3snvqhsxr6gg7n8-test-framework-hunit-0.3.0.2-doc' to 'https://cache.nix-ci.com'...[m
[2m[test-framework-hunit:post-build] [m[2mcopying path '/nix/store/04c8i1vrfhm6lxhrshkrgdz6parhfad0-test-framework-hunit-0.3.0.2' to 'https://cache.nix-ci.com'...[m
[2m[test-framework-hunit:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[test-framework-hunit:post-build] [m[2mcopying 1 paths...[m
[2m[test-framework-hunit:post-build] [m[2mcopying path '/nix/store/aj925bazd0gz4x0sw1z2k5jxgyj7qi35-test-framework-hunit-0.3.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 5 of 70 built[m
[33mWaiting for lock on optparse-applicative-0.18.1.0-doc[m
[33mWaiting for lock on quickcheck-classes-base[m
[33mWaiting for lock on quickcheck-io[m
[1;34mBuilding /nix/store/iba620li3zgp1ipaycx0f31rcndz2wsw-hspec-core-2.11.12.drv[m
[1;34mBuilding /nix/store/h26g0wk67n1ch6afnw4k6y4x5j3j8pag-hspec-meta-2.11.12.drv[m
[2m[hspec-core] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[hspec-core] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[hspec-meta] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[hspec-meta] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[hspec-core] [m[1;36mPhase: unpackPhase[m
[2m[hspec-core] [munpacking source archive /nix/store/0g8h74w9wwz61jmr50bvdbx94xsjgqri-hspec-core-2.11.12.tar.gz
[2m[hspec-core] [msource root is hspec-core-2.11.12
[2m[hspec-core] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "hspec-core-2.11.12/version.yaml"
[2m[hspec-core] [m[1;36mPhase: patchPhase[m
[2m[hspec-meta] [m[1;36mPhase: unpackPhase[m
[2m[hspec-core] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[hspec-core] [msetupCompileFlags: -package-db=/build/tmp.1t4WpbIuVT/setup-package.conf.d -threaded
[2m[hspec-meta] [munpacking source archive /nix/store/7dnb5q8p2rp0gwhjkdxv8ifdbgjpqlqd-hspec-meta-2.11.12.tar.gz
[2m[hspec-meta] [msource root is hspec-meta-2.11.12
[2m[hspec-meta] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "hspec-meta-2.11.12/vendor/stm-2.5.0.1/Control/Concurrent/STM/TMVar.hs"
[2m[hspec-meta] [m[1;36mPhase: patchPhase[m
[2m[hspec-meta] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[hspec-core] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.1t4WpbIuVT/Main.o )
[2m[hspec-meta] [msetupCompileFlags: -package-db=/build/tmp.a6CN0GgxJE/setup-package.conf.d -threaded
[2m[hspec-meta] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.a6CN0GgxJE/Main.o )
[2m[hspec-core] [m[2 of 2] Linking Setup
[2m[hspec-meta] [m[2 of 2] Linking Setup
[2m[hspec-meta] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[hspec-core] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[hspec-meta] [m[1;36mPhase: configurePhase[m
[2m[hspec-core] [m[1;36mPhase: configurePhase[m
[2m[hspec-core] [mconfigureFlags: --verbose --prefix=/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc/share/doc/hspec-core-2.11.12 --with-gcc=gcc --package-db=/build/tmp.1t4WpbIuVT/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[hspec-meta] [mconfigureFlags: --verbose --prefix=/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc/share/doc/hspec-meta-2.11.12 --with-gcc=gcc --package-db=/build/tmp.a6CN0GgxJE/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[hspec-meta] [mUsing Parsec parser
[2m[hspec-meta] [mConfiguring hspec-meta-2.11.12...
[2m[hspec-core] [mUsing Parsec parser
[2m[hspec-core] [mConfiguring hspec-core-2.11.12...
[2m[hspec-core] [mDependency HUnit >=1.6 && <1.7: using HUnit-1.6.2.0
[2m[hspec-core] [mDependency QuickCheck >=2.13.1 && <2.16: using QuickCheck-2.14.3
[2m[hspec-core] [mDependency ansi-terminal >=0.6.2: using ansi-terminal-1.1.2
[2m[hspec-core] [mDependency array: using array-0.5.6.0
[2m[hspec-core] [mDependency base >=4.9.0.0 && <5: using base-4.19.0.0
[2m[hspec-core] [mDependency call-stack >=0.2.0: using call-stack-0.4.0
[2m[hspec-core] [mDependency containers: using containers-0.6.8
[2m[hspec-core] [mDependency deepseq: using deepseq-1.5.0.0
[2m[hspec-core] [mDependency directory: using directory-1.3.8.1
[2m[hspec-core] [mDependency filepath: using filepath-1.4.100.4
[2m[hspec-core] [mDependency haskell-lexer: using haskell-lexer-1.1.2
[2m[hspec-core] [mDependency hspec-expectations >=0.8.4 && <0.8.5: using
[2m[hspec-core] [mhspec-expectations-0.8.4
[2m[hspec-core] [mDependency process: using process-1.6.18.0
[2m[hspec-core] [mDependency quickcheck-io >=0.2.0: using quickcheck-io-0.2.0
[2m[hspec-core] [mDependency random: using random-1.2.1.3
[2m[hspec-core] [mDependency stm >=2.2: using stm-2.5.2.1
[2m[hspec-core] [mDependency tf-random: using tf-random-0.5
[2m[hspec-core] [mDependency time: using time-1.12.2
[2m[hspec-core] [mDependency transformers >=0.2.2.0: using transformers-0.6.1.0
[2m[hspec-meta] [mDependency HUnit >=1.6 && <1.7: using HUnit-1.6.2.0
[2m[hspec-meta] [mDependency QuickCheck >=2.13.1 && <2.16: using QuickCheck-2.14.3
[2m[hspec-meta] [mDependency ansi-terminal >=0.6.2: using ansi-terminal-1.1.2
[2m[hspec-meta] [mDependency array: using array-0.5.6.0
[2m[hspec-meta] [mDependency base >=4.9.0.0 && <5: using base-4.19.0.0
[2m[hspec-meta] [mDependency call-stack >=0.2.0: using call-stack-0.4.0
[2m[hspec-meta] [mDependency containers: using containers-0.6.8
[2m[hspec-meta] [mDependency deepseq: using deepseq-1.5.0.0
[2m[hspec-meta] [mDependency directory: using directory-1.3.8.1
[2m[hspec-meta] [mDependency filepath: using filepath-1.4.100.4
[2m[hspec-meta] [mDependency haskell-lexer: using haskell-lexer-1.1.2
[2m[hspec-meta] [mDependency hspec-expectations >=0.8.4 && <0.8.5: using
[2m[hspec-meta] [mhspec-expectations-0.8.4
[2m[hspec-meta] [mDependency process: using process-1.6.18.0
[2m[hspec-meta] [mDependency quickcheck-io >=0.2.0: using quickcheck-io-0.2.0
[2m[hspec-meta] [mDependency random: using random-1.2.1.3
[2m[hspec-meta] [mDependency stm >=2.2: using stm-2.5.2.1
[2m[hspec-meta] [mDependency tf-random: using tf-random-0.5
[2m[hspec-meta] [mDependency time: using time-1.12.2
[2m[hspec-meta] [mDependency transformers >=0.2.2.0: using transformers-0.6.1.0
[2m[hspec-meta] [mDependency HUnit >=1.6 && <1.7: using HUnit-1.6.2.0
[2m[hspec-meta] [mDependency QuickCheck >=2.13.1 && <2.16: using QuickCheck-2.14.3
[2m[hspec-meta] [mDependency ansi-terminal >=0.6.2: using ansi-terminal-1.1.2
[2m[hspec-meta] [mDependency array: using array-0.5.6.0
[2m[hspec-meta] [mDependency base >=4.9.0.0 && <5: using base-4.19.0.0
[2m[hspec-meta] [mDependency call-stack >=0.2.0: using call-stack-0.4.0
[2m[hspec-meta] [mDependency containers: using containers-0.6.8
[2m[hspec-meta] [mDependency deepseq: using deepseq-1.5.0.0
[2m[hspec-meta] [mDependency directory: using directory-1.3.8.1
[2m[hspec-meta] [mDependency filepath: using filepath-1.4.100.4
[2m[hspec-meta] [mDependency haskell-lexer: using haskell-lexer-1.1.2
[2m[hspec-meta] [mDependency hspec-expectations >=0.8.4 && <0.8.5: using
[2m[hspec-meta] [mhspec-expectations-0.8.4
[2m[hspec-meta] [mDependency process: using process-1.6.18.0
[2m[hspec-meta] [mDependency quickcheck-io >=0.2.0: using quickcheck-io-0.2.0
[2m[hspec-meta] [mDependency random: using random-1.2.1.3
[2m[hspec-meta] [mDependency stm >=2.2: using stm-2.5.2.1
[2m[hspec-meta] [mDependency tf-random: using tf-random-0.5
[2m[hspec-meta] [mDependency time: using time-1.12.2
[2m[hspec-meta] [mDependency transformers >=0.2.2.0: using transformers-0.6.1.0
[2m[hspec-core] [mSource component graph: component lib
[2m[hspec-core] [mConfigured component graph:
[2m[hspec-core] [m    component hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec-core] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-core] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-core] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-core] [m        include array-0.5.6.0-dc89
[2m[hspec-core] [m        include base-4.19.0.0-b960
[2m[hspec-core] [m        include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-core] [m        include containers-0.6.8-4775
[2m[hspec-core] [m        include deepseq-1.5.0.0-412f
[2m[hspec-core] [m        include directory-1.3.8.1-6a8e
[2m[hspec-core] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-core] [m        include haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-core] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-core] [m        include process-1.6.18.0-26fa
[2m[hspec-core] [m        include quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-core] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-core] [m        include stm-2.5.2.1-83fa
[2m[hspec-core] [m        include tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-core] [m        include time-1.12.2-d26d
[2m[hspec-core] [m        include transformers-0.6.1.0-c3ec
[2m[hspec-core] [mLinked component graph:
[2m[hspec-core] [m    unit hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec-core] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-core] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-core] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-core] [m        include array-0.5.6.0-dc89
[2m[hspec-core] [m        include base-4.19.0.0-b960
[2m[hspec-core] [m        include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-core] [m        include containers-0.6.8-4775
[2m[hspec-core] [m        include deepseq-1.5.0.0-412f
[2m[hspec-core] [m        include directory-1.3.8.1-6a8e
[2m[hspec-core] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-core] [m        include haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-core] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-core] [m        include process-1.6.18.0-26fa
[2m[hspec-core] [m        include quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-core] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-core] [m        include stm-2.5.2.1-83fa
[2m[hspec-core] [m        include tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-core] [m        include time-1.12.2-d26d
[2m[hspec-core] [m        include transformers-0.6.1.0-c3ec
[2m[hspec-core] [m        Test.Hspec.Core.Extension=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Extension,Test.Hspec.Core.Extension.Config=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Extension.Config,Test.Hspec.Core.Extension.Item=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Extension.Item,Test.Hspec.Core.Extension.Option=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Extension.Option,Test.Hspec.Core.Extension.Spec=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Extension.Spec,Test.Hspec.Core.Extension.Tree=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Extension.Tree,Test.Hspec.Core.Format=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Format,Test.Hspec.Core.Formatters=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Formatters,Test.Hspec.Core.Formatters.V1=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Formatters.V1,Test.Hspec.Core.Formatters.V2=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Formatters.V2,Test.Hspec.Core.Hooks=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Hooks,Test.Hspec.Core.QuickCheck=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.QuickCheck,Test.Hspec.Core.Runner=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Runner,Test.Hspec.Core.Spec=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Spec,Test.Hspec.Core.Util=hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY:Test.Hspec.Core.Util
[2m[hspec-core] [mReady component graph:
[2m[hspec-core] [m    definite hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec-core] [m        depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-core] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-core] [m        depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-core] [m        depends array-0.5.6.0-dc89
[2m[hspec-core] [m        depends base-4.19.0.0-b960
[2m[hspec-core] [m        depends call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-core] [m        depends containers-0.6.8-4775
[2m[hspec-core] [m        depends deepseq-1.5.0.0-412f
[2m[hspec-core] [m        depends directory-1.3.8.1-6a8e
[2m[hspec-core] [m        depends filepath-1.4.100.4-fa1c
[2m[hspec-core] [m        depends haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-core] [m        depends hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-core] [m        depends process-1.6.18.0-26fa
[2m[hspec-core] [m        depends quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-core] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-core] [m        depends stm-2.5.2.1-83fa
[2m[hspec-core] [m        depends tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-core] [m        depends time-1.12.2-d26d
[2m[hspec-core] [m        depends transformers-0.6.1.0-c3ec
[2m[hspec-core] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[hspec-core] [mUsing compiler: ghc-9.8.1
[2m[hspec-core] [mUsing install prefix:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12
[2m[hspec-core] [mExecutables installed in:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/bin
[2m[hspec-core] [mLibraries installed in:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec-core] [mDynamic Libraries installed in:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[hspec-core] [mPrivate executables installed in:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/libexec/x86_64-linux-ghc-9.8.1/hspec-core-2.11.12
[2m[hspec-core] [mData files installed in:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/share/x86_64-linux-ghc-9.8.1/hspec-core-2.11.12
[2m[hspec-core] [mDocumentation installed in:
[2m[hspec-core] [m/nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc/share/doc/hspec-core-2.11.12
[2m[hspec-core] [mConfiguration files installed in:
[2m[hspec-core] [m/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/etc
[2m[hspec-core] [mNo alex found
[2m[hspec-core] [mUsing ar found on system at:
[2m[hspec-core] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[hspec-core] [mNo c2hs found
[2m[hspec-core] [mNo cpphs found
[2m[hspec-core] [mNo doctest found
[2m[hspec-core] [mUsing gcc version 14.3.0 given by user at:
[2m[hspec-core] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[hspec-core] [mUsing ghc version 9.8.1 found on system at:
[2m[hspec-core] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[hspec-core] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[hspec-core] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[hspec-core] [mNo ghcjs found
[2m[hspec-core] [mNo ghcjs-pkg found
[2m[hspec-core] [mNo greencard found
[2m[hspec-core] [mUsing haddock version 2.30.0 found on system at:
[2m[hspec-core] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[hspec-core] [mNo happy found
[2m[hspec-core] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[hspec-core] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[hspec-core] [mNo hmake found
[2m[hspec-core] [mUsing hpc version 0.69 found on system at:
[2m[hspec-core] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[hspec-core] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[hspec-core] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[hspec-core] [mUsing hscolour version 1.25 found on system at:
[2m[hspec-core] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[hspec-core] [mNo jhc found
[2m[hspec-core] [mUsing ld found on system at:
[2m[hspec-core] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[hspec-core] [mNo pkg-config found
[2m[hspec-core] [mUsing runghc version 9.8.1 found on system at:
[2m[hspec-core] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[hspec-core] [mUsing strip version 2.44 found on system at:
[2m[hspec-core] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[hspec-core] [mUsing tar found on system at:
[2m[hspec-core] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[hspec-core] [mNo uhc found
[2m[hspec-meta] [mSource component graph:
[2m[hspec-meta] [m    component exe:hspec-meta-discover
[2m[hspec-meta] [m    component lib
[2m[hspec-meta] [mConfigured component graph:
[2m[hspec-meta] [m    component hspec-meta-2.11.12-LBQd1l6rmjFEv7A8ir0UoJ-hspec-meta-discover
[2m[hspec-meta] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-meta] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-meta] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-meta] [m        include array-0.5.6.0-dc89
[2m[hspec-meta] [m        include base-4.19.0.0-b960
[2m[hspec-meta] [m        include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-meta] [m        include containers-0.6.8-4775
[2m[hspec-meta] [m        include deepseq-1.5.0.0-412f
[2m[hspec-meta] [m        include directory-1.3.8.1-6a8e
[2m[hspec-meta] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-meta] [m        include haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-meta] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-meta] [m        include process-1.6.18.0-26fa
[2m[hspec-meta] [m        include quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-meta] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-meta] [m        include stm-2.5.2.1-83fa
[2m[hspec-meta] [m        include tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-meta] [m        include time-1.12.2-d26d
[2m[hspec-meta] [m        include transformers-0.6.1.0-c3ec
[2m[hspec-meta] [m    component hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-meta] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-meta] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-meta] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-meta] [m        include array-0.5.6.0-dc89
[2m[hspec-meta] [m        include base-4.19.0.0-b960
[2m[hspec-meta] [m        include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-meta] [m        include containers-0.6.8-4775
[2m[hspec-meta] [m        include deepseq-1.5.0.0-412f
[2m[hspec-meta] [m        include directory-1.3.8.1-6a8e
[2m[hspec-meta] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-meta] [m        include haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-meta] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-meta] [m        include process-1.6.18.0-26fa
[2m[hspec-meta] [m        include quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-meta] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-meta] [m        include stm-2.5.2.1-83fa
[2m[hspec-meta] [m        include tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-meta] [m        include time-1.12.2-d26d
[2m[hspec-meta] [m        include transformers-0.6.1.0-c3ec
[2m[hspec-meta] [mLinked component graph:
[2m[hspec-meta] [m    unit hspec-meta-2.11.12-LBQd1l6rmjFEv7A8ir0UoJ-hspec-meta-discover
[2m[hspec-meta] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-meta] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-meta] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-meta] [m        include array-0.5.6.0-dc89
[2m[hspec-meta] [m        include base-4.19.0.0-b960
[2m[hspec-meta] [m        include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-meta] [m        include containers-0.6.8-4775
[2m[hspec-meta] [m        include deepseq-1.5.0.0-412f
[2m[hspec-meta] [m        include directory-1.3.8.1-6a8e
[2m[hspec-meta] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-meta] [m        include haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-meta] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-meta] [m        include process-1.6.18.0-26fa
[2m[hspec-meta] [m        include quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-meta] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-meta] [m        include stm-2.5.2.1-83fa
[2m[hspec-meta] [m        include tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-meta] [m        include time-1.12.2-d26d
[2m[hspec-meta] [m        include transformers-0.6.1.0-c3ec
[2m[hspec-meta] [m    unit hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-meta] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-meta] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-meta] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-meta] [m        include array-0.5.6.0-dc89
[2m[hspec-meta] [m        include base-4.19.0.0-b960
[2m[hspec-meta] [m        include call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-meta] [m        include containers-0.6.8-4775
[2m[hspec-meta] [m        include deepseq-1.5.0.0-412f
[2m[hspec-meta] [m        include directory-1.3.8.1-6a8e
[2m[hspec-meta] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-meta] [m        include haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-meta] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-meta] [m        include process-1.6.18.0-26fa
[2m[hspec-meta] [m        include quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-meta] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-meta] [m        include stm-2.5.2.1-83fa
[2m[hspec-meta] [m        include tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-meta] [m        include time-1.12.2-d26d
[2m[hspec-meta] [m        include transformers-0.6.1.0-c3ec
[2m[hspec-meta] [m        Test.Hspec.Discover=hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG:Test.Hspec.Discover,Test.Hspec.Meta=hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG:Test.Hspec.Meta
[2m[hspec-meta] [mReady component graph:
[2m[hspec-meta] [m    definite hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-meta] [m        depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-meta] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-meta] [m        depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-meta] [m        depends array-0.5.6.0-dc89
[2m[hspec-meta] [m        depends base-4.19.0.0-b960
[2m[hspec-meta] [m        depends call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-meta] [m        depends containers-0.6.8-4775
[2m[hspec-meta] [m        depends deepseq-1.5.0.0-412f
[2m[hspec-meta] [m        depends directory-1.3.8.1-6a8e
[2m[hspec-meta] [m        depends filepath-1.4.100.4-fa1c
[2m[hspec-meta] [m        depends haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-meta] [m        depends hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-meta] [m        depends process-1.6.18.0-26fa
[2m[hspec-meta] [m        depends quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-meta] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-meta] [m        depends stm-2.5.2.1-83fa
[2m[hspec-meta] [m        depends tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-meta] [m        depends time-1.12.2-d26d
[2m[hspec-meta] [m        depends transformers-0.6.1.0-c3ec
[2m[hspec-meta] [m    definite hspec-meta-2.11.12-LBQd1l6rmjFEv7A8ir0UoJ-hspec-meta-discover
[2m[hspec-meta] [m        depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[hspec-meta] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-meta] [m        depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hspec-meta] [m        depends array-0.5.6.0-dc89
[2m[hspec-meta] [m        depends base-4.19.0.0-b960
[2m[hspec-meta] [m        depends call-stack-0.4.0-KMB1wyYY1PO65qKaGY0Acl
[2m[hspec-meta] [m        depends containers-0.6.8-4775
[2m[hspec-meta] [m        depends deepseq-1.5.0.0-412f
[2m[hspec-meta] [m        depends directory-1.3.8.1-6a8e
[2m[hspec-meta] [m        depends filepath-1.4.100.4-fa1c
[2m[hspec-meta] [m        depends haskell-lexer-1.1.2-Ae6SXIAR2X0DH3RkYNcj6d
[2m[hspec-meta] [m        depends hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec-meta] [m        depends process-1.6.18.0-26fa
[2m[hspec-meta] [m        depends quickcheck-io-0.2.0-5x1butVBK6lBWxxqmVjOfc
[2m[hspec-meta] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hspec-meta] [m        depends stm-2.5.2.1-83fa
[2m[hspec-meta] [m        depends tf-random-0.5-Khgr4naJrlH33a8fRui0z4
[2m[hspec-meta] [m        depends time-1.12.2-d26d
[2m[hspec-meta] [m        depends transformers-0.6.1.0-c3ec
[2m[hspec-meta] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[hspec-meta] [mUsing compiler: ghc-9.8.1
[2m[hspec-meta] [mUsing install prefix:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12
[2m[hspec-meta] [mExecutables installed in:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/bin
[2m[hspec-meta] [mLibraries installed in:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-meta] [mDynamic Libraries installed in:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[hspec-meta] [mPrivate executables installed in:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/libexec/x86_64-linux-ghc-9.8.1/hspec-meta-2.11.12
[2m[hspec-meta] [mData files installed in:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/share/x86_64-linux-ghc-9.8.1/hspec-meta-2.11.12
[2m[hspec-meta] [mDocumentation installed in:
[2m[hspec-meta] [m/nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc/share/doc/hspec-meta-2.11.12
[2m[hspec-meta] [mConfiguration files installed in:
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/etc
[2m[hspec-meta] [mNo alex found
[2m[hspec-meta] [mUsing ar found on system at:
[2m[hspec-meta] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[hspec-meta] [mNo c2hs found
[2m[hspec-meta] [mNo cpphs found
[2m[hspec-meta] [mNo doctest found
[2m[hspec-meta] [mUsing gcc version 14.3.0 given by user at:
[2m[hspec-meta] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[hspec-meta] [mUsing ghc version 9.8.1 found on system at:
[2m[hspec-meta] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[hspec-meta] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[hspec-meta] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[hspec-meta] [mNo ghcjs found
[2m[hspec-meta] [mNo ghcjs-pkg found
[2m[hspec-meta] [mNo greencard found
[2m[hspec-meta] [mUsing haddock version 2.30.0 found on system at:
[2m[hspec-meta] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[hspec-meta] [mNo happy found
[2m[hspec-meta] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[hspec-meta] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[hspec-meta] [mNo hmake found
[2m[hspec-meta] [mUsing hpc version 0.69 found on system at:
[2m[hspec-meta] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[hspec-meta] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[hspec-meta] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[hspec-meta] [mUsing hscolour version 1.25 found on system at:
[2m[hspec-meta] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[hspec-meta] [mNo jhc found
[2m[hspec-meta] [mUsing ld found on system at:
[2m[hspec-meta] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[hspec-meta] [mNo pkg-config found
[2m[hspec-meta] [mUsing runghc version 9.8.1 found on system at:
[2m[hspec-meta] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[hspec-meta] [mUsing strip version 2.44 found on system at:
[2m[hspec-meta] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[hspec-meta] [mUsing tar found on system at:
[2m[hspec-meta] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[hspec-meta] [mNo uhc found
[2m[hspec-core] [m[1;36mPhase: buildPhase[m
[2m[hspec-core] [mPreprocessing library for hspec-core-2.11.12..
[2m[hspec-core] [mBuilding library for hspec-core-2.11.12..
[2m[hspec-meta] [m[1;36mPhase: buildPhase[m
[2m[hspec-meta] [mPreprocessing library for hspec-meta-2.11.12..
[2m[hspec-meta] [mBuilding library for hspec-meta-2.11.12..
[2m[hspec-core] [m[ 1 of 52] Compiling Control.Concurrent.Async ( vendor/Control/Concurrent/Async.hs, dist/build/Control/Concurrent/Async.o, dist/build/Control/Concurrent/Async.dyn_o )
[2m[hspec-meta] [m[ 1 of 58] Compiling Control.Concurrent.Async ( vendor/Control/Concurrent/Async.hs, dist/build/Control/Concurrent/Async.o, dist/build/Control/Concurrent/Async.dyn_o )
[2m[hspec-meta] [m[ 2 of 58] Compiling Data.Algorithm.Diff ( vendor/Data/Algorithm/Diff.hs, dist/build/Data/Algorithm/Diff.o, dist/build/Data/Algorithm/Diff.dyn_o )
[2m[hspec-meta] [m[ 3 of 58] Compiling Paths_hspec_meta ( dist/build/autogen/Paths_hspec_meta.hs, dist/build/Paths_hspec_meta.o, dist/build/Paths_hspec_meta.dyn_o )
[2m[hspec-meta] [m[ 4 of 58] Compiling Test.Hspec.Core.Compat ( hspec-core/src/Test/Hspec/Core/Compat.hs, dist/build/Test/Hspec/Core/Compat.o, dist/build/Test/Hspec/Core/Compat.dyn_o )
[2m[hspec-meta] [m[ 5 of 58] Compiling Test.Hspec.Core.Clock ( hspec-core/src/Test/Hspec/Core/Clock.hs, dist/build/Test/Hspec/Core/Clock.o, dist/build/Test/Hspec/Core/Clock.dyn_o )
[2m[hspec-meta] [m[ 6 of 58] Compiling Test.Hspec.Core.Annotations ( hspec-core/src/Test/Hspec/Core/Annotations.hs, dist/build/Test/Hspec/Core/Annotations.o, dist/build/Test/Hspec/Core/Annotations.dyn_o )
[2m[hspec-meta] [m[ 7 of 58] Compiling NonEmpty         ( hspec-core/src/NonEmpty.hs, dist/build/NonEmpty.o, dist/build/NonEmpty.dyn_o )
[2m[hspec-meta] [m[ 8 of 58] Compiling GetOpt.Declarative.Types ( hspec-core/src/GetOpt/Declarative/Types.hs, dist/build/GetOpt/Declarative/Types.o, dist/build/GetOpt/Declarative/Types.dyn_o )
[2m[hspec-meta] [m[ 9 of 58] Compiling GetOpt.Declarative.Environment ( hspec-core/src/GetOpt/Declarative/Environment.hs, dist/build/GetOpt/Declarative/Environment.o, dist/build/GetOpt/Declarative/Environment.dyn_o )
[2m[hspec-meta] [m[10 of 58] Compiling Test.Hspec.Core.Example.Location ( hspec-core/src/Test/Hspec/Core/Example/Location.hs, dist/build/Test/Hspec/Core/Example/Location.o, dist/build/Test/Hspec/Core/Example/Location.dyn_o )
[2m[hspec-meta] [m[11 of 58] Compiling Test.Hspec.Core.Formatters.Diff ( hspec-core/src/Test/Hspec/Core/Formatters/Diff.hs, dist/build/Test/Hspec/Core/Formatters/Diff.o, dist/build/Test/Hspec/Core/Formatters/Diff.dyn_o )
[2m[hspec-meta] [m[12 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Parser.Parser ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.o, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.dyn_o )
[2m[hspec-meta] [m[13 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Parser ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser.o, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser.dyn_o )
[2m[hspec-meta] [m[14 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Unicode ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Unicode.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Unicode.o, dist/build/Test/Hspec/Core/Formatters/Pretty/Unicode.dyn_o )
[2m[hspec-meta] [m[15 of 58] Compiling Test.Hspec.Core.Formatters.Pretty ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty.hs, dist/build/Test/Hspec/Core/Formatters/Pretty.o, dist/build/Test/Hspec/Core/Formatters/Pretty.dyn_o )
[2m[hspec-meta] [m[16 of 58] Compiling Test.Hspec.Core.Formatters.V1.Free ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Free.hs, dist/build/Test/Hspec/Core/Formatters/V1/Free.o, dist/build/Test/Hspec/Core/Formatters/V1/Free.dyn_o )
[2m[hspec-meta] [m[17 of 58] Compiling Test.Hspec.Core.Runner.JobQueue ( hspec-core/src/Test/Hspec/Core/Runner/JobQueue.hs, dist/build/Test/Hspec/Core/Runner/JobQueue.o, dist/build/Test/Hspec/Core/Runner/JobQueue.dyn_o )
[2m[hspec-meta] [m[18 of 58] Compiling Test.Hspec.Core.Timer ( hspec-core/src/Test/Hspec/Core/Timer.hs, dist/build/Test/Hspec/Core/Timer.o, dist/build/Test/Hspec/Core/Timer.dyn_o )
[2m[hspec-meta] [m[19 of 58] Compiling Test.Hspec.Core.Util ( hspec-core/src/Test/Hspec/Core/Util.hs, dist/build/Test/Hspec/Core/Util.o, dist/build/Test/Hspec/Core/Util.dyn_o )
[2m[hspec-meta] [m[20 of 58] Compiling Test.Hspec.Core.QuickCheck.Util ( hspec-core/src/Test/Hspec/Core/QuickCheck/Util.hs, dist/build/Test/Hspec/Core/QuickCheck/Util.o, dist/build/Test/Hspec/Core/QuickCheck/Util.dyn_o )
[2m[hspec-core] [m[ 2 of 52] Compiling Data.Algorithm.Diff ( vendor/Data/Algorithm/Diff.hs, dist/build/Data/Algorithm/Diff.o, dist/build/Data/Algorithm/Diff.dyn_o )
[2m[hspec-core] [m[ 3 of 52] Compiling Paths_hspec_core ( dist/build/autogen/Paths_hspec_core.hs, dist/build/Paths_hspec_core.o, dist/build/Paths_hspec_core.dyn_o )
[2m[hspec-core] [m[ 4 of 52] Compiling Test.Hspec.Core.Compat ( src/Test/Hspec/Core/Compat.hs, dist/build/Test/Hspec/Core/Compat.o, dist/build/Test/Hspec/Core/Compat.dyn_o )
[2m[hspec-core] [m[ 5 of 52] Compiling Test.Hspec.Core.Clock ( src/Test/Hspec/Core/Clock.hs, dist/build/Test/Hspec/Core/Clock.o, dist/build/Test/Hspec/Core/Clock.dyn_o )
[2m[hspec-core] [m[ 6 of 52] Compiling Test.Hspec.Core.Annotations ( src/Test/Hspec/Core/Annotations.hs, dist/build/Test/Hspec/Core/Annotations.o, dist/build/Test/Hspec/Core/Annotations.dyn_o )
[2m[hspec-core] [m[ 7 of 52] Compiling NonEmpty         ( src/NonEmpty.hs, dist/build/NonEmpty.o, dist/build/NonEmpty.dyn_o )
[2m[hspec-core] [m[ 8 of 52] Compiling GetOpt.Declarative.Types ( src/GetOpt/Declarative/Types.hs, dist/build/GetOpt/Declarative/Types.o, dist/build/GetOpt/Declarative/Types.dyn_o )
[2m[hspec-core] [m[ 9 of 52] Compiling GetOpt.Declarative.Environment ( src/GetOpt/Declarative/Environment.hs, dist/build/GetOpt/Declarative/Environment.o, dist/build/GetOpt/Declarative/Environment.dyn_o )
[2m[hspec-core] [m[10 of 52] Compiling Test.Hspec.Core.Example.Location ( src/Test/Hspec/Core/Example/Location.hs, dist/build/Test/Hspec/Core/Example/Location.o, dist/build/Test/Hspec/Core/Example/Location.dyn_o )
[2m[hspec-core] [m[11 of 52] Compiling Test.Hspec.Core.Formatters.Diff ( src/Test/Hspec/Core/Formatters/Diff.hs, dist/build/Test/Hspec/Core/Formatters/Diff.o, dist/build/Test/Hspec/Core/Formatters/Diff.dyn_o )
[2m[hspec-core] [m[12 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Parser.Parser ( src/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.o, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.dyn_o )
[2m[hspec-core] [m[13 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Parser ( src/Test/Hspec/Core/Formatters/Pretty/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser.o, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser.dyn_o )
[2m[hspec-core] [m[14 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Unicode ( src/Test/Hspec/Core/Formatters/Pretty/Unicode.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Unicode.o, dist/build/Test/Hspec/Core/Formatters/Pretty/Unicode.dyn_o )
[2m[hspec-core] [m[15 of 52] Compiling Test.Hspec.Core.Formatters.Pretty ( src/Test/Hspec/Core/Formatters/Pretty.hs, dist/build/Test/Hspec/Core/Formatters/Pretty.o, dist/build/Test/Hspec/Core/Formatters/Pretty.dyn_o )
[2m[hspec-core] [m[16 of 52] Compiling Test.Hspec.Core.Formatters.V1.Free ( src/Test/Hspec/Core/Formatters/V1/Free.hs, dist/build/Test/Hspec/Core/Formatters/V1/Free.o, dist/build/Test/Hspec/Core/Formatters/V1/Free.dyn_o )
[2m[hspec-core] [m[17 of 52] Compiling Test.Hspec.Core.Runner.JobQueue ( src/Test/Hspec/Core/Runner/JobQueue.hs, dist/build/Test/Hspec/Core/Runner/JobQueue.o, dist/build/Test/Hspec/Core/Runner/JobQueue.dyn_o )
[2m[hspec-meta] [m[21 of 58] Compiling Test.Hspec.Core.Example ( hspec-core/src/Test/Hspec/Core/Example.hs, dist/build/Test/Hspec/Core/Example.o, dist/build/Test/Hspec/Core/Example.dyn_o )
[2m[hspec-core] [m[18 of 52] Compiling Test.Hspec.Core.Timer ( src/Test/Hspec/Core/Timer.hs, dist/build/Test/Hspec/Core/Timer.o, dist/build/Test/Hspec/Core/Timer.dyn_o )
[2m[hspec-core] [m[19 of 52] Compiling Test.Hspec.Core.Util ( src/Test/Hspec/Core/Util.hs, dist/build/Test/Hspec/Core/Util.o, dist/build/Test/Hspec/Core/Util.dyn_o )
[2m[hspec-core] [m[20 of 52] Compiling Test.Hspec.Core.QuickCheck.Util ( src/Test/Hspec/Core/QuickCheck/Util.hs, dist/build/Test/Hspec/Core/QuickCheck/Util.o, dist/build/Test/Hspec/Core/QuickCheck/Util.dyn_o )
[2m[hspec-meta] [m[22 of 58] Compiling Test.Hspec.Core.Tree ( hspec-core/src/Test/Hspec/Core/Tree.hs, dist/build/Test/Hspec/Core/Tree.o, dist/build/Test/Hspec/Core/Tree.dyn_o )
[2m[hspec-core] [m[21 of 52] Compiling Test.Hspec.Core.Example ( src/Test/Hspec/Core/Example.hs, dist/build/Test/Hspec/Core/Example.o, dist/build/Test/Hspec/Core/Example.dyn_o )
[2m[hspec-core] [m[22 of 52] Compiling Test.Hspec.Core.Tree ( src/Test/Hspec/Core/Tree.hs, dist/build/Test/Hspec/Core/Tree.o, dist/build/Test/Hspec/Core/Tree.dyn_o )
[2m[hspec-meta] [m[23 of 58] Compiling Test.Hspec.Core.Shuffle ( hspec-core/src/Test/Hspec/Core/Shuffle.hs, dist/build/Test/Hspec/Core/Shuffle.o, dist/build/Test/Hspec/Core/Shuffle.dyn_o )
[2m[hspec-meta] [m[24 of 58] Compiling Test.Hspec.Core.Format ( hspec-core/src/Test/Hspec/Core/Format.hs, dist/build/Test/Hspec/Core/Format.o, dist/build/Test/Hspec/Core/Format.dyn_o )
[2m[hspec-meta] [m[25 of 58] Compiling Test.Hspec.Core.Runner.Result ( hspec-core/src/Test/Hspec/Core/Runner/Result.hs, dist/build/Test/Hspec/Core/Runner/Result.o, dist/build/Test/Hspec/Core/Runner/Result.dyn_o )
[2m[hspec-meta] [m[26 of 58] Compiling Test.Hspec.Core.Formatters.V1.Monad ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Monad.hs, dist/build/Test/Hspec/Core/Formatters/V1/Monad.o, dist/build/Test/Hspec/Core/Formatters/V1/Monad.dyn_o )
[2m[hspec-meta] [m[27 of 58] Compiling Test.Hspec.Core.Formatters.Internal ( hspec-core/src/Test/Hspec/Core/Formatters/Internal.hs, dist/build/Test/Hspec/Core/Formatters/Internal.o, dist/build/Test/Hspec/Core/Formatters/Internal.dyn_o )
[2m[hspec-core] [m[23 of 52] Compiling Test.Hspec.Core.Shuffle ( src/Test/Hspec/Core/Shuffle.hs, dist/build/Test/Hspec/Core/Shuffle.o, dist/build/Test/Hspec/Core/Shuffle.dyn_o )
[2m[hspec-core] [m[24 of 52] Compiling Test.Hspec.Core.Format ( src/Test/Hspec/Core/Format.hs, dist/build/Test/Hspec/Core/Format.o, dist/build/Test/Hspec/Core/Format.dyn_o )
[2m[hspec-core] [m[25 of 52] Compiling Test.Hspec.Core.Runner.Result ( src/Test/Hspec/Core/Runner/Result.hs, dist/build/Test/Hspec/Core/Runner/Result.o, dist/build/Test/Hspec/Core/Runner/Result.dyn_o )
[2m[hspec-meta] [m[28 of 58] Compiling Test.Hspec.Core.Formatters.V2 ( hspec-core/src/Test/Hspec/Core/Formatters/V2.hs, dist/build/Test/Hspec/Core/Formatters/V2.o, dist/build/Test/Hspec/Core/Formatters/V2.dyn_o )
[2m[hspec-core] [m[26 of 52] Compiling Test.Hspec.Core.Formatters.V1.Monad ( src/Test/Hspec/Core/Formatters/V1/Monad.hs, dist/build/Test/Hspec/Core/Formatters/V1/Monad.o, dist/build/Test/Hspec/Core/Formatters/V1/Monad.dyn_o )
[2m[hspec-core] [m[27 of 52] Compiling Test.Hspec.Core.Formatters.Internal ( src/Test/Hspec/Core/Formatters/Internal.hs, dist/build/Test/Hspec/Core/Formatters/Internal.o, dist/build/Test/Hspec/Core/Formatters/Internal.dyn_o )
[2m[hspec-core] [m[28 of 52] Compiling Test.Hspec.Core.Formatters.V2 ( src/Test/Hspec/Core/Formatters/V2.hs, dist/build/Test/Hspec/Core/Formatters/V2.o, dist/build/Test/Hspec/Core/Formatters/V2.dyn_o )
[2m[hspec-meta] [m[29 of 58] Compiling Test.Hspec.Core.Runner.PrintSlowSpecItems ( hspec-core/src/Test/Hspec/Core/Runner/PrintSlowSpecItems.hs, dist/build/Test/Hspec/Core/Runner/PrintSlowSpecItems.o, dist/build/Test/Hspec/Core/Runner/PrintSlowSpecItems.dyn_o )
[2m[hspec-meta] [m[30 of 58] Compiling Test.Hspec.Core.Formatters.V1.Internal ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Internal.hs, dist/build/Test/Hspec/Core/Formatters/V1/Internal.o, dist/build/Test/Hspec/Core/Formatters/V1/Internal.dyn_o )
[2m[hspec-core] [m[29 of 52] Compiling Test.Hspec.Core.Runner.PrintSlowSpecItems ( src/Test/Hspec/Core/Runner/PrintSlowSpecItems.hs, dist/build/Test/Hspec/Core/Runner/PrintSlowSpecItems.o, dist/build/Test/Hspec/Core/Runner/PrintSlowSpecItems.dyn_o )
[2m[hspec-core] [m[30 of 52] Compiling Test.Hspec.Core.Formatters.V1.Internal ( src/Test/Hspec/Core/Formatters/V1/Internal.hs, dist/build/Test/Hspec/Core/Formatters/V1/Internal.o, dist/build/Test/Hspec/Core/Formatters/V1/Internal.dyn_o )
[2m[hspec-meta] [m[31 of 58] Compiling Test.Hspec.Core.Formatters.V1 ( hspec-core/src/Test/Hspec/Core/Formatters/V1.hs, dist/build/Test/Hspec/Core/Formatters/V1.o, dist/build/Test/Hspec/Core/Formatters/V1.dyn_o )
[2m[hspec-meta] [m[32 of 58] Compiling Test.Hspec.Core.Formatters ( hspec-core/src/Test/Hspec/Core/Formatters.hs, dist/build/Test/Hspec/Core/Formatters.o, dist/build/Test/Hspec/Core/Formatters.dyn_o )
[2m[hspec-meta] [m[33 of 58] Compiling GetOpt.Declarative.Util ( hspec-core/src/GetOpt/Declarative/Util.hs, dist/build/GetOpt/Declarative/Util.o, dist/build/GetOpt/Declarative/Util.dyn_o )
[2m[hspec-meta] [m[34 of 58] Compiling GetOpt.Declarative.Interpret ( hspec-core/src/GetOpt/Declarative/Interpret.hs, dist/build/GetOpt/Declarative/Interpret.o, dist/build/GetOpt/Declarative/Interpret.dyn_o )
[2m[hspec-meta] [m[35 of 58] Compiling GetOpt.Declarative ( hspec-core/src/GetOpt/Declarative.hs, dist/build/GetOpt/Declarative.o, dist/build/GetOpt/Declarative.dyn_o )
[2m[hspec-meta] [m[36 of 58] Compiling Test.Hspec.Core.Config.Definition ( hspec-core/src/Test/Hspec/Core/Config/Definition.hs, dist/build/Test/Hspec/Core/Config/Definition.o, dist/build/Test/Hspec/Core/Config/Definition.dyn_o )
[2m[hspec-core] [m[31 of 52] Compiling Test.Hspec.Core.Formatters.V1 ( src/Test/Hspec/Core/Formatters/V1.hs, dist/build/Test/Hspec/Core/Formatters/V1.o, dist/build/Test/Hspec/Core/Formatters/V1.dyn_o )
[2m[hspec-core] [m[32 of 52] Compiling Test.Hspec.Core.Formatters ( src/Test/Hspec/Core/Formatters.hs, dist/build/Test/Hspec/Core/Formatters.o, dist/build/Test/Hspec/Core/Formatters.dyn_o )
[2m[hspec-core] [m[33 of 52] Compiling GetOpt.Declarative.Util ( src/GetOpt/Declarative/Util.hs, dist/build/GetOpt/Declarative/Util.o, dist/build/GetOpt/Declarative/Util.dyn_o )
[2m[hspec-core] [m[34 of 52] Compiling GetOpt.Declarative.Interpret ( src/GetOpt/Declarative/Interpret.hs, dist/build/GetOpt/Declarative/Interpret.o, dist/build/GetOpt/Declarative/Interpret.dyn_o )
[2m[hspec-core] [m[35 of 52] Compiling GetOpt.Declarative ( src/GetOpt/Declarative.hs, dist/build/GetOpt/Declarative.o, dist/build/GetOpt/Declarative.dyn_o )
[2m[hspec-core] [m[36 of 52] Compiling Test.Hspec.Core.Config.Definition ( src/Test/Hspec/Core/Config/Definition.hs, dist/build/Test/Hspec/Core/Config/Definition.o, dist/build/Test/Hspec/Core/Config/Definition.dyn_o )
[2m[hspec-meta] [m[37 of 58] Compiling Test.Hspec.Core.Spec.Monad ( hspec-core/src/Test/Hspec/Core/Spec/Monad.hs, dist/build/Test/Hspec/Core/Spec/Monad.o, dist/build/Test/Hspec/Core/Spec/Monad.dyn_o )
[2m[hspec-meta] [m[38 of 58] Compiling Test.Hspec.Core.QuickCheck ( hspec-core/src/Test/Hspec/Core/QuickCheck.hs, dist/build/Test/Hspec/Core/QuickCheck.o, dist/build/Test/Hspec/Core/QuickCheck.dyn_o )
[2m[hspec-meta] [m[39 of 58] Compiling Test.Hspec.Core.Hooks ( hspec-core/src/Test/Hspec/Core/Hooks.hs, dist/build/Test/Hspec/Core/Hooks.o, dist/build/Test/Hspec/Core/Hooks.dyn_o )
[2m[hspec-core] [m[37 of 52] Compiling Test.Hspec.Core.Spec.Monad ( src/Test/Hspec/Core/Spec/Monad.hs, dist/build/Test/Hspec/Core/Spec/Monad.o, dist/build/Test/Hspec/Core/Spec/Monad.dyn_o )
[2m[hspec-core] [m[38 of 52] Compiling Test.Hspec.Core.QuickCheck ( src/Test/Hspec/Core/QuickCheck.hs, dist/build/Test/Hspec/Core/QuickCheck.o, dist/build/Test/Hspec/Core/QuickCheck.dyn_o )
[2m[hspec-meta] [m[40 of 58] Compiling Test.Hspec.Core.Spec ( hspec-core/src/Test/Hspec/Core/Spec.hs, dist/build/Test/Hspec/Core/Spec.o, dist/build/Test/Hspec/Core/Spec.dyn_o )
[2m[hspec-core] [m[39 of 52] Compiling Test.Hspec.Core.Hooks ( src/Test/Hspec/Core/Hooks.hs, dist/build/Test/Hspec/Core/Hooks.o, dist/build/Test/Hspec/Core/Hooks.dyn_o )
[2m[hspec-meta] [m[41 of 58] Compiling Test.Hspec.Core.Runner.Eval ( hspec-core/src/Test/Hspec/Core/Runner/Eval.hs, dist/build/Test/Hspec/Core/Runner/Eval.o, dist/build/Test/Hspec/Core/Runner/Eval.dyn_o )
[2m[hspec-core] [m[40 of 52] Compiling Test.Hspec.Core.Spec ( src/Test/Hspec/Core/Spec.hs, dist/build/Test/Hspec/Core/Spec.o, dist/build/Test/Hspec/Core/Spec.dyn_o )
[2m[hspec-core] [m[41 of 52] Compiling Test.Hspec.Core.Runner.Eval ( src/Test/Hspec/Core/Runner/Eval.hs, dist/build/Test/Hspec/Core/Runner/Eval.o, dist/build/Test/Hspec/Core/Runner/Eval.dyn_o )
[2m[hspec-meta] [m[42 of 58] Compiling Test.Hspec.Core.Extension.Tree ( hspec-core/src/Test/Hspec/Core/Extension/Tree.hs, dist/build/Test/Hspec/Core/Extension/Tree.o, dist/build/Test/Hspec/Core/Extension/Tree.dyn_o )
[2m[hspec-meta] [m[43 of 58] Compiling Test.Hspec.Core.Extension.Spec ( hspec-core/src/Test/Hspec/Core/Extension/Spec.hs, dist/build/Test/Hspec/Core/Extension/Spec.o, dist/build/Test/Hspec/Core/Extension/Spec.dyn_o )
[2m[hspec-meta] [m[44 of 58] Compiling Test.Hspec.Core.Extension.Item ( hspec-core/src/Test/Hspec/Core/Extension/Item.hs, dist/build/Test/Hspec/Core/Extension/Item.o, dist/build/Test/Hspec/Core/Extension/Item.dyn_o )
[2m[hspec-meta] [m[45 of 58] Compiling Test.Hspec.Core.FailureReport ( hspec-core/src/Test/Hspec/Core/FailureReport.hs, dist/build/Test/Hspec/Core/FailureReport.o, dist/build/Test/Hspec/Core/FailureReport.dyn_o )
[2m[hspec-meta] [m[46 of 58] Compiling Test.Hspec.Core.Extension.Config.Type ( hspec-core/src/Test/Hspec/Core/Extension/Config/Type.hs, dist/build/Test/Hspec/Core/Extension/Config/Type.o, dist/build/Test/Hspec/Core/Extension/Config/Type.dyn_o )
[2m[hspec-meta] [m[47 of 58] Compiling Test.Hspec.Core.Extension.Option ( hspec-core/src/Test/Hspec/Core/Extension/Option.hs, dist/build/Test/Hspec/Core/Extension/Option.o, dist/build/Test/Hspec/Core/Extension/Option.dyn_o )
[2m[hspec-meta] [m[48 of 58] Compiling Test.Hspec.Core.Extension.Config ( hspec-core/src/Test/Hspec/Core/Extension/Config.hs, dist/build/Test/Hspec/Core/Extension/Config.o, dist/build/Test/Hspec/Core/Extension/Config.dyn_o )
[2m[hspec-meta] [m[49 of 58] Compiling Test.Hspec.Core.Extension ( hspec-core/src/Test/Hspec/Core/Extension.hs, dist/build/Test/Hspec/Core/Extension.o, dist/build/Test/Hspec/Core/Extension.dyn_o )
[2m[hspec-meta] [m[50 of 58] Compiling Test.Hspec.Core.Config.Options ( hspec-core/src/Test/Hspec/Core/Config/Options.hs, dist/build/Test/Hspec/Core/Config/Options.o, dist/build/Test/Hspec/Core/Config/Options.dyn_o )
[2m[hspec-meta] [m[51 of 58] Compiling Test.Hspec.Core.Config ( hspec-core/src/Test/Hspec/Core/Config.hs, dist/build/Test/Hspec/Core/Config.o, dist/build/Test/Hspec/Core/Config.dyn_o )
[2m[hspec-meta] [m[52 of 58] Compiling Test.Hspec.Core.Runner ( hspec-core/src/Test/Hspec/Core/Runner.hs, dist/build/Test/Hspec/Core/Runner.o, dist/build/Test/Hspec/Core/Runner.dyn_o )
[2m[hspec-core] [m[42 of 52] Compiling Test.Hspec.Core.Extension.Tree ( src/Test/Hspec/Core/Extension/Tree.hs, dist/build/Test/Hspec/Core/Extension/Tree.o, dist/build/Test/Hspec/Core/Extension/Tree.dyn_o )
[2m[hspec-core] [m[43 of 52] Compiling Test.Hspec.Core.Extension.Spec ( src/Test/Hspec/Core/Extension/Spec.hs, dist/build/Test/Hspec/Core/Extension/Spec.o, dist/build/Test/Hspec/Core/Extension/Spec.dyn_o )
[2m[hspec-core] [m[44 of 52] Compiling Test.Hspec.Core.Extension.Item ( src/Test/Hspec/Core/Extension/Item.hs, dist/build/Test/Hspec/Core/Extension/Item.o, dist/build/Test/Hspec/Core/Extension/Item.dyn_o )
[2m[hspec-core] [m[45 of 52] Compiling Test.Hspec.Core.FailureReport ( src/Test/Hspec/Core/FailureReport.hs, dist/build/Test/Hspec/Core/FailureReport.o, dist/build/Test/Hspec/Core/FailureReport.dyn_o )
[2m[hspec-core] [m[46 of 52] Compiling Test.Hspec.Core.Extension.Config.Type ( src/Test/Hspec/Core/Extension/Config/Type.hs, dist/build/Test/Hspec/Core/Extension/Config/Type.o, dist/build/Test/Hspec/Core/Extension/Config/Type.dyn_o )
[2m[hspec-core] [m[47 of 52] Compiling Test.Hspec.Core.Extension.Option ( src/Test/Hspec/Core/Extension/Option.hs, dist/build/Test/Hspec/Core/Extension/Option.o, dist/build/Test/Hspec/Core/Extension/Option.dyn_o )
[2m[hspec-core] [m[48 of 52] Compiling Test.Hspec.Core.Extension.Config ( src/Test/Hspec/Core/Extension/Config.hs, dist/build/Test/Hspec/Core/Extension/Config.o, dist/build/Test/Hspec/Core/Extension/Config.dyn_o )
[2m[hspec-core] [m[49 of 52] Compiling Test.Hspec.Core.Extension ( src/Test/Hspec/Core/Extension.hs, dist/build/Test/Hspec/Core/Extension.o, dist/build/Test/Hspec/Core/Extension.dyn_o )
[2m[hspec-core] [m[50 of 52] Compiling Test.Hspec.Core.Config.Options ( src/Test/Hspec/Core/Config/Options.hs, dist/build/Test/Hspec/Core/Config/Options.o, dist/build/Test/Hspec/Core/Config/Options.dyn_o )
[2m[hspec-core] [m[51 of 52] Compiling Test.Hspec.Core.Config ( src/Test/Hspec/Core/Config.hs, dist/build/Test/Hspec/Core/Config.o, dist/build/Test/Hspec/Core/Config.dyn_o )
[2m[hspec-core] [m[52 of 52] Compiling Test.Hspec.Core.Runner ( src/Test/Hspec/Core/Runner.hs, dist/build/Test/Hspec/Core/Runner.o, dist/build/Test/Hspec/Core/Runner.dyn_o )
[2m[hspec-meta] [m[53 of 58] Compiling Test.Hspec.Discover ( hspec/src/Test/Hspec/Discover.hs, dist/build/Test/Hspec/Discover.o, dist/build/Test/Hspec/Discover.dyn_o )
[2m[hspec-meta] [m[54 of 58] Compiling Test.Hspec.Formatters ( hspec/src/Test/Hspec/Formatters.hs, dist/build/Test/Hspec/Formatters.o, dist/build/Test/Hspec/Formatters.dyn_o )
[2m[hspec-meta] [m[55 of 58] Compiling Test.Hspec.Runner ( hspec/src/Test/Hspec/Runner.hs, dist/build/Test/Hspec/Runner.o, dist/build/Test/Hspec/Runner.dyn_o )
[2m[hspec-meta] [m[56 of 58] Compiling Test.Hspec       ( hspec/src/Test/Hspec.hs, dist/build/Test/Hspec.o, dist/build/Test/Hspec.dyn_o )
[2m[hspec-meta] [m[57 of 58] Compiling Test.Hspec.QuickCheck ( hspec/src/Test/Hspec/QuickCheck.hs, dist/build/Test/Hspec/QuickCheck.o, dist/build/Test/Hspec/QuickCheck.dyn_o )
[2m[hspec-meta] [m[58 of 58] Compiling Test.Hspec.Meta  ( src/Test/Hspec/Meta.hs, dist/build/Test/Hspec/Meta.o, dist/build/Test/Hspec/Meta.dyn_o )
[2m[hspec-meta] [m[ 1 of 58] Compiling Control.Concurrent.Async ( vendor/Control/Concurrent/Async.hs, dist/build/Control/Concurrent/Async.p_o )
[2m[hspec-core] [m[ 1 of 52] Compiling Control.Concurrent.Async ( vendor/Control/Concurrent/Async.hs, dist/build/Control/Concurrent/Async.p_o )
[2m[hspec-meta] [m[ 2 of 58] Compiling Data.Algorithm.Diff ( vendor/Data/Algorithm/Diff.hs, dist/build/Data/Algorithm/Diff.p_o )
[2m[hspec-meta] [m[ 3 of 58] Compiling Paths_hspec_meta ( dist/build/autogen/Paths_hspec_meta.hs, dist/build/Paths_hspec_meta.p_o )
[2m[hspec-meta] [m[ 4 of 58] Compiling Test.Hspec.Core.Compat ( hspec-core/src/Test/Hspec/Core/Compat.hs, dist/build/Test/Hspec/Core/Compat.p_o )
[2m[hspec-meta] [m[ 5 of 58] Compiling Test.Hspec.Core.Clock ( hspec-core/src/Test/Hspec/Core/Clock.hs, dist/build/Test/Hspec/Core/Clock.p_o )
[2m[hspec-meta] [m[ 6 of 58] Compiling Test.Hspec.Core.Annotations ( hspec-core/src/Test/Hspec/Core/Annotations.hs, dist/build/Test/Hspec/Core/Annotations.p_o )
[2m[hspec-meta] [m[ 7 of 58] Compiling NonEmpty         ( hspec-core/src/NonEmpty.hs, dist/build/NonEmpty.p_o )
[2m[hspec-meta] [m[ 8 of 58] Compiling GetOpt.Declarative.Types ( hspec-core/src/GetOpt/Declarative/Types.hs, dist/build/GetOpt/Declarative/Types.p_o )
[2m[hspec-meta] [m[ 9 of 58] Compiling GetOpt.Declarative.Environment ( hspec-core/src/GetOpt/Declarative/Environment.hs, dist/build/GetOpt/Declarative/Environment.p_o )
[2m[hspec-meta] [m[10 of 58] Compiling Test.Hspec.Core.Example.Location ( hspec-core/src/Test/Hspec/Core/Example/Location.hs, dist/build/Test/Hspec/Core/Example/Location.p_o )
[2m[hspec-meta] [m[11 of 58] Compiling Test.Hspec.Core.Formatters.Diff ( hspec-core/src/Test/Hspec/Core/Formatters/Diff.hs, dist/build/Test/Hspec/Core/Formatters/Diff.p_o )
[2m[hspec-meta] [m[12 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Parser.Parser ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.p_o )
[2m[hspec-meta] [m[13 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Parser ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser.p_o )
[2m[hspec-meta] [m[14 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Unicode ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Unicode.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Unicode.p_o )
[2m[hspec-meta] [m[15 of 58] Compiling Test.Hspec.Core.Formatters.Pretty ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty.hs, dist/build/Test/Hspec/Core/Formatters/Pretty.p_o )
[2m[hspec-meta] [m[16 of 58] Compiling Test.Hspec.Core.Formatters.V1.Free ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Free.hs, dist/build/Test/Hspec/Core/Formatters/V1/Free.p_o )
[2m[hspec-meta] [m[17 of 58] Compiling Test.Hspec.Core.Runner.JobQueue ( hspec-core/src/Test/Hspec/Core/Runner/JobQueue.hs, dist/build/Test/Hspec/Core/Runner/JobQueue.p_o )
[2m[hspec-core] [m[ 2 of 52] Compiling Data.Algorithm.Diff ( vendor/Data/Algorithm/Diff.hs, dist/build/Data/Algorithm/Diff.p_o )
[2m[hspec-core] [m[ 3 of 52] Compiling Paths_hspec_core ( dist/build/autogen/Paths_hspec_core.hs, dist/build/Paths_hspec_core.p_o )
[2m[hspec-core] [m[ 4 of 52] Compiling Test.Hspec.Core.Compat ( src/Test/Hspec/Core/Compat.hs, dist/build/Test/Hspec/Core/Compat.p_o )
[2m[hspec-core] [m[ 5 of 52] Compiling Test.Hspec.Core.Clock ( src/Test/Hspec/Core/Clock.hs, dist/build/Test/Hspec/Core/Clock.p_o )
[2m[hspec-core] [m[ 6 of 52] Compiling Test.Hspec.Core.Annotations ( src/Test/Hspec/Core/Annotations.hs, dist/build/Test/Hspec/Core/Annotations.p_o )
[2m[hspec-core] [m[ 7 of 52] Compiling NonEmpty         ( src/NonEmpty.hs, dist/build/NonEmpty.p_o )
[2m[hspec-core] [m[ 8 of 52] Compiling GetOpt.Declarative.Types ( src/GetOpt/Declarative/Types.hs, dist/build/GetOpt/Declarative/Types.p_o )
[2m[hspec-core] [m[ 9 of 52] Compiling GetOpt.Declarative.Environment ( src/GetOpt/Declarative/Environment.hs, dist/build/GetOpt/Declarative/Environment.p_o )
[2m[hspec-core] [m[10 of 52] Compiling Test.Hspec.Core.Example.Location ( src/Test/Hspec/Core/Example/Location.hs, dist/build/Test/Hspec/Core/Example/Location.p_o )
[2m[hspec-core] [m[11 of 52] Compiling Test.Hspec.Core.Formatters.Diff ( src/Test/Hspec/Core/Formatters/Diff.hs, dist/build/Test/Hspec/Core/Formatters/Diff.p_o )
[2m[hspec-core] [m[12 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Parser.Parser ( src/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.p_o )
[2m[hspec-core] [m[13 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Parser ( src/Test/Hspec/Core/Formatters/Pretty/Parser.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Parser.p_o )
[2m[hspec-core] [m[14 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Unicode ( src/Test/Hspec/Core/Formatters/Pretty/Unicode.hs, dist/build/Test/Hspec/Core/Formatters/Pretty/Unicode.p_o )
[2m[hspec-core] [m[15 of 52] Compiling Test.Hspec.Core.Formatters.Pretty ( src/Test/Hspec/Core/Formatters/Pretty.hs, dist/build/Test/Hspec/Core/Formatters/Pretty.p_o )
[2m[hspec-core] [m[16 of 52] Compiling Test.Hspec.Core.Formatters.V1.Free ( src/Test/Hspec/Core/Formatters/V1/Free.hs, dist/build/Test/Hspec/Core/Formatters/V1/Free.p_o )
[2m[hspec-core] [m[17 of 52] Compiling Test.Hspec.Core.Runner.JobQueue ( src/Test/Hspec/Core/Runner/JobQueue.hs, dist/build/Test/Hspec/Core/Runner/JobQueue.p_o )
[2m[hspec-meta] [m[18 of 58] Compiling Test.Hspec.Core.Timer ( hspec-core/src/Test/Hspec/Core/Timer.hs, dist/build/Test/Hspec/Core/Timer.p_o )
[2m[hspec-meta] [m[19 of 58] Compiling Test.Hspec.Core.Util ( hspec-core/src/Test/Hspec/Core/Util.hs, dist/build/Test/Hspec/Core/Util.p_o )
[2m[hspec-meta] [m[20 of 58] Compiling Test.Hspec.Core.QuickCheck.Util ( hspec-core/src/Test/Hspec/Core/QuickCheck/Util.hs, dist/build/Test/Hspec/Core/QuickCheck/Util.p_o )
[2m[hspec-core] [m[18 of 52] Compiling Test.Hspec.Core.Timer ( src/Test/Hspec/Core/Timer.hs, dist/build/Test/Hspec/Core/Timer.p_o )
[2m[hspec-core] [m[19 of 52] Compiling Test.Hspec.Core.Util ( src/Test/Hspec/Core/Util.hs, dist/build/Test/Hspec/Core/Util.p_o )
[2m[hspec-core] [m[20 of 52] Compiling Test.Hspec.Core.QuickCheck.Util ( src/Test/Hspec/Core/QuickCheck/Util.hs, dist/build/Test/Hspec/Core/QuickCheck/Util.p_o )
[2m[hspec-meta] [m[21 of 58] Compiling Test.Hspec.Core.Example ( hspec-core/src/Test/Hspec/Core/Example.hs, dist/build/Test/Hspec/Core/Example.p_o )
[2m[hspec-core] [m[21 of 52] Compiling Test.Hspec.Core.Example ( src/Test/Hspec/Core/Example.hs, dist/build/Test/Hspec/Core/Example.p_o )
[2m[hspec-meta] [m[22 of 58] Compiling Test.Hspec.Core.Tree ( hspec-core/src/Test/Hspec/Core/Tree.hs, dist/build/Test/Hspec/Core/Tree.p_o )
[2m[hspec-core] [m[22 of 52] Compiling Test.Hspec.Core.Tree ( src/Test/Hspec/Core/Tree.hs, dist/build/Test/Hspec/Core/Tree.p_o )
[2m[hspec-meta] [m[23 of 58] Compiling Test.Hspec.Core.Shuffle ( hspec-core/src/Test/Hspec/Core/Shuffle.hs, dist/build/Test/Hspec/Core/Shuffle.p_o )
[2m[hspec-core] [m[23 of 52] Compiling Test.Hspec.Core.Shuffle ( src/Test/Hspec/Core/Shuffle.hs, dist/build/Test/Hspec/Core/Shuffle.p_o )
[2m[hspec-meta] [m[24 of 58] Compiling Test.Hspec.Core.Format ( hspec-core/src/Test/Hspec/Core/Format.hs, dist/build/Test/Hspec/Core/Format.p_o )
[2m[hspec-meta] [m[25 of 58] Compiling Test.Hspec.Core.Runner.Result ( hspec-core/src/Test/Hspec/Core/Runner/Result.hs, dist/build/Test/Hspec/Core/Runner/Result.p_o )
[2m[hspec-meta] [m[26 of 58] Compiling Test.Hspec.Core.Formatters.V1.Monad ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Monad.hs, dist/build/Test/Hspec/Core/Formatters/V1/Monad.p_o )
[2m[hspec-meta] [m[27 of 58] Compiling Test.Hspec.Core.Formatters.Internal ( hspec-core/src/Test/Hspec/Core/Formatters/Internal.hs, dist/build/Test/Hspec/Core/Formatters/Internal.p_o )
[2m[hspec-core] [m[24 of 52] Compiling Test.Hspec.Core.Format ( src/Test/Hspec/Core/Format.hs, dist/build/Test/Hspec/Core/Format.p_o )
[2m[hspec-core] [m[25 of 52] Compiling Test.Hspec.Core.Runner.Result ( src/Test/Hspec/Core/Runner/Result.hs, dist/build/Test/Hspec/Core/Runner/Result.p_o )
[2m[hspec-core] [m[26 of 52] Compiling Test.Hspec.Core.Formatters.V1.Monad ( src/Test/Hspec/Core/Formatters/V1/Monad.hs, dist/build/Test/Hspec/Core/Formatters/V1/Monad.p_o )
[2m[hspec-core] [m[27 of 52] Compiling Test.Hspec.Core.Formatters.Internal ( src/Test/Hspec/Core/Formatters/Internal.hs, dist/build/Test/Hspec/Core/Formatters/Internal.p_o )
[2m[hspec-meta] [m[28 of 58] Compiling Test.Hspec.Core.Formatters.V2 ( hspec-core/src/Test/Hspec/Core/Formatters/V2.hs, dist/build/Test/Hspec/Core/Formatters/V2.p_o )
[2m[hspec-core] [m[28 of 52] Compiling Test.Hspec.Core.Formatters.V2 ( src/Test/Hspec/Core/Formatters/V2.hs, dist/build/Test/Hspec/Core/Formatters/V2.p_o )
[2m[hspec-meta] [m[29 of 58] Compiling Test.Hspec.Core.Runner.PrintSlowSpecItems ( hspec-core/src/Test/Hspec/Core/Runner/PrintSlowSpecItems.hs, dist/build/Test/Hspec/Core/Runner/PrintSlowSpecItems.p_o )
[2m[hspec-core] [m[29 of 52] Compiling Test.Hspec.Core.Runner.PrintSlowSpecItems ( src/Test/Hspec/Core/Runner/PrintSlowSpecItems.hs, dist/build/Test/Hspec/Core/Runner/PrintSlowSpecItems.p_o )
[2m[hspec-meta] [m[30 of 58] Compiling Test.Hspec.Core.Formatters.V1.Internal ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Internal.hs, dist/build/Test/Hspec/Core/Formatters/V1/Internal.p_o )
[2m[hspec-core] [m[30 of 52] Compiling Test.Hspec.Core.Formatters.V1.Internal ( src/Test/Hspec/Core/Formatters/V1/Internal.hs, dist/build/Test/Hspec/Core/Formatters/V1/Internal.p_o )
[2m[hspec-meta] [m[31 of 58] Compiling Test.Hspec.Core.Formatters.V1 ( hspec-core/src/Test/Hspec/Core/Formatters/V1.hs, dist/build/Test/Hspec/Core/Formatters/V1.p_o )
[2m[hspec-meta] [m[32 of 58] Compiling Test.Hspec.Core.Formatters ( hspec-core/src/Test/Hspec/Core/Formatters.hs, dist/build/Test/Hspec/Core/Formatters.p_o )
[2m[hspec-core] [m[31 of 52] Compiling Test.Hspec.Core.Formatters.V1 ( src/Test/Hspec/Core/Formatters/V1.hs, dist/build/Test/Hspec/Core/Formatters/V1.p_o )
[2m[hspec-meta] [m[33 of 58] Compiling GetOpt.Declarative.Util ( hspec-core/src/GetOpt/Declarative/Util.hs, dist/build/GetOpt/Declarative/Util.p_o )
[2m[hspec-meta] [m[34 of 58] Compiling GetOpt.Declarative.Interpret ( hspec-core/src/GetOpt/Declarative/Interpret.hs, dist/build/GetOpt/Declarative/Interpret.p_o )
[2m[hspec-meta] [m[35 of 58] Compiling GetOpt.Declarative ( hspec-core/src/GetOpt/Declarative.hs, dist/build/GetOpt/Declarative.p_o )
[2m[hspec-meta] [m[36 of 58] Compiling Test.Hspec.Core.Config.Definition ( hspec-core/src/Test/Hspec/Core/Config/Definition.hs, dist/build/Test/Hspec/Core/Config/Definition.p_o )
[2m[hspec-core] [m[32 of 52] Compiling Test.Hspec.Core.Formatters ( src/Test/Hspec/Core/Formatters.hs, dist/build/Test/Hspec/Core/Formatters.p_o )
[2m[hspec-core] [m[33 of 52] Compiling GetOpt.Declarative.Util ( src/GetOpt/Declarative/Util.hs, dist/build/GetOpt/Declarative/Util.p_o )
[2m[hspec-core] [m[34 of 52] Compiling GetOpt.Declarative.Interpret ( src/GetOpt/Declarative/Interpret.hs, dist/build/GetOpt/Declarative/Interpret.p_o )
[2m[hspec-core] [m[35 of 52] Compiling GetOpt.Declarative ( src/GetOpt/Declarative.hs, dist/build/GetOpt/Declarative.p_o )
[2m[hspec-core] [m[36 of 52] Compiling Test.Hspec.Core.Config.Definition ( src/Test/Hspec/Core/Config/Definition.hs, dist/build/Test/Hspec/Core/Config/Definition.p_o )
[2m[hspec-meta] [m[37 of 58] Compiling Test.Hspec.Core.Spec.Monad ( hspec-core/src/Test/Hspec/Core/Spec/Monad.hs, dist/build/Test/Hspec/Core/Spec/Monad.p_o )
[2m[hspec-core] [m[37 of 52] Compiling Test.Hspec.Core.Spec.Monad ( src/Test/Hspec/Core/Spec/Monad.hs, dist/build/Test/Hspec/Core/Spec/Monad.p_o )
[2m[hspec-meta] [m[38 of 58] Compiling Test.Hspec.Core.QuickCheck ( hspec-core/src/Test/Hspec/Core/QuickCheck.hs, dist/build/Test/Hspec/Core/QuickCheck.p_o )
[2m[hspec-core] [m[38 of 52] Compiling Test.Hspec.Core.QuickCheck ( src/Test/Hspec/Core/QuickCheck.hs, dist/build/Test/Hspec/Core/QuickCheck.p_o )
[2m[hspec-meta] [m[39 of 58] Compiling Test.Hspec.Core.Hooks ( hspec-core/src/Test/Hspec/Core/Hooks.hs, dist/build/Test/Hspec/Core/Hooks.p_o )
[2m[hspec-core] [m[39 of 52] Compiling Test.Hspec.Core.Hooks ( src/Test/Hspec/Core/Hooks.hs, dist/build/Test/Hspec/Core/Hooks.p_o )
[2m[hspec-meta] [m[40 of 58] Compiling Test.Hspec.Core.Spec ( hspec-core/src/Test/Hspec/Core/Spec.hs, dist/build/Test/Hspec/Core/Spec.p_o )
[2m[hspec-core] [m[40 of 52] Compiling Test.Hspec.Core.Spec ( src/Test/Hspec/Core/Spec.hs, dist/build/Test/Hspec/Core/Spec.p_o )
[2m[hspec-meta] [m[41 of 58] Compiling Test.Hspec.Core.Runner.Eval ( hspec-core/src/Test/Hspec/Core/Runner/Eval.hs, dist/build/Test/Hspec/Core/Runner/Eval.p_o )
[2m[hspec-core] [m[41 of 52] Compiling Test.Hspec.Core.Runner.Eval ( src/Test/Hspec/Core/Runner/Eval.hs, dist/build/Test/Hspec/Core/Runner/Eval.p_o )
[2m[hspec-meta] [m[42 of 58] Compiling Test.Hspec.Core.Extension.Tree ( hspec-core/src/Test/Hspec/Core/Extension/Tree.hs, dist/build/Test/Hspec/Core/Extension/Tree.p_o )
[2m[hspec-meta] [m[43 of 58] Compiling Test.Hspec.Core.Extension.Spec ( hspec-core/src/Test/Hspec/Core/Extension/Spec.hs, dist/build/Test/Hspec/Core/Extension/Spec.p_o )
[2m[hspec-meta] [m[44 of 58] Compiling Test.Hspec.Core.Extension.Item ( hspec-core/src/Test/Hspec/Core/Extension/Item.hs, dist/build/Test/Hspec/Core/Extension/Item.p_o )
[2m[hspec-meta] [m[45 of 58] Compiling Test.Hspec.Core.FailureReport ( hspec-core/src/Test/Hspec/Core/FailureReport.hs, dist/build/Test/Hspec/Core/FailureReport.p_o )
[2m[hspec-meta] [m[46 of 58] Compiling Test.Hspec.Core.Extension.Config.Type ( hspec-core/src/Test/Hspec/Core/Extension/Config/Type.hs, dist/build/Test/Hspec/Core/Extension/Config/Type.p_o )
[2m[hspec-meta] [m[47 of 58] Compiling Test.Hspec.Core.Extension.Option ( hspec-core/src/Test/Hspec/Core/Extension/Option.hs, dist/build/Test/Hspec/Core/Extension/Option.p_o )
[2m[hspec-meta] [m[48 of 58] Compiling Test.Hspec.Core.Extension.Config ( hspec-core/src/Test/Hspec/Core/Extension/Config.hs, dist/build/Test/Hspec/Core/Extension/Config.p_o )
[2m[hspec-meta] [m[49 of 58] Compiling Test.Hspec.Core.Extension ( hspec-core/src/Test/Hspec/Core/Extension.hs, dist/build/Test/Hspec/Core/Extension.p_o )
[2m[hspec-core] [m[42 of 52] Compiling Test.Hspec.Core.Extension.Tree ( src/Test/Hspec/Core/Extension/Tree.hs, dist/build/Test/Hspec/Core/Extension/Tree.p_o )
[2m[hspec-core] [m[43 of 52] Compiling Test.Hspec.Core.Extension.Spec ( src/Test/Hspec/Core/Extension/Spec.hs, dist/build/Test/Hspec/Core/Extension/Spec.p_o )
[2m[hspec-core] [m[44 of 52] Compiling Test.Hspec.Core.Extension.Item ( src/Test/Hspec/Core/Extension/Item.hs, dist/build/Test/Hspec/Core/Extension/Item.p_o )
[2m[hspec-core] [m[45 of 52] Compiling Test.Hspec.Core.FailureReport ( src/Test/Hspec/Core/FailureReport.hs, dist/build/Test/Hspec/Core/FailureReport.p_o )
[2m[hspec-core] [m[46 of 52] Compiling Test.Hspec.Core.Extension.Config.Type ( src/Test/Hspec/Core/Extension/Config/Type.hs, dist/build/Test/Hspec/Core/Extension/Config/Type.p_o )
[2m[hspec-core] [m[47 of 52] Compiling Test.Hspec.Core.Extension.Option ( src/Test/Hspec/Core/Extension/Option.hs, dist/build/Test/Hspec/Core/Extension/Option.p_o )
[2m[hspec-core] [m[48 of 52] Compiling Test.Hspec.Core.Extension.Config ( src/Test/Hspec/Core/Extension/Config.hs, dist/build/Test/Hspec/Core/Extension/Config.p_o )
[2m[hspec-core] [m[49 of 52] Compiling Test.Hspec.Core.Extension ( src/Test/Hspec/Core/Extension.hs, dist/build/Test/Hspec/Core/Extension.p_o )
[2m[hspec-core] [m[50 of 52] Compiling Test.Hspec.Core.Config.Options ( src/Test/Hspec/Core/Config/Options.hs, dist/build/Test/Hspec/Core/Config/Options.p_o )
[2m[hspec-core] [m[51 of 52] Compiling Test.Hspec.Core.Config ( src/Test/Hspec/Core/Config.hs, dist/build/Test/Hspec/Core/Config.p_o )
[2m[hspec-core] [m[52 of 52] Compiling Test.Hspec.Core.Runner ( src/Test/Hspec/Core/Runner.hs, dist/build/Test/Hspec/Core/Runner.p_o )
[2m[hspec-meta] [m[50 of 58] Compiling Test.Hspec.Core.Config.Options ( hspec-core/src/Test/Hspec/Core/Config/Options.hs, dist/build/Test/Hspec/Core/Config/Options.p_o )
[2m[hspec-meta] [m[51 of 58] Compiling Test.Hspec.Core.Config ( hspec-core/src/Test/Hspec/Core/Config.hs, dist/build/Test/Hspec/Core/Config.p_o )
[2m[hspec-meta] [m[52 of 58] Compiling Test.Hspec.Core.Runner ( hspec-core/src/Test/Hspec/Core/Runner.hs, dist/build/Test/Hspec/Core/Runner.p_o )
[2m[hspec-meta] [m[53 of 58] Compiling Test.Hspec.Discover ( hspec/src/Test/Hspec/Discover.hs, dist/build/Test/Hspec/Discover.p_o )
[2m[hspec-meta] [m[54 of 58] Compiling Test.Hspec.Formatters ( hspec/src/Test/Hspec/Formatters.hs, dist/build/Test/Hspec/Formatters.p_o )
[2m[hspec-meta] [m[55 of 58] Compiling Test.Hspec.Runner ( hspec/src/Test/Hspec/Runner.hs, dist/build/Test/Hspec/Runner.p_o )
[2m[hspec-meta] [m[56 of 58] Compiling Test.Hspec       ( hspec/src/Test/Hspec.hs, dist/build/Test/Hspec.p_o )
[2m[hspec-meta] [m[57 of 58] Compiling Test.Hspec.QuickCheck ( hspec/src/Test/Hspec/QuickCheck.hs, dist/build/Test/Hspec/QuickCheck.p_o )
[2m[hspec-meta] [m[58 of 58] Compiling Test.Hspec.Meta  ( src/Test/Hspec/Meta.hs, dist/build/Test/Hspec/Meta.p_o )
[2m[hspec-core] [m[1;36mPhase: haddockPhase[m
[2m[hspec-core] [mPreprocessing library for hspec-core-2.11.12..
[2m[hspec-core] [mRunning Haddock on library for hspec-core-2.11.12..
[2m[hspec-core] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[hspec-meta] [mPreprocessing executable 'hspec-meta-discover' for hspec-meta-2.11.12..
[2m[hspec-meta] [mBuilding executable 'hspec-meta-discover' for hspec-meta-2.11.12..
[2m[hspec-meta] [m[1 of 5] Compiling Paths_hspec_meta ( dist/build/hspec-meta-discover/autogen/Paths_hspec_meta.hs, dist/build/hspec-meta-discover/hspec-meta-discover-tmp/Paths_hspec_meta.o )
[2m[hspec-meta] [m[2 of 5] Compiling Test.Hspec.Discover.Config ( hspec-discover/src/Test/Hspec/Discover/Config.hs, dist/build/hspec-meta-discover/hspec-meta-discover-tmp/Test/Hspec/Discover/Config.o )
[2m[hspec-meta] [m[3 of 5] Compiling Test.Hspec.Discover.Sort ( hspec-discover/src/Test/Hspec/Discover/Sort.hs, dist/build/hspec-meta-discover/hspec-meta-discover-tmp/Test/Hspec/Discover/Sort.o )
[2m[hspec-meta] [m[4 of 5] Compiling Test.Hspec.Discover.Run ( hspec-discover/src/Test/Hspec/Discover/Run.hs, dist/build/hspec-meta-discover/hspec-meta-discover-tmp/Test/Hspec/Discover/Run.o )
[2m[hspec-core] [m[ 1 of 52] Compiling Control.Concurrent.Async ( vendor/Control/Concurrent/Async.hs, nothing )
[2m[hspec-meta] [m[5 of 5] Compiling Main             ( hspec-discover/driver/hspec-discover.hs, dist/build/hspec-meta-discover/hspec-meta-discover-tmp/Main.o )
[2m[hspec-core] [m[ 2 of 52] Compiling Data.Algorithm.Diff ( vendor/Data/Algorithm/Diff.hs, nothing )
[2m[hspec-core] [m[ 3 of 52] Compiling Paths_hspec_core ( dist/build/autogen/Paths_hspec_core.hs, nothing )
[2m[hspec-core] [m[ 4 of 52] Compiling Test.Hspec.Core.Compat ( src/Test/Hspec/Core/Compat.hs, nothing )
[2m[hspec-core] [m[ 5 of 52] Compiling Test.Hspec.Core.Clock ( src/Test/Hspec/Core/Clock.hs, nothing )
[2m[hspec-core] [m[ 6 of 52] Compiling Test.Hspec.Core.Annotations ( src/Test/Hspec/Core/Annotations.hs, nothing )
[2m[hspec-meta] [m[6 of 6] Linking dist/build/hspec-meta-discover/hspec-meta-discover
[2m[hspec-core] [m[ 7 of 52] Compiling NonEmpty         ( src/NonEmpty.hs, nothing )
[2m[hspec-core] [m[ 8 of 52] Compiling GetOpt.Declarative.Types ( src/GetOpt/Declarative/Types.hs, nothing )
[2m[hspec-core] [m[ 9 of 52] Compiling GetOpt.Declarative.Environment ( src/GetOpt/Declarative/Environment.hs, nothing )
[2m[hspec-core] [m[10 of 52] Compiling Test.Hspec.Core.Example.Location ( src/Test/Hspec/Core/Example/Location.hs, nothing )
[2m[hspec-core] [m[11 of 52] Compiling Test.Hspec.Core.Formatters.Diff ( src/Test/Hspec/Core/Formatters/Diff.hs, nothing )
[2m[hspec-core] [m[12 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Parser.Parser ( src/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.hs, nothing )
[2m[hspec-core] [m[13 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Parser ( src/Test/Hspec/Core/Formatters/Pretty/Parser.hs, nothing )
[2m[hspec-core] [m[14 of 52] Compiling Test.Hspec.Core.Formatters.Pretty.Unicode ( src/Test/Hspec/Core/Formatters/Pretty/Unicode.hs, nothing )
[2m[hspec-core] [m[15 of 52] Compiling Test.Hspec.Core.Formatters.Pretty ( src/Test/Hspec/Core/Formatters/Pretty.hs, nothing )
[2m[hspec-core] [m[16 of 52] Compiling Test.Hspec.Core.Formatters.V1.Free ( src/Test/Hspec/Core/Formatters/V1/Free.hs, nothing )
[2m[hspec-core] [m[17 of 52] Compiling Test.Hspec.Core.Runner.JobQueue ( src/Test/Hspec/Core/Runner/JobQueue.hs, nothing )
[2m[hspec-core] [m[18 of 52] Compiling Test.Hspec.Core.Timer ( src/Test/Hspec/Core/Timer.hs, nothing )
[2m[hspec-core] [m[19 of 52] Compiling Test.Hspec.Core.Util ( src/Test/Hspec/Core/Util.hs, nothing )
[2m[hspec-core] [m[20 of 52] Compiling Test.Hspec.Core.QuickCheck.Util ( src/Test/Hspec/Core/QuickCheck/Util.hs, nothing )
[2m[hspec-core] [m[21 of 52] Compiling Test.Hspec.Core.Example ( src/Test/Hspec/Core/Example.hs, nothing )
[2m[hspec-core] [m[22 of 52] Compiling Test.Hspec.Core.Tree ( src/Test/Hspec/Core/Tree.hs, nothing )
[2m[hspec-core] [m[23 of 52] Compiling Test.Hspec.Core.Shuffle ( src/Test/Hspec/Core/Shuffle.hs, nothing )
[2m[hspec-core] [m[24 of 52] Compiling Test.Hspec.Core.Format ( src/Test/Hspec/Core/Format.hs, nothing )
[2m[hspec-core] [m[25 of 52] Compiling Test.Hspec.Core.Runner.Result ( src/Test/Hspec/Core/Runner/Result.hs, nothing )
[2m[hspec-core] [m[26 of 52] Compiling Test.Hspec.Core.Formatters.V1.Monad ( src/Test/Hspec/Core/Formatters/V1/Monad.hs, nothing )
[2m[hspec-core] [m[27 of 52] Compiling Test.Hspec.Core.Formatters.Internal ( src/Test/Hspec/Core/Formatters/Internal.hs, nothing )
[2m[hspec-meta] [m[1;36mPhase: checkPhase[m
[2m[hspec-meta] [mPackage has no test suites.
[2m[hspec-meta] [m[1;36mPhase: haddockPhase[m
[2m[hspec-core] [m[28 of 52] Compiling Test.Hspec.Core.Formatters.V2 ( src/Test/Hspec/Core/Formatters/V2.hs, nothing )
[2m[hspec-meta] [mPreprocessing library for hspec-meta-2.11.12..
[2m[hspec-meta] [mRunning Haddock on library for hspec-meta-2.11.12..
[2m[hspec-meta] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[hspec-core] [m[29 of 52] Compiling Test.Hspec.Core.Runner.PrintSlowSpecItems ( src/Test/Hspec/Core/Runner/PrintSlowSpecItems.hs, nothing )
[2m[hspec-core] [m[30 of 52] Compiling Test.Hspec.Core.Formatters.V1.Internal ( src/Test/Hspec/Core/Formatters/V1/Internal.hs, nothing )
[2m[hspec-core] [m[31 of 52] Compiling Test.Hspec.Core.Formatters.V1 ( src/Test/Hspec/Core/Formatters/V1.hs, nothing )
[2m[hspec-core] [m[32 of 52] Compiling Test.Hspec.Core.Formatters ( src/Test/Hspec/Core/Formatters.hs, nothing )
[2m[hspec-core] [m[33 of 52] Compiling GetOpt.Declarative.Util ( src/GetOpt/Declarative/Util.hs, nothing )
[2m[hspec-core] [m[34 of 52] Compiling GetOpt.Declarative.Interpret ( src/GetOpt/Declarative/Interpret.hs, nothing )
[2m[hspec-core] [m[35 of 52] Compiling GetOpt.Declarative ( src/GetOpt/Declarative.hs, nothing )
[2m[hspec-core] [m[36 of 52] Compiling Test.Hspec.Core.Config.Definition ( src/Test/Hspec/Core/Config/Definition.hs, nothing )
[2m[hspec-core] [m[37 of 52] Compiling Test.Hspec.Core.Spec.Monad ( src/Test/Hspec/Core/Spec/Monad.hs, nothing )
[2m[hspec-core] [m[38 of 52] Compiling Test.Hspec.Core.QuickCheck ( src/Test/Hspec/Core/QuickCheck.hs, nothing )
[2m[hspec-core] [m[39 of 52] Compiling Test.Hspec.Core.Hooks ( src/Test/Hspec/Core/Hooks.hs, nothing )
[2m[hspec-core] [m[40 of 52] Compiling Test.Hspec.Core.Spec ( src/Test/Hspec/Core/Spec.hs, nothing )
[2m[hspec-core] [m[41 of 52] Compiling Test.Hspec.Core.Runner.Eval ( src/Test/Hspec/Core/Runner/Eval.hs, nothing )
[2m[hspec-core] [m[42 of 52] Compiling Test.Hspec.Core.Extension.Tree ( src/Test/Hspec/Core/Extension/Tree.hs, nothing )
[2m[hspec-core] [m[43 of 52] Compiling Test.Hspec.Core.Extension.Spec ( src/Test/Hspec/Core/Extension/Spec.hs, nothing )
[2m[hspec-core] [m[44 of 52] Compiling Test.Hspec.Core.Extension.Item ( src/Test/Hspec/Core/Extension/Item.hs, nothing )
[2m[hspec-core] [m[45 of 52] Compiling Test.Hspec.Core.FailureReport ( src/Test/Hspec/Core/FailureReport.hs, nothing )
[2m[hspec-core] [m[46 of 52] Compiling Test.Hspec.Core.Extension.Config.Type ( src/Test/Hspec/Core/Extension/Config/Type.hs, nothing )
[2m[hspec-core] [m[47 of 52] Compiling Test.Hspec.Core.Extension.Option ( src/Test/Hspec/Core/Extension/Option.hs, nothing )
[2m[hspec-core] [m[48 of 52] Compiling Test.Hspec.Core.Extension.Config ( src/Test/Hspec/Core/Extension/Config.hs, nothing )
[2m[hspec-core] [m[49 of 52] Compiling Test.Hspec.Core.Extension ( src/Test/Hspec/Core/Extension.hs, nothing )
[2m[hspec-core] [m[50 of 52] Compiling Test.Hspec.Core.Config.Options ( src/Test/Hspec/Core/Config/Options.hs, nothing )
[2m[hspec-meta] [m[ 1 of 58] Compiling Control.Concurrent.Async ( vendor/Control/Concurrent/Async.hs, nothing )
[2m[hspec-core] [m[51 of 52] Compiling Test.Hspec.Core.Config ( src/Test/Hspec/Core/Config.hs, nothing )
[2m[hspec-core] [m[52 of 52] Compiling Test.Hspec.Core.Runner ( src/Test/Hspec/Core/Runner.hs, nothing )
[2m[hspec-core] [mHaddock coverage:
[2m[hspec-core] [mWarning: 'Async' is ambiguous. It is defined
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:233:16
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:233:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:233:1
[2m[hspec-core] [mWarning: 'Concurrently' is ambiguous. It is defined
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:899:26
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:899:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:899:1
[2m[hspec-core] [mWarning: 'ThreadId' is ambiguous. It is defined
[2m[hspec-core] [m    * in ‘GHC.Conc.Sync’
[2m[hspec-core] [m    * in ‘GHC.Conc.Sync’
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined in ‘GHC.Conc.Sync’
[2m[hspec-core] [mWarning: 'ExceptionInLinkedThread' is ambiguous. It is defined
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:606:3
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:605:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:605:1
[2m[hspec-core] [mWarning: 'AsyncCancelled' is ambiguous. It is defined
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:427:23
[2m[hspec-core] [m    * at vendor/Control/Concurrent/Async.hs:427:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:427:1
[2m[hspec-core] [mWarning: 'IO' is ambiguous. It is defined
[2m[hspec-core] [m    * in ‘GHC.Types’
[2m[hspec-core] [m    * in ‘GHC.Types’
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined in ‘GHC.Types’
[2m[hspec-core] [mWarning: Test.Hspec.Core.Compat: Could not find documentation for exported module: Test.Hspec.Core.Compat
[2m[hspec-core] [mWarning: 'n' is out of scope.
[2m[hspec-core] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hspec-core] [m 100% ( 15 / 15) in 'Test.Hspec.Core.Util'
[2m[hspec-core] [m  30% (  4 / 13) in 'Test.Hspec.Core.Format'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Format (src/Test/Hspec/Core/Format.hs:38)
[2m[hspec-core] [m    defaultFormatConfig (src/Test/Hspec/Core/Format.hs:85)
[2m[hspec-core] [m    Event (src/Test/Hspec/Core/Format.hs:53)
[2m[hspec-core] [m    Progress (src/Test/Hspec/Core/Example.hs:60)
[2m[hspec-core] [m    Seconds (src/Test/Hspec/Core/Clock.hs:26)
[2m[hspec-core] [m    Item (src/Test/Hspec/Core/Format.hs:40)
[2m[hspec-core] [m    Result (src/Test/Hspec/Core/Format.hs:47)
[2m[hspec-core] [m    FailureReason (src/Test/Hspec/Core/Example.hs:78)
[2m[hspec-core] [m    monadic (src/Test/Hspec/Core/Format.hs:106)
[2m[hspec-core] [mWarning: 'Summary' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Runner/Result.hs:82:16
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-core] [m  71% ( 41 / 57) in 'Test.Hspec.Core.Formatters.V2'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    silent (src/Test/Hspec/Core/Formatters/V2.hs:162)
[2m[hspec-core] [m    checks (src/Test/Hspec/Core/Formatters/V2.hs:173)
[2m[hspec-core] [m    specdoc (src/Test/Hspec/Core/Formatters/V2.hs:215)
[2m[hspec-core] [m    progress (src/Test/Hspec/Core/Formatters/V2.hs:261)
[2m[hspec-core] [m    failed_examples (src/Test/Hspec/Core/Formatters/V2.hs:271)
[2m[hspec-core] [m    Formatter (src/Test/Hspec/Core/Formatters/Internal.hs:73)
[2m[hspec-core] [m    Progress (src/Test/Hspec/Core/Example.hs:60)
[2m[hspec-core] [m    Item (src/Test/Hspec/Core/Format.hs:40)
[2m[hspec-core] [m    Result (src/Test/Hspec/Core/Format.hs:47)
[2m[hspec-core] [m    FailureReason (src/Test/Hspec/Core/Example.hs:78)
[2m[hspec-core] [m    FormatM (src/Test/Hspec/Core/Formatters/Internal.hs:219)
[2m[hspec-core] [m    formatterToFormat (src/Test/Hspec/Core/Formatters/Internal.hs:103)
[2m[hspec-core] [m    FailureRecord (src/Test/Hspec/Core/Formatters/Internal.hs:96)
[2m[hspec-core] [m    Seconds (src/Test/Hspec/Core/Clock.hs:26)
[2m[hspec-core] [m    writeTransient (src/Test/Hspec/Core/Formatters/Internal.hs:272)
[2m[hspec-core] [m    formatLocation (src/Test/Hspec/Core/Formatters/V2.hs:468)
[2m[hspec-core] [mWarning: 'FormatM' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Formatters/Internal.hs:219:1
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Formatters/V1/Monad.hs:136:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Formatters/V1/Monad.hs:136:1
[2m[hspec-core] [m  68% ( 26 / 38) in 'Test.Hspec.Core.Formatters.V1'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    silent (src/Test/Hspec/Core/Formatters/V1/Internal.hs:163)
[2m[hspec-core] [m    checks (src/Test/Hspec/Core/Formatters/V1/Internal.hs:177)
[2m[hspec-core] [m    specdoc (src/Test/Hspec/Core/Formatters/V1/Internal.hs:211)
[2m[hspec-core] [m    progress (src/Test/Hspec/Core/Formatters/V1/Internal.hs:250)
[2m[hspec-core] [m    failed_examples (src/Test/Hspec/Core/Formatters/V1/Internal.hs:260)
[2m[hspec-core] [m    Formatter (src/Test/Hspec/Core/Formatters/V1/Monad.hs:59)
[2m[hspec-core] [m    FailureReason (src/Test/Hspec/Core/Formatters/V1/Monad.hs:52)
[2m[hspec-core] [m    FormatM (src/Test/Hspec/Core/Formatters/V1/Monad.hs:136)
[2m[hspec-core] [m    formatterToFormat (src/Test/Hspec/Core/Formatters/V1/Internal.hs:109)
[2m[hspec-core] [m    FailureRecord (src/Test/Hspec/Core/Formatters/V1/Monad.hs:91)
[2m[hspec-core] [m    Seconds (src/Test/Hspec/Core/Clock.hs:26)
[2m[hspec-core] [m    writeTransient (src/Test/Hspec/Core/Formatters/V1/Monad.hs:232)
[2m[hspec-core] [m  50% (  1 /  2) in 'Test.Hspec.Core.Formatters'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Module header
[2m[hspec-core] [mWarning: GetOpt.Declarative: Could not find documentation for exported module: GetOpt.Declarative
[2m[hspec-core] [mWarning: 'SpecM' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Spec/Monad.hs:45:21
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-core] [mWarning: 'Args' is ambiguous. It is defined
[2m[hspec-core] [m    * in ‘Test.QuickCheck.Test’
[2m[hspec-core] [m    * in ‘Test.QuickCheck.Test’
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined in ‘Test.QuickCheck.Test’
[2m[hspec-core] [m 100% (  6 /  6) in 'Test.Hspec.Core.QuickCheck'
[2m[hspec-core] [mWarning: 'SpecM' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Spec/Monad.hs:45:21
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-core] [m  91% ( 22 / 24) in 'Test.Hspec.Core.Hooks'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Spec (src/Test/Hspec/Core/Spec/Monad.hs:35)
[2m[hspec-core] [m    SpecWith (src/Test/Hspec/Core/Spec/Monad.hs:37)
[2m[hspec-core] [m  62% ( 40 / 64) in 'Test.Hspec.Core.Spec'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Spec (src/Test/Hspec/Core/Spec/Monad.hs:35)
[2m[hspec-core] [m    SpecWith (src/Test/Hspec/Core/Spec/Monad.hs:37)
[2m[hspec-core] [m    mapSpecForest (src/Test/Hspec/Core/Spec/Monad.hs:72)
[2m[hspec-core] [m    mapSpecItem_ (src/Test/Hspec/Core/Spec/Monad.hs:80)
[2m[hspec-core] [m    modifyParams (src/Test/Hspec/Core/Spec/Monad.hs:83)
[2m[hspec-core] [m    Params (src/Test/Hspec/Core/Example.hs:49)
[2m[hspec-core] [m    defaultParams (src/Test/Hspec/Core/Example.hs:55)
[2m[hspec-core] [m    Progress (src/Test/Hspec/Core/Example.hs:60)
[2m[hspec-core] [m    ProgressCallback (src/Test/Hspec/Core/Example.hs:61)
[2m[hspec-core] [m    ResultStatus (src/Test/Hspec/Core/Example.hs:72)
[2m[hspec-core] [m    FailureReason (src/Test/Hspec/Core/Example.hs:78)
[2m[hspec-core] [m    safeEvaluate (src/Test/Hspec/Core/Example.hs:109)
[2m[hspec-core] [m    safeEvaluateExample (src/Test/Hspec/Core/Example.hs:106)
[2m[hspec-core] [m    bimapTree (src/Test/Hspec/Core/Tree.hs:58)
[2m[hspec-core] [m    bimapForest (src/Test/Hspec/Core/Tree.hs:55)
[2m[hspec-core] [m    filterTree (src/Test/Hspec/Core/Tree.hs:66)
[2m[hspec-core] [m    filterForest (src/Test/Hspec/Core/Tree.hs:69)
[2m[hspec-core] [m    filterTreeWithLabels (src/Test/Hspec/Core/Tree.hs:72)
[2m[hspec-core] [m    filterForestWithLabels (src/Test/Hspec/Core/Tree.hs:75)
[2m[hspec-core] [m    pruneTree (src/Test/Hspec/Core/Tree.hs:90)
[2m[hspec-core] [m    pruneForest (src/Test/Hspec/Core/Tree.hs:87)
[2m[hspec-core] [m    location (src/Test/Hspec/Core/Tree.hs:158)
[2m[hspec-core] [m    focusForest (src/Test/Hspec/Core/Spec.hs:153)
[2m[hspec-core] [m    Expectation
[2m[hspec-core] [m   0% (  0 /  4) in 'Test.Hspec.Core.Extension.Tree'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Module header
[2m[hspec-core] [m    SpecTree (src/Test/Hspec/Core/Extension/Tree.hs:13)
[2m[hspec-core] [m    mapItems (src/Test/Hspec/Core/Extension/Tree.hs:16)
[2m[hspec-core] [m    filterItems (src/Test/Hspec/Core/Extension/Tree.hs:19)
[2m[hspec-core] [m   0% (  0 /  2) in 'Test.Hspec.Core.Extension.Spec'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Module header
[2m[hspec-core] [m    mapItems (src/Test/Hspec/Core/Extension/Spec.hs:10)
[2m[hspec-core] [m  35% (  6 / 17) in 'Test.Hspec.Core.Extension.Item'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Module header
[2m[hspec-core] [m    Params (src/Test/Hspec/Core/Example.hs:49)
[2m[hspec-core] [m    Progress (src/Test/Hspec/Core/Example.hs:60)
[2m[hspec-core] [m    ProgressCallback (src/Test/Hspec/Core/Example.hs:61)
[2m[hspec-core] [m    ResultStatus (src/Test/Hspec/Core/Example.hs:72)
[2m[hspec-core] [m    FailureReason (src/Test/Hspec/Core/Example.hs:78)
[2m[hspec-core] [m    isFocused (src/Test/Hspec/Core/Extension/Item.hs:28)
[2m[hspec-core] [m    pending (src/Test/Hspec/Core/Extension/Item.hs:31)
[2m[hspec-core] [m    pendingWith (src/Test/Hspec/Core/Extension/Item.hs:37)
[2m[hspec-core] [m    setAnnotation (src/Test/Hspec/Core/Extension/Item.hs:43)
[2m[hspec-core] [m    getAnnotation (src/Test/Hspec/Core/Extension/Item.hs:46)
[2m[hspec-core] [m   0% (  0 /  6) in 'Test.Hspec.Core.Extension.Option'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Module header
[2m[hspec-core] [m    Option (src/Test/Hspec/Core/Extension/Config/Type.hs:23)
[2m[hspec-core] [m    flag (src/Test/Hspec/Core/Extension/Option.hs:18)
[2m[hspec-core] [m    argument (src/Test/Hspec/Core/Extension/Option.hs:21)
[2m[hspec-core] [m    noArgument (src/Test/Hspec/Core/Extension/Option.hs:27)
[2m[hspec-core] [m    optionalArgument (src/Test/Hspec/Core/Extension/Option.hs:24)
[2m[hspec-core] [m  33% (  3 /  9) in 'Test.Hspec.Core.Extension.Config'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Module header
[2m[hspec-core] [m    Config (src/Test/Hspec/Core/Config/Definition.hs:80)
[2m[hspec-core] [m    ColorMode (src/Test/Hspec/Core/Config/Definition.hs:74)
[2m[hspec-core] [m    UnicodeMode (src/Test/Hspec/Core/Config/Definition.hs:77)
[2m[hspec-core] [m    setAnnotation (src/Test/Hspec/Core/Extension/Config/Type.hs:26)
[2m[hspec-core] [m    getAnnotation (src/Test/Hspec/Core/Extension/Config/Type.hs:29)
[2m[hspec-core] [mWarning: 'getAnnotation' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Extension/Config/Type.hs:29:1
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Extension/Item.hs:46:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Extension/Item.hs:46:1
[2m[hspec-core] [mWarning: 'Config' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Config/Definition.hs:80:15
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-core] [mWarning: 'SpecM' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Spec/Monad.hs:45:21
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-core] [mWarning: 'setAnnotation' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Extension/Config/Type.hs:26:1
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Extension/Item.hs:43:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Extension/Item.hs:43:1
[2m[hspec-core] [mWarning: 'Item' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Tree.hs:107:15
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Tree.hs:107:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Tree.hs:107:1
[2m[hspec-core] [m  78% ( 18 / 23) in 'Test.Hspec.Core.Extension'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    Option (src/Test/Hspec/Core/Extension/Config/Type.hs:23)
[2m[hspec-core] [m    registerOptions (src/Test/Hspec/Core/Extension.hs:93)
[2m[hspec-core] [m    Config (src/Test/Hspec/Core/Config/Definition.hs:80)
[2m[hspec-core] [m    SpecWith (src/Test/Hspec/Core/Spec/Monad.hs:37)
[2m[hspec-core] [m    SpecTree (src/Test/Hspec/Core/Extension/Tree.hs:13)
[2m[hspec-core] [mWarning: 'Config' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Config/Definition.hs:80:15
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-core] [mWarning: 'Config' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Config/Definition.hs:80:15
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-core] [mWarning: 'Summary' is ambiguous. It is defined
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Runner/Result.hs:82:16
[2m[hspec-core] [m    * at src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-core] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-core] [m    by specifying the type/value namespace explicitly.
[2m[hspec-core] [m    Defaulting to the one defined at src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-core] [m  79% ( 34 / 43) in 'Test.Hspec.Core.Runner'
[2m[hspec-core] [m  Missing documentation for:
[2m[hspec-core] [m    evaluateResult (src/Test/Hspec/Core/Runner.hs:217)
[2m[hspec-core] [m    toSummary (src/Test/Hspec/Core/Runner/Result.hs:101)
[2m[hspec-core] [m    ResultItemStatus (src/Test/Hspec/Core/Runner/Result.hs:61)
[2m[hspec-core] [m    Config (src/Test/Hspec/Core/Config/Definition.hs:80)
[2m[hspec-core] [m    ColorMode (src/Test/Hspec/Core/Config/Definition.hs:74)
[2m[hspec-core] [m    UnicodeMode (src/Test/Hspec/Core/Config/Definition.hs:77)
[2m[hspec-core] [m    defaultConfig (src/Test/Hspec/Core/Config.hs:39)
[2m[hspec-core] [m    Spec (src/Test/Hspec/Core/Spec/Monad.hs:35)
[2m[hspec-core] [m    SpecWith (src/Test/Hspec/Core/Spec/Monad.hs:37)
[2m[hspec-meta] [m[ 2 of 58] Compiling Data.Algorithm.Diff ( vendor/Data/Algorithm/Diff.hs, nothing )
[2m[hspec-meta] [m[ 3 of 58] Compiling Paths_hspec_meta ( dist/build/autogen/Paths_hspec_meta.hs, nothing )
[2m[hspec-meta] [m[ 4 of 58] Compiling Test.Hspec.Core.Compat ( hspec-core/src/Test/Hspec/Core/Compat.hs, nothing )
[2m[hspec-meta] [m[ 5 of 58] Compiling Test.Hspec.Core.Clock ( hspec-core/src/Test/Hspec/Core/Clock.hs, nothing )
[2m[hspec-meta] [m[ 6 of 58] Compiling Test.Hspec.Core.Annotations ( hspec-core/src/Test/Hspec/Core/Annotations.hs, nothing )
[2m[hspec-meta] [m[ 7 of 58] Compiling NonEmpty         ( hspec-core/src/NonEmpty.hs, nothing )
[2m[hspec-meta] [m[ 8 of 58] Compiling GetOpt.Declarative.Types ( hspec-core/src/GetOpt/Declarative/Types.hs, nothing )
[2m[hspec-meta] [m[ 9 of 58] Compiling GetOpt.Declarative.Environment ( hspec-core/src/GetOpt/Declarative/Environment.hs, nothing )
[2m[hspec-meta] [m[10 of 58] Compiling Test.Hspec.Core.Example.Location ( hspec-core/src/Test/Hspec/Core/Example/Location.hs, nothing )
[2m[hspec-meta] [m[11 of 58] Compiling Test.Hspec.Core.Formatters.Diff ( hspec-core/src/Test/Hspec/Core/Formatters/Diff.hs, nothing )
[2m[hspec-meta] [m[12 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Parser.Parser ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Parser/Parser.hs, nothing )
[2m[hspec-meta] [m[13 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Parser ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Parser.hs, nothing )
[2m[hspec-meta] [m[14 of 58] Compiling Test.Hspec.Core.Formatters.Pretty.Unicode ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty/Unicode.hs, nothing )
[2m[hspec-meta] [m[15 of 58] Compiling Test.Hspec.Core.Formatters.Pretty ( hspec-core/src/Test/Hspec/Core/Formatters/Pretty.hs, nothing )
[2m[hspec-meta] [m[16 of 58] Compiling Test.Hspec.Core.Formatters.V1.Free ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Free.hs, nothing )
[2m[hspec-meta] [m[17 of 58] Compiling Test.Hspec.Core.Runner.JobQueue ( hspec-core/src/Test/Hspec/Core/Runner/JobQueue.hs, nothing )
[2m[hspec-meta] [m[18 of 58] Compiling Test.Hspec.Core.Timer ( hspec-core/src/Test/Hspec/Core/Timer.hs, nothing )
[2m[hspec-meta] [m[19 of 58] Compiling Test.Hspec.Core.Util ( hspec-core/src/Test/Hspec/Core/Util.hs, nothing )
[2m[hspec-meta] [m[20 of 58] Compiling Test.Hspec.Core.QuickCheck.Util ( hspec-core/src/Test/Hspec/Core/QuickCheck/Util.hs, nothing )
[2m[hspec-core] [mWarning: Test.Hspec.Core.Formatters.V1: could not find link destinations for: 
[2m[hspec-core] [m	- Test.Hspec.Core.Formatters.V1.Free.Free
[2m[hspec-core] [m	- Test.Hspec.Core.Formatters.V1.Monad.FormatF
[2m[hspec-core] [mWarning: Test.Hspec.Core.QuickCheck: could not find link destinations for: 
[2m[hspec-core] [m	- Test.Hspec.Core.QuickCheck.D:R:ArgFUN
[2m[hspec-core] [m	- Test.Hspec.Core.QuickCheck.D:R:ArgProperty
[2m[hspec-meta] [m[21 of 58] Compiling Test.Hspec.Core.Example ( hspec-core/src/Test/Hspec/Core/Example.hs, nothing )
[2m[hspec-meta] [m[22 of 58] Compiling Test.Hspec.Core.Tree ( hspec-core/src/Test/Hspec/Core/Tree.hs, nothing )
[2m[hspec-meta] [m[23 of 58] Compiling Test.Hspec.Core.Shuffle ( hspec-core/src/Test/Hspec/Core/Shuffle.hs, nothing )
[2m[hspec-meta] [m[24 of 58] Compiling Test.Hspec.Core.Format ( hspec-core/src/Test/Hspec/Core/Format.hs, nothing )
[2m[hspec-meta] [m[25 of 58] Compiling Test.Hspec.Core.Runner.Result ( hspec-core/src/Test/Hspec/Core/Runner/Result.hs, nothing )
[2m[hspec-core] [mWarning: Test.Hspec.Core.Spec: could not find link destinations for: 
[2m[hspec-core] [m	- Test.Hspec.Core.Annotations.Annotations
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgFUN
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgIO
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgFUN0
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgBool
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgFUN1
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgResult
[2m[hspec-core] [m	- Test.Hspec.Core.Spec.Monad.Env
[2m[hspec-core] [m	- Test.Hspec.Core.QuickCheck.D:R:ArgFUN
[2m[hspec-core] [m	- Test.Hspec.Core.QuickCheck.D:R:ArgProperty
[2m[hspec-core] [mWarning: Test.Hspec.Core.Extension.Item: could not find link destinations for: 
[2m[hspec-core] [m	- Test.Hspec.Core.Annotations.Annotations
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgFUN1
[2m[hspec-core] [m	- Test.Hspec.Core.Example.D:R:ArgResult
[2m[hspec-core] [mWarning: Test.Hspec.Core.Extension.Config: could not find link destinations for: 
[2m[hspec-core] [m	- Test.Hspec.Core.Annotations.Annotations
[2m[hspec-core] [mWarning: Test.Hspec.Core.Runner: could not find link destinations for: 
[2m[hspec-core] [m	- Test.Hspec.Core.Annotations.Annotations
[2m[hspec-meta] [m[26 of 58] Compiling Test.Hspec.Core.Formatters.V1.Monad ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Monad.hs, nothing )
[2m[hspec-meta] [m[27 of 58] Compiling Test.Hspec.Core.Formatters.Internal ( hspec-core/src/Test/Hspec/Core/Formatters/Internal.hs, nothing )
[2m[hspec-meta] [m[28 of 58] Compiling Test.Hspec.Core.Formatters.V2 ( hspec-core/src/Test/Hspec/Core/Formatters/V2.hs, nothing )
[2m[hspec-meta] [m[29 of 58] Compiling Test.Hspec.Core.Runner.PrintSlowSpecItems ( hspec-core/src/Test/Hspec/Core/Runner/PrintSlowSpecItems.hs, nothing )
[2m[hspec-meta] [m[30 of 58] Compiling Test.Hspec.Core.Formatters.V1.Internal ( hspec-core/src/Test/Hspec/Core/Formatters/V1/Internal.hs, nothing )
[2m[hspec-meta] [m[31 of 58] Compiling Test.Hspec.Core.Formatters.V1 ( hspec-core/src/Test/Hspec/Core/Formatters/V1.hs, nothing )
[2m[hspec-meta] [m[32 of 58] Compiling Test.Hspec.Core.Formatters ( hspec-core/src/Test/Hspec/Core/Formatters.hs, nothing )
[2m[hspec-meta] [m[33 of 58] Compiling GetOpt.Declarative.Util ( hspec-core/src/GetOpt/Declarative/Util.hs, nothing )
[2m[hspec-meta] [m[34 of 58] Compiling GetOpt.Declarative.Interpret ( hspec-core/src/GetOpt/Declarative/Interpret.hs, nothing )
[2m[hspec-meta] [m[35 of 58] Compiling GetOpt.Declarative ( hspec-core/src/GetOpt/Declarative.hs, nothing )
[2m[hspec-meta] [m[36 of 58] Compiling Test.Hspec.Core.Config.Definition ( hspec-core/src/Test/Hspec/Core/Config/Definition.hs, nothing )
[2m[hspec-meta] [m[37 of 58] Compiling Test.Hspec.Core.Spec.Monad ( hspec-core/src/Test/Hspec/Core/Spec/Monad.hs, nothing )
[2m[hspec-meta] [m[38 of 58] Compiling Test.Hspec.Core.QuickCheck ( hspec-core/src/Test/Hspec/Core/QuickCheck.hs, nothing )
[2m[hspec-meta] [m[39 of 58] Compiling Test.Hspec.Core.Hooks ( hspec-core/src/Test/Hspec/Core/Hooks.hs, nothing )
[2m[hspec-meta] [m[40 of 58] Compiling Test.Hspec.Core.Spec ( hspec-core/src/Test/Hspec/Core/Spec.hs, nothing )
[2m[hspec-meta] [m[41 of 58] Compiling Test.Hspec.Core.Runner.Eval ( hspec-core/src/Test/Hspec/Core/Runner/Eval.hs, nothing )
[2m[hspec-meta] [m[42 of 58] Compiling Test.Hspec.Core.Extension.Tree ( hspec-core/src/Test/Hspec/Core/Extension/Tree.hs, nothing )
[2m[hspec-meta] [m[43 of 58] Compiling Test.Hspec.Core.Extension.Spec ( hspec-core/src/Test/Hspec/Core/Extension/Spec.hs, nothing )
[2m[hspec-meta] [m[44 of 58] Compiling Test.Hspec.Core.Extension.Item ( hspec-core/src/Test/Hspec/Core/Extension/Item.hs, nothing )
[2m[hspec-meta] [m[45 of 58] Compiling Test.Hspec.Core.FailureReport ( hspec-core/src/Test/Hspec/Core/FailureReport.hs, nothing )
[2m[hspec-meta] [m[46 of 58] Compiling Test.Hspec.Core.Extension.Config.Type ( hspec-core/src/Test/Hspec/Core/Extension/Config/Type.hs, nothing )
[2m[hspec-meta] [m[47 of 58] Compiling Test.Hspec.Core.Extension.Option ( hspec-core/src/Test/Hspec/Core/Extension/Option.hs, nothing )
[2m[hspec-meta] [m[48 of 58] Compiling Test.Hspec.Core.Extension.Config ( hspec-core/src/Test/Hspec/Core/Extension/Config.hs, nothing )
[2m[hspec-meta] [m[49 of 58] Compiling Test.Hspec.Core.Extension ( hspec-core/src/Test/Hspec/Core/Extension.hs, nothing )
[2m[hspec-meta] [m[50 of 58] Compiling Test.Hspec.Core.Config.Options ( hspec-core/src/Test/Hspec/Core/Config/Options.hs, nothing )
[2m[hspec-meta] [m[51 of 58] Compiling Test.Hspec.Core.Config ( hspec-core/src/Test/Hspec/Core/Config.hs, nothing )
[2m[hspec-meta] [m[52 of 58] Compiling Test.Hspec.Core.Runner ( hspec-core/src/Test/Hspec/Core/Runner.hs, nothing )
[2m[hspec-meta] [m[53 of 58] Compiling Test.Hspec.Discover ( hspec/src/Test/Hspec/Discover.hs, nothing )
[2m[hspec-meta] [m[54 of 58] Compiling Test.Hspec.Formatters ( hspec/src/Test/Hspec/Formatters.hs, nothing )
[2m[hspec-meta] [m[55 of 58] Compiling Test.Hspec.Runner ( hspec/src/Test/Hspec/Runner.hs, nothing )
[2m[hspec-meta] [m[56 of 58] Compiling Test.Hspec       ( hspec/src/Test/Hspec.hs, nothing )
[2m[hspec-meta] [m[57 of 58] Compiling Test.Hspec.QuickCheck ( hspec/src/Test/Hspec/QuickCheck.hs, nothing )
[2m[hspec-meta] [m[58 of 58] Compiling Test.Hspec.Meta  ( src/Test/Hspec/Meta.hs, nothing )
[2m[hspec-meta] [mHaddock coverage:
[2m[hspec-meta] [mWarning: 'Async' is ambiguous. It is defined
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:233:16
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:233:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:233:1
[2m[hspec-meta] [mWarning: 'Concurrently' is ambiguous. It is defined
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:899:26
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:899:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:899:1
[2m[hspec-meta] [mWarning: 'ThreadId' is ambiguous. It is defined
[2m[hspec-meta] [m    * in ‘GHC.Conc.Sync’
[2m[hspec-meta] [m    * in ‘GHC.Conc.Sync’
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined in ‘GHC.Conc.Sync’
[2m[hspec-meta] [mWarning: 'ExceptionInLinkedThread' is ambiguous. It is defined
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:606:3
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:605:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:605:1
[2m[hspec-meta] [mWarning: 'AsyncCancelled' is ambiguous. It is defined
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:427:23
[2m[hspec-meta] [m    * at vendor/Control/Concurrent/Async.hs:427:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at vendor/Control/Concurrent/Async.hs:427:1
[2m[hspec-meta] [mWarning: 'IO' is ambiguous. It is defined
[2m[hspec-meta] [m    * in ‘GHC.Types’
[2m[hspec-meta] [m    * in ‘GHC.Types’
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined in ‘GHC.Types’
[2m[hspec-meta] [mWarning: Test.Hspec.Core.Compat: Could not find documentation for exported module: Test.Hspec.Core.Compat
[2m[hspec-meta] [mWarning: 'n' is out of scope.
[2m[hspec-meta] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hspec-meta] [mWarning: 'Summary' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Runner/Result.hs:82:16
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-meta] [mWarning: 'FormatM' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Formatters/Internal.hs:219:1
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Formatters/V1/Monad.hs:136:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Formatters/V1/Monad.hs:136:1
[2m[hspec-meta] [mWarning: GetOpt.Declarative: Could not find documentation for exported module: GetOpt.Declarative
[2m[hspec-meta] [mWarning: 'SpecM' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:21
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-meta] [mWarning: 'Args' is ambiguous. It is defined
[2m[hspec-meta] [m    * in ‘Test.QuickCheck.Test’
[2m[hspec-meta] [m    * in ‘Test.QuickCheck.Test’
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined in ‘Test.QuickCheck.Test’
[2m[hspec-meta] [mWarning: 'SpecM' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:21
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-meta] [mWarning: 'getAnnotation' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Extension/Config/Type.hs:29:1
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Extension/Item.hs:46:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Extension/Item.hs:46:1
[2m[hspec-meta] [mWarning: 'Config' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:15
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-meta] [mWarning: 'SpecM' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:21
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:45:1
[2m[hspec-meta] [mWarning: 'setAnnotation' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Extension/Config/Type.hs:26:1
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Extension/Item.hs:43:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Extension/Item.hs:43:1
[2m[hspec-meta] [mWarning: 'Item' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Tree.hs:107:15
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Tree.hs:107:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Tree.hs:107:1
[2m[hspec-meta] [mWarning: 'Config' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:15
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-meta] [mWarning: 'Config' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:15
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Config/Definition.hs:80:1
[2m[hspec-meta] [mWarning: 'Summary' is ambiguous. It is defined
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Runner/Result.hs:82:16
[2m[hspec-meta] [m    * at hspec-core/src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-meta] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hspec-meta] [m    by specifying the type/value namespace explicitly.
[2m[hspec-meta] [m    Defaulting to the one defined at hspec-core/src/Test/Hspec/Core/Runner/Result.hs:82:1
[2m[hspec-meta] [m  37% (  3 /  8) in 'Test.Hspec.Discover'
[2m[hspec-meta] [m  Missing documentation for:
[2m[hspec-meta] [m    Module header
[2m[hspec-meta] [m    Spec (hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:35)
[2m[hspec-meta] [m    IsFormatter (hspec/src/Test/Hspec/Discover.hs:19)
[2m[hspec-meta] [m    hspecWithFormatter (hspec/src/Test/Hspec/Discover.hs:29)
[2m[hspec-meta] [m    postProcessSpec (hspec/src/Test/Hspec/Discover.hs:34)
[2m[hspec-meta] [m  83% ( 55 / 66) in 'Test.Hspec.Meta'
[2m[hspec-meta] [m  Missing documentation for:
[2m[hspec-meta] [m    Module header
[2m[hspec-meta] [m    Arg (hspec-core/src/Test/Hspec/Core/Example.hs:45)
[2m[hspec-meta] [m    Expectation
[2m[hspec-meta] [m    expectationFailure
[2m[hspec-meta] [m    anyException
[2m[hspec-meta] [m    anyErrorCall
[2m[hspec-meta] [m    errorCall
[2m[hspec-meta] [m    anyIOException
[2m[hspec-meta] [m    anyArithException
[2m[hspec-meta] [m    Spec (hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:35)
[2m[hspec-meta] [m    SpecWith (hspec-core/src/Test/Hspec/Core/Spec/Monad.hs:37)
[2m[hspec-meta] [mWarning: Test.Hspec.Discover: could not find link destinations for: 
[2m[hspec-meta] [m	- Test.Hspec.Core.Formatters.V1.Monad.Formatter
[2m[hspec-meta] [m	- Test.Hspec.Core.Runner.evalSpec
[2m[hspec-meta] [m	- Test.Hspec.Core.Runner.runSpecForest
[2m[hspec-meta] [mWarning: Test.Hspec.Meta: could not find link destinations for: 
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.Result
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.ProgressCallback
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.Params
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.evaluateExample
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.D:R:ArgFUN
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.D:R:ArgIO
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.D:R:ArgFUN0
[2m[hspec-meta] [m	- Test.Hspec.Core.Example.D:R:ArgBool
[2m[hspec-meta] [m	- Test.Hspec.Core.Runner.Result.Summary
[2m[hspec-meta] [m	- Test.Hspec.Core.Spec.Monad.SpecM
[2m[hspec-meta] [m	- Test.Hspec.Core.QuickCheck.D:R:ArgFUN
[2m[hspec-meta] [m	- Test.Hspec.Core.QuickCheck.D:R:ArgProperty
[2m[hspec-meta] [m	- Test.Hspec.Core.Runner.evalSpec
[2m[hspec-meta] [m	- Test.Hspec.Core.Runner.runSpecForest
[2m[hspec-core] [mDocumentation created: dist/doc/html/hspec-core/,
[2m[hspec-core] [mdist/doc/html/hspec-core/hspec-core.txt
[2m[hspec-core] [m[1;36mPhase: installPhase[m
[2m[hspec-core] [mInstalling library in /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec-core] [m[1;36mPhase: fixupPhase[m
[2m[hspec-core] [mshrinking RPATHs of ELF executables and libraries in /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12
[2m[hspec-core] [mshrinking /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHShspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY-ghc9.8.1.so
[2m[hspec-core] [mchecking for references to /build/ in /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12...
[2m[hspec-core] [mpatching script interpreter paths in /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12
[2m[hspec-core] [mstripping (with command strip and flags -S -p) in  /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12/lib
[2m[hspec-core] [mshrinking RPATHs of ELF executables and libraries in /nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc
[2m[hspec-core] [mchecking for references to /build/ in /nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc...
[2m[hspec-meta] [mDocumentation created: dist/doc/html/hspec-meta/,
[2m[hspec-meta] [mdist/doc/html/hspec-meta/hspec-meta.txt
[2m[hspec-core] [mpatching script interpreter paths in /nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc
[2m[hspec-core:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12[m
[2m[hspec-core:post-build] [m[2mPushing 2 paths (93 are already present) using zstd to cache sellout ⏳[m
[2m[hspec-core:post-build] [m[2m[m
[2m[hspec-core:post-build] [m[2mPushing /nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc (5.39 MiB)[m
[2m[hspec-core:post-build] [m[2mPushing /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12 (19.18 MiB)[m
[2m[hspec-core:post-build] [m[2m[m
[2m[hspec-core:post-build] [m[2mAll done.[m
[2m[hspec-core:post-build] [m[2mUploading to the NixCI cache: /nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc /nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12[m
[2m[hspec-core:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec-core:post-build] [m[2mcopying 2 paths...[m
[2m[hspec-core:post-build] [m[2mcopying path '/nix/store/j37m9ciw8cijj2bfvv5cq30hm1ywsc6p-hspec-core-2.11.12-doc' to 'https://cache.nix-ci.com'...[m
[2m[hspec-core:post-build] [m[2mcopying path '/nix/store/szmmasfckxrn9d7r8r1jf7g7dppzycd7-hspec-core-2.11.12' to 'https://cache.nix-ci.com'...[m
[2m[hspec-core:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec-core:post-build] [m[2mcopying 1 paths...[m
[2m[hspec-core:post-build] [m[2mcopying path '/nix/store/iba620li3zgp1ipaycx0f31rcndz2wsw-hspec-core-2.11.12.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 6 of 68 built (1 building)[m
[2m[hspec-meta] [mPreprocessing executable 'hspec-meta-discover' for hspec-meta-2.11.12..
[2m[hspec-meta] [m[1;36mPhase: installPhase[m
[2m[hspec-meta] [mInstalling library in /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-meta] [mInstalling executable hspec-meta-discover in /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/bin
[2m[hspec-meta] [mWarning: The directory
[2m[hspec-meta] [m/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/bin is not in
[2m[hspec-meta] [mthe system search path.
[2m[hspec-meta] [m[1;36mPhase: fixupPhase[m
[2m[hspec-meta] [mshrinking RPATHs of ELF executables and libraries in /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12
[2m[hspec-meta] [mshrinking /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHShspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG-ghc9.8.1.so
[2m[hspec-meta] [mshrinking /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/bin/hspec-meta-discover
[2m[hspec-meta] [mchecking for references to /build/ in /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12...
[2m[hspec-meta] [mpatching script interpreter paths in /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12
[2m[hspec-meta] [mstripping (with command strip and flags -S -p) in  /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/lib /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12/bin
[2m[hspec-meta] [mshrinking RPATHs of ELF executables and libraries in /nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc
[2m[hspec-meta] [mchecking for references to /build/ in /nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc...
[2m[hspec-meta] [mpatching script interpreter paths in /nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc
[2m[hspec-meta:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12[m
[2m[hspec-meta:post-build] [m[2mPushing 2 paths (93 are already present) using zstd to cache sellout ⏳[m
[2m[hspec-meta:post-build] [m[2m[m
[2m[hspec-meta:post-build] [m[2mPushing /nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc (4.59 MiB)[m
[2m[hspec-meta:post-build] [m[2mPushing /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12 (21.83 MiB)[m
[2m[hspec-meta:post-build] [m[2m[m
[2m[hspec-meta:post-build] [m[2mAll done.[m
[2m[hspec-meta:post-build] [m[2mUploading to the NixCI cache: /nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc /nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12[m
[2m[hspec-meta:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec-meta:post-build] [m[2mcopying 2 paths...[m
[2m[hspec-meta:post-build] [m[2mcopying path '/nix/store/ccd2bgnkxzzdjm5vmzvgz800w42vbk3c-hspec-meta-2.11.12-doc' to 'https://cache.nix-ci.com'...[m
[2m[hspec-meta:post-build] [m[2mcopying path '/nix/store/j9ikad5rf1njxdp05npj1b0mirk091ps-hspec-meta-2.11.12' to 'https://cache.nix-ci.com'...[m
[2m[hspec-meta:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec-meta:post-build] [m[2mcopying 1 paths...[m
[2m[hspec-meta:post-build] [m[2mcopying path '/nix/store/h26g0wk67n1ch6afnw4k6y4x5j3j8pag-hspec-meta-2.11.12.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 7 of 68 built[m
[1;34mBuilding /nix/store/c28annkf37jwjin6pnlyrc3g4mbqgysh-hspec-discover-2.11.12.drv[m
[2m[hspec-discover] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[hspec-discover] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[hspec-discover] [m[1;36mPhase: unpackPhase[m
[2m[hspec-discover] [munpacking source archive /nix/store/yg1859bzn39kjlyc89qwm5qkmvxs255c-hspec-discover-2.11.12.tar.gz
[2m[hspec-discover] [msource root is hspec-discover-2.11.12
[2m[hspec-discover] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "hspec-discover-2.11.12/version.yaml"
[2m[hspec-discover] [m[1;36mPhase: patchPhase[m
[2m[hspec-discover] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[hspec-discover] [msetupCompileFlags: -package-db=/build/tmp.iRtvJjNcIt/setup-package.conf.d -threaded
[2m[hspec-discover] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.iRtvJjNcIt/Main.o )
[2m[hspec-discover] [m[2 of 2] Linking Setup
[2m[hspec-discover] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[hspec-discover] [m[1;36mPhase: configurePhase[m
[2m[hspec-discover] [mconfigureFlags: --verbose --prefix=/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc/share/doc/hspec-discover-2.11.12 --with-gcc=gcc --package-db=/build/tmp.iRtvJjNcIt/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[hspec-discover] [mUsing Parsec parser
[2m[hspec-discover] [mConfiguring hspec-discover-2.11.12...
[2m[hspec-discover] [mDependency base >=4.5.0.0 && <5: using base-4.19.0.0
[2m[hspec-discover] [mDependency directory: using directory-1.3.8.1
[2m[hspec-discover] [mDependency filepath: using filepath-1.4.100.4
[2m[hspec-discover] [mDependency base >=4.5.0.0 && <5: using base-4.19.0.0
[2m[hspec-discover] [mDependency directory: using directory-1.3.8.1
[2m[hspec-discover] [mDependency filepath: using filepath-1.4.100.4
[2m[hspec-discover] [mDependency hspec-discover: using hspec-discover-2.11.12
[2m[hspec-discover] [mDependency QuickCheck >=2.7: using QuickCheck-2.14.3
[2m[hspec-discover] [mDependency base >=4.5.0.0 && <5: using base-4.19.0.0
[2m[hspec-discover] [mDependency directory: using directory-1.3.8.1
[2m[hspec-discover] [mDependency filepath: using filepath-1.4.100.4
[2m[hspec-discover] [mDependency hspec-discover: using hspec-discover-2.11.12
[2m[hspec-discover] [mDependency hspec-meta ==2.11.12: using hspec-meta-2.11.12
[2m[hspec-discover] [mDependency mockery >=0.3.5: using mockery-0.3.5
[2m[hspec-discover] [mSource component graph:
[2m[hspec-discover] [m    component lib
[2m[hspec-discover] [m    component exe:hspec-discover dependency lib
[2m[hspec-discover] [m    component test:spec dependency lib
[2m[hspec-discover] [mConfigured component graph:
[2m[hspec-discover] [m    component hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m        include base-4.19.0.0-b960
[2m[hspec-discover] [m        include directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m    component hspec-discover-2.11.12-EBfzbbep8wQ2pnOFekS5eC-hspec-discover
[2m[hspec-discover] [m        include base-4.19.0.0-b960
[2m[hspec-discover] [m        include directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        include hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m    component hspec-discover-2.11.12-GYdSWWfHcmW9oflz8BGukr-spec
[2m[hspec-discover] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-discover] [m        include base-4.19.0.0-b960
[2m[hspec-discover] [m        include directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        include hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m        include hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-discover] [m        include mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[hspec-discover] [mLinked component graph:
[2m[hspec-discover] [m    unit hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m        include base-4.19.0.0-b960
[2m[hspec-discover] [m        include directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        Test.Hspec.Discover.Config=hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP:Test.Hspec.Discover.Config,Test.Hspec.Discover.Run=hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP:Test.Hspec.Discover.Run,Test.Hspec.Discover.Sort=hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP:Test.Hspec.Discover.Sort
[2m[hspec-discover] [m    unit hspec-discover-2.11.12-EBfzbbep8wQ2pnOFekS5eC-hspec-discover
[2m[hspec-discover] [m        include base-4.19.0.0-b960
[2m[hspec-discover] [m        include directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        include hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m    unit hspec-discover-2.11.12-GYdSWWfHcmW9oflz8BGukr-spec
[2m[hspec-discover] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-discover] [m        include base-4.19.0.0-b960
[2m[hspec-discover] [m        include directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        include filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        include hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m        include hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-discover] [m        include mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[hspec-discover] [mReady component graph:
[2m[hspec-discover] [m    definite hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m        depends base-4.19.0.0-b960
[2m[hspec-discover] [m        depends directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        depends filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m    definite hspec-discover-2.11.12-EBfzbbep8wQ2pnOFekS5eC-hspec-discover
[2m[hspec-discover] [m        depends base-4.19.0.0-b960
[2m[hspec-discover] [m        depends directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        depends filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        depends hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m    definite hspec-discover-2.11.12-GYdSWWfHcmW9oflz8BGukr-spec
[2m[hspec-discover] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec-discover] [m        depends base-4.19.0.0-b960
[2m[hspec-discover] [m        depends directory-1.3.8.1-6a8e
[2m[hspec-discover] [m        depends filepath-1.4.100.4-fa1c
[2m[hspec-discover] [m        depends hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [m        depends hspec-meta-2.11.12-LRfm3qmuRVS3Q7EgzfF8GG
[2m[hspec-discover] [m        depends mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
[2m[hspec-discover] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[hspec-discover] [mUsing compiler: ghc-9.8.1
[2m[hspec-discover] [mUsing install prefix:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12
[2m[hspec-discover] [mExecutables installed in:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/bin
[2m[hspec-discover] [mLibraries installed in:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [mDynamic Libraries installed in:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[hspec-discover] [mPrivate executables installed in:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/libexec/x86_64-linux-ghc-9.8.1/hspec-discover-2.11.12
[2m[hspec-discover] [mData files installed in:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/share/x86_64-linux-ghc-9.8.1/hspec-discover-2.11.12
[2m[hspec-discover] [mDocumentation installed in:
[2m[hspec-discover] [m/nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc/share/doc/hspec-discover-2.11.12
[2m[hspec-discover] [mConfiguration files installed in:
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/etc
[2m[hspec-discover] [mNo alex found
[2m[hspec-discover] [mUsing ar found on system at:
[2m[hspec-discover] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[hspec-discover] [mNo c2hs found
[2m[hspec-discover] [mNo cpphs found
[2m[hspec-discover] [mNo doctest found
[2m[hspec-discover] [mUsing gcc version 14.3.0 given by user at:
[2m[hspec-discover] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[hspec-discover] [mUsing ghc version 9.8.1 found on system at:
[2m[hspec-discover] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[hspec-discover] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[hspec-discover] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[hspec-discover] [mNo ghcjs found
[2m[hspec-discover] [mNo ghcjs-pkg found
[2m[hspec-discover] [mNo greencard found
[2m[hspec-discover] [mUsing haddock version 2.30.0 found on system at:
[2m[hspec-discover] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[hspec-discover] [mNo happy found
[2m[hspec-discover] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[hspec-discover] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[hspec-discover] [mNo hmake found
[2m[hspec-discover] [mUsing hpc version 0.69 found on system at:
[2m[hspec-discover] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[hspec-discover] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[hspec-discover] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[hspec-discover] [mUsing hscolour version 1.25 found on system at:
[2m[hspec-discover] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[hspec-discover] [mNo jhc found
[2m[hspec-discover] [mUsing ld found on system at:
[2m[hspec-discover] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[hspec-discover] [mNo pkg-config found
[2m[hspec-discover] [mUsing runghc version 9.8.1 found on system at:
[2m[hspec-discover] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[hspec-discover] [mUsing strip version 2.44 found on system at:
[2m[hspec-discover] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[hspec-discover] [mUsing tar found on system at:
[2m[hspec-discover] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[hspec-discover] [mNo uhc found
[2m[hspec-discover] [m[1;36mPhase: buildPhase[m
[2m[hspec-discover] [mPreprocessing library for hspec-discover-2.11.12..
[2m[hspec-discover] [mBuilding library for hspec-discover-2.11.12..
[2m[hspec-discover] [m[1 of 4] Compiling Paths_hspec_discover ( dist/build/autogen/Paths_hspec_discover.hs, dist/build/Paths_hspec_discover.o, dist/build/Paths_hspec_discover.dyn_o )
[2m[hspec-discover] [m[2 of 4] Compiling Test.Hspec.Discover.Config ( src/Test/Hspec/Discover/Config.hs, dist/build/Test/Hspec/Discover/Config.o, dist/build/Test/Hspec/Discover/Config.dyn_o )
[2m[hspec-discover] [m[3 of 4] Compiling Test.Hspec.Discover.Sort ( src/Test/Hspec/Discover/Sort.hs, dist/build/Test/Hspec/Discover/Sort.o, dist/build/Test/Hspec/Discover/Sort.dyn_o )
[2m[hspec-discover] [m[4 of 4] Compiling Test.Hspec.Discover.Run ( src/Test/Hspec/Discover/Run.hs, dist/build/Test/Hspec/Discover/Run.o, dist/build/Test/Hspec/Discover/Run.dyn_o )
[2m[hspec-discover] [m[1 of 4] Compiling Paths_hspec_discover ( dist/build/autogen/Paths_hspec_discover.hs, dist/build/Paths_hspec_discover.p_o )
[2m[hspec-discover] [m[2 of 4] Compiling Test.Hspec.Discover.Config ( src/Test/Hspec/Discover/Config.hs, dist/build/Test/Hspec/Discover/Config.p_o )
[2m[hspec-discover] [m[3 of 4] Compiling Test.Hspec.Discover.Sort ( src/Test/Hspec/Discover/Sort.hs, dist/build/Test/Hspec/Discover/Sort.p_o )
[2m[hspec-discover] [m[4 of 4] Compiling Test.Hspec.Discover.Run ( src/Test/Hspec/Discover/Run.hs, dist/build/Test/Hspec/Discover/Run.p_o )
[2m[hspec-discover] [mPreprocessing executable 'hspec-discover' for hspec-discover-2.11.12..
[2m[hspec-discover] [mBuilding executable 'hspec-discover' for hspec-discover-2.11.12..
[2m[hspec-discover] [m[1 of 2] Compiling Main             ( driver/hspec-discover.hs, dist/build/hspec-discover/hspec-discover-tmp/Main.o )
[2m[hspec-discover] [m[2 of 2] Compiling Paths_hspec_discover ( dist/build/hspec-discover/autogen/Paths_hspec_discover.hs, dist/build/hspec-discover/hspec-discover-tmp/Paths_hspec_discover.o )
[2m[hspec-discover] [m[3 of 3] Linking dist/build/hspec-discover/hspec-discover
[2m[hspec-discover] [mPreprocessing test suite 'spec' for hspec-discover-2.11.12..
[2m[hspec-discover] [mBuilding test suite 'spec' for hspec-discover-2.11.12..
[2m[hspec-discover] [m[1 of 6] Compiling Helper           ( test/Helper.hs, dist/build/spec/spec-tmp/Helper.o )
[2m[hspec-discover] [m[2 of 6] Compiling Paths_hspec_discover ( dist/build/spec/autogen/Paths_hspec_discover.hs, dist/build/spec/spec-tmp/Paths_hspec_discover.o )
[2m[hspec-discover] [m[3 of 6] Compiling Test.Hspec.Discover.ConfigSpec ( test/Test/Hspec/Discover/ConfigSpec.hs, dist/build/spec/spec-tmp/Test/Hspec/Discover/ConfigSpec.o )
[2m[hspec-discover] [m[4 of 6] Compiling Test.Hspec.Discover.RunSpec ( test/Test/Hspec/Discover/RunSpec.hs, dist/build/spec/spec-tmp/Test/Hspec/Discover/RunSpec.o )
[2m[hspec-discover] [m[5 of 6] Compiling Test.Hspec.Discover.SortSpec ( test/Test/Hspec/Discover/SortSpec.hs, dist/build/spec/spec-tmp/Test/Hspec/Discover/SortSpec.o )
[2m[hspec-discover] [m[6 of 6] Compiling Main             ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
[2m[hspec-discover] [m[7 of 7] Linking dist/build/spec/spec
[2m[hspec-discover] [m[1;36mPhase: checkPhase[m
[2m[hspec-discover] [mRunning 1 test suites...
[2m[hspec-discover] [mTest suite spec: RUNNING...
[2m[hspec-discover] [m
[2m[hspec-discover] [mTest.Hspec.Discover.Config
[2m[hspec-discover] [m  parseConfig
[2m[hspec-discover] [m    recognizes --nested [✔]
[2m[hspec-discover] [m    recognizes --formatter [✔]
[2m[hspec-discover] [m    recognizes --no-main [✔]
[2m[hspec-discover] [m    returns error message on unrecognized option [✔]
[2m[hspec-discover] [m    returns error message on unexpected argument [✔]
[2m[hspec-discover] [m    returns error message on --formatter=<fmt> with --no-main [✔]
[2m[hspec-discover] [m    when option is given multiple times
[2m[hspec-discover] [m      gives the last occurrence precedence [✔]
[2m[hspec-discover] [mTest.Hspec.Discover.Run
[2m[hspec-discover] [m  run
[2m[hspec-discover] [m    generates a test driver [✔]
[2m[hspec-discover] [mhspec-discover: WARNING - The `--no-main' option is deprecated and will be removed in a future release!
[2m[hspec-discover] [m    generates a test driver with no Main/main [✔]
[2m[hspec-discover] [m    generates a test driver with hooks [✔]
[2m[hspec-discover] [m    generates a test driver for an empty directory [✔]
[2m[hspec-discover] [m  pathToModule
[2m[hspec-discover] [m    derives module name from a given path [✔]
[2m[hspec-discover] [m  driverWithFormatter
[2m[hspec-discover] [m    generates a test driver that uses a custom formatter [✔]
[2m[hspec-discover] [m  moduleNameFromId
[2m[hspec-discover] [m    returns the module name of a fully qualified identifier [✔]
[2m[hspec-discover] [m  importList
[2m[hspec-discover] [m    generates imports for a list of specs [✔]
[2m[hspec-discover] [m  discover
[2m[hspec-discover] [m    discovers spec files [✔]
[2m[hspec-discover] [m    discovers nested spec files [✔]
[2m[hspec-discover] [m    discovers hooks [✔]
[2m[hspec-discover] [m    discovers nested hooks [✔]
[2m[hspec-discover] [m    ignores invalid module names [✔]
[2m[hspec-discover] [m    ignores empty directories [✔]
[2m[hspec-discover] [m    ignores directories with extension [✔]
[2m[hspec-discover] [mTest.Hspec.Discover.Sort
[2m[hspec-discover] [m  naturalSortKey
[2m[hspec-discover] [m    is injective [✔]
[2m[hspec-discover] [m      +++ OK, passed 100 tests; 10 discarded.
[2m[hspec-discover] [m  sortNaturally
[2m[hspec-discover] [m    gives shorter strings precedence [✔]
[2m[hspec-discover] [m    gives numbers precedence [✔]
[2m[hspec-discover] [m    sorts numbers in ascending order [✔]
[2m[hspec-discover] [m    breaks numeric ties by string length [✔]
[2m[hspec-discover] [m    given upper-case letters precedence over lower-case letters [✔]
[2m[hspec-discover] [m    sorts number separated strings [✔]
[2m[hspec-discover] [m    sorts string separated numbers [✔]
[2m[hspec-discover] [m    groups common string prefixes together [✔]
[2m[hspec-discover] [m
[2m[hspec-discover] [mFinished in 0.0336 seconds
[2m[hspec-discover] [m31 examples, 0 failures
[2m[hspec-discover] [mTest suite spec: PASS
[2m[hspec-discover] [mTest suite logged to: dist/test/hspec-discover-2.11.12-spec.log
[2m[hspec-discover] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[hspec-discover] [m[1;36mPhase: haddockPhase[m
[2m[hspec-discover] [mPreprocessing library for hspec-discover-2.11.12..
[2m[hspec-discover] [mRunning Haddock on library for hspec-discover-2.11.12..
[2m[hspec-discover] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[hspec-discover] [m[1 of 4] Compiling Paths_hspec_discover ( dist/build/autogen/Paths_hspec_discover.hs, nothing )
[2m[hspec-discover] [m[2 of 4] Compiling Test.Hspec.Discover.Config ( src/Test/Hspec/Discover/Config.hs, nothing )
[2m[hspec-discover] [m[3 of 4] Compiling Test.Hspec.Discover.Sort ( src/Test/Hspec/Discover/Sort.hs, nothing )
[2m[hspec-discover] [m[4 of 4] Compiling Test.Hspec.Discover.Run ( src/Test/Hspec/Discover/Run.hs, nothing )
[2m[hspec-discover] [mHaddock coverage:
[2m[hspec-discover] [m  20% (  1 /  5) in 'Test.Hspec.Discover.Config'
[2m[hspec-discover] [m  Missing documentation for:
[2m[hspec-discover] [m    Config (src/Test/Hspec/Discover/Config.hs:14)
[2m[hspec-discover] [m    defaultConfig (src/Test/Hspec/Discover/Config.hs:22)
[2m[hspec-discover] [m    parseConfig (src/Test/Hspec/Discover/Config.hs:36)
[2m[hspec-discover] [m    usage (src/Test/Hspec/Discover/Config.hs:33)
[2m[hspec-discover] [m  25% (  1 /  4) in 'Test.Hspec.Discover.Sort'
[2m[hspec-discover] [m  Missing documentation for:
[2m[hspec-discover] [m    sortNaturallyBy (src/Test/Hspec/Discover/Sort.hs:16)
[2m[hspec-discover] [m    NaturalSortKey (src/Test/Hspec/Discover/Sort.hs:18)
[2m[hspec-discover] [m    naturalSortKey (src/Test/Hspec/Discover/Sort.hs:25)
[2m[hspec-discover] [m  36% (  4 / 11) in 'Test.Hspec.Discover.Run'
[2m[hspec-discover] [m  Missing documentation for:
[2m[hspec-discover] [m    run (src/Test/Hspec/Discover/Run.hs:43)
[2m[hspec-discover] [m    Spec (src/Test/Hspec/Discover/Run.hs:39)
[2m[hspec-discover] [m    driverWithFormatter (src/Test/Hspec/Discover/Run.hs:92)
[2m[hspec-discover] [m    Tree (src/Test/Hspec/Discover/Run.hs:160)
[2m[hspec-discover] [m    Forest (src/Test/Hspec/Discover/Run.hs:163)
[2m[hspec-discover] [m    Hook (src/Test/Hspec/Discover/Run.hs:166)
[2m[hspec-discover] [m    discover (src/Test/Hspec/Discover/Run.hs:175)
[2m[hspec-discover] [mDocumentation created: dist/doc/html/hspec-discover/,
[2m[hspec-discover] [mdist/doc/html/hspec-discover/hspec-discover.txt
[2m[hspec-discover] [mPreprocessing executable 'hspec-discover' for hspec-discover-2.11.12..
[2m[hspec-discover] [mPreprocessing test suite 'spec' for hspec-discover-2.11.12..
[2m[hspec-discover] [m[1;36mPhase: installPhase[m
[2m[hspec-discover] [mInstalling library in /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec-discover] [mInstalling executable hspec-discover in /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/bin
[2m[hspec-discover] [mWarning: The directory
[2m[hspec-discover] [m/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/bin is not
[2m[hspec-discover] [min the system search path.
[2m[hspec-discover] [m[1;36mPhase: fixupPhase[m
[2m[hspec-discover] [mshrinking RPATHs of ELF executables and libraries in /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12
[2m[hspec-discover] [mshrinking /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHShspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP-ghc9.8.1.so
[2m[hspec-discover] [mshrinking /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/bin/hspec-discover
[2m[hspec-discover] [mchecking for references to /build/ in /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12...
[2m[hspec-discover] [mpatching script interpreter paths in /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12
[2m[hspec-discover] [mstripping (with command strip and flags -S -p) in  /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/lib /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12/bin
[2m[hspec-discover] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc
[2m[hspec-discover] [mchecking for references to /build/ in /nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc...
[2m[hspec-discover] [mpatching script interpreter paths in /nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc
[2m[hspec-discover:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12 /nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc[m
[2m[hspec-discover:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[hspec-discover:post-build] [m[2m[m
[2m[hspec-discover:post-build] [m[2mPushing /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12 (3.60 MiB)[m
[2m[hspec-discover:post-build] [m[2mPushing /nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc (416.58 KiB)[m
[2m[hspec-discover:post-build] [m[2m[m
[2m[hspec-discover:post-build] [m[2mAll done.[m
[2m[hspec-discover:post-build] [m[2mUploading to the NixCI cache: /nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12 /nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc[m
[2m[hspec-discover:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec-discover:post-build] [m[2mcopying 2 paths...[m
[2m[hspec-discover:post-build] [m[2mcopying path '/nix/store/wp26l5zqhxshmjrnbn8viqff288g1gaw-hspec-discover-2.11.12-doc' to 'https://cache.nix-ci.com'...[m
[2m[hspec-discover:post-build] [m[2mcopying path '/nix/store/d9933i5cgksxnap00z7lg2jayxgbsvch-hspec-discover-2.11.12' to 'https://cache.nix-ci.com'...[m
[2m[hspec-discover:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec-discover:post-build] [m[2mcopying 1 paths...[m
[2m[hspec-discover:post-build] [m[2mcopying path '/nix/store/c28annkf37jwjin6pnlyrc3g4mbqgysh-hspec-discover-2.11.12.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 8 of 68 built[m
[1;34mBuilding /nix/store/wmgl0n183a2s2xkh494gh3am39l2f6zr-hspec-2.11.12.drv[m
[2m[hspec] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[hspec] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[hspec] [m[1;36mPhase: unpackPhase[m
[2m[hspec] [munpacking source archive /nix/store/xl6f0qw9711gjxkqii7h6j7csy438rsc-hspec-2.11.12.tar.gz
[2m[hspec] [msource root is hspec-2.11.12
[2m[hspec] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "hspec-2.11.12/version.yaml"
[2m[hspec] [m[1;36mPhase: patchPhase[m
[2m[hspec] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[hspec] [msetupCompileFlags: -package-db=/build/tmp.hQxis3iylM/setup-package.conf.d -threaded
[2m[hspec] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.hQxis3iylM/Main.o )
[2m[hspec] [m[2 of 2] Linking Setup
[2m[hspec] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[hspec] [m[1;36mPhase: configurePhase[m
[2m[hspec] [mconfigureFlags: --verbose --prefix=/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc/share/doc/hspec-2.11.12 --with-gcc=gcc --package-db=/build/tmp.hQxis3iylM/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[hspec] [mUsing Parsec parser
[2m[hspec] [mConfiguring hspec-2.11.12...
[2m[hspec] [mDependency QuickCheck >=2.12: using QuickCheck-2.14.3
[2m[hspec] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[hspec] [mDependency hspec-core ==2.11.12: using hspec-core-2.11.12
[2m[hspec] [mDependency hspec-discover ==2.11.12: using hspec-discover-2.11.12
[2m[hspec] [mDependency hspec-expectations >=0.8.4 && <0.8.5: using
[2m[hspec] [mhspec-expectations-0.8.4
[2m[hspec] [mSource component graph: component lib
[2m[hspec] [mConfigured component graph:
[2m[hspec] [m    component hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[hspec] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec] [m        include base-4.19.0.0-b960
[2m[hspec] [m        include hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec] [m        include hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec] [mLinked component graph:
[2m[hspec] [m    unit hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[hspec] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec] [m        include base-4.19.0.0-b960
[2m[hspec] [m        include hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec] [m        include hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec] [m        include hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec] [m        Test.Hspec=hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH:Test.Hspec,Test.Hspec.Discover=hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH:Test.Hspec.Discover,Test.Hspec.Formatters=hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH:Test.Hspec.Formatters,Test.Hspec.QuickCheck=hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH:Test.Hspec.QuickCheck,Test.Hspec.Runner=hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH:Test.Hspec.Runner
[2m[hspec] [mReady component graph:
[2m[hspec] [m    definite hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[hspec] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[hspec] [m        depends base-4.19.0.0-b960
[2m[hspec] [m        depends hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
[2m[hspec] [m        depends hspec-discover-2.11.12-2gfVvPfLX94L35BqmavuBP
[2m[hspec] [m        depends hspec-expectations-0.8.4-1hri6locpBn1LIM33riTbc
[2m[hspec] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[hspec] [mUsing compiler: ghc-9.8.1
[2m[hspec] [mUsing install prefix:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12
[2m[hspec] [mExecutables installed in:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/bin
[2m[hspec] [mLibraries installed in:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[hspec] [mDynamic Libraries installed in:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[hspec] [mPrivate executables installed in:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/libexec/x86_64-linux-ghc-9.8.1/hspec-2.11.12
[2m[hspec] [mData files installed in:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/share/x86_64-linux-ghc-9.8.1/hspec-2.11.12
[2m[hspec] [mDocumentation installed in:
[2m[hspec] [m/nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc/share/doc/hspec-2.11.12
[2m[hspec] [mConfiguration files installed in:
[2m[hspec] [m/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/etc
[2m[hspec] [mNo alex found
[2m[hspec] [mUsing ar found on system at:
[2m[hspec] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[hspec] [mNo c2hs found
[2m[hspec] [mNo cpphs found
[2m[hspec] [mNo doctest found
[2m[hspec] [mUsing gcc version 14.3.0 given by user at:
[2m[hspec] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[hspec] [mUsing ghc version 9.8.1 found on system at:
[2m[hspec] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[hspec] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[hspec] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[hspec] [mNo ghcjs found
[2m[hspec] [mNo ghcjs-pkg found
[2m[hspec] [mNo greencard found
[2m[hspec] [mUsing haddock version 2.30.0 found on system at:
[2m[hspec] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[hspec] [mNo happy found
[2m[hspec] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[hspec] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[hspec] [mNo hmake found
[2m[hspec] [mUsing hpc version 0.69 found on system at:
[2m[hspec] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[hspec] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[hspec] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[hspec] [mUsing hscolour version 1.25 found on system at:
[2m[hspec] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[hspec] [mNo jhc found
[2m[hspec] [mUsing ld found on system at:
[2m[hspec] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[hspec] [mNo pkg-config found
[2m[hspec] [mUsing runghc version 9.8.1 found on system at:
[2m[hspec] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[hspec] [mUsing strip version 2.44 found on system at:
[2m[hspec] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[hspec] [mUsing tar found on system at:
[2m[hspec] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[hspec] [mNo uhc found
[2m[hspec] [m[1;36mPhase: buildPhase[m
[2m[hspec] [mPreprocessing library for hspec-2.11.12..
[2m[hspec] [mBuilding library for hspec-2.11.12..
[2m[hspec] [m[1 of 6] Compiling Paths_hspec      ( dist/build/autogen/Paths_hspec.hs, dist/build/Paths_hspec.o, dist/build/Paths_hspec.dyn_o )
[2m[hspec] [m[2 of 6] Compiling Test.Hspec.Discover ( src/Test/Hspec/Discover.hs, dist/build/Test/Hspec/Discover.o, dist/build/Test/Hspec/Discover.dyn_o )
[2m[hspec] [m[3 of 6] Compiling Test.Hspec.Formatters ( src/Test/Hspec/Formatters.hs, dist/build/Test/Hspec/Formatters.o, dist/build/Test/Hspec/Formatters.dyn_o )
[2m[hspec] [m[4 of 6] Compiling Test.Hspec.Runner ( src/Test/Hspec/Runner.hs, dist/build/Test/Hspec/Runner.o, dist/build/Test/Hspec/Runner.dyn_o )
[2m[hspec] [m[5 of 6] Compiling Test.Hspec       ( src/Test/Hspec.hs, dist/build/Test/Hspec.o, dist/build/Test/Hspec.dyn_o )
[2m[hspec] [m[6 of 6] Compiling Test.Hspec.QuickCheck ( src/Test/Hspec/QuickCheck.hs, dist/build/Test/Hspec/QuickCheck.o, dist/build/Test/Hspec/QuickCheck.dyn_o )
[2m[hspec] [m[1 of 6] Compiling Paths_hspec      ( dist/build/autogen/Paths_hspec.hs, dist/build/Paths_hspec.p_o )
[2m[hspec] [m[2 of 6] Compiling Test.Hspec.Discover ( src/Test/Hspec/Discover.hs, dist/build/Test/Hspec/Discover.p_o )
[2m[hspec] [m[3 of 6] Compiling Test.Hspec.Formatters ( src/Test/Hspec/Formatters.hs, dist/build/Test/Hspec/Formatters.p_o )
[2m[hspec] [m[4 of 6] Compiling Test.Hspec.Runner ( src/Test/Hspec/Runner.hs, dist/build/Test/Hspec/Runner.p_o )
[2m[hspec] [m[5 of 6] Compiling Test.Hspec       ( src/Test/Hspec.hs, dist/build/Test/Hspec.p_o )
[2m[hspec] [m[6 of 6] Compiling Test.Hspec.QuickCheck ( src/Test/Hspec/QuickCheck.hs, dist/build/Test/Hspec/QuickCheck.p_o )
[2m[hspec] [m[1;36mPhase: checkPhase[m
[2m[hspec] [mPackage has no test suites.
[2m[hspec] [m[1;36mPhase: haddockPhase[m
[2m[hspec] [mPreprocessing library for hspec-2.11.12..
[2m[hspec] [mRunning Haddock on library for hspec-2.11.12..
[2m[hspec] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[hspec] [m[1 of 6] Compiling Paths_hspec      ( dist/build/autogen/Paths_hspec.hs, nothing )
[2m[hspec] [m[2 of 6] Compiling Test.Hspec.Discover ( src/Test/Hspec/Discover.hs, nothing )
[2m[hspec] [m[3 of 6] Compiling Test.Hspec.Formatters ( src/Test/Hspec/Formatters.hs, nothing )
[2m[hspec] [m[4 of 6] Compiling Test.Hspec.Runner ( src/Test/Hspec/Runner.hs, nothing )
[2m[hspec] [m[5 of 6] Compiling Test.Hspec       ( src/Test/Hspec.hs, nothing )
[2m[hspec] [m[6 of 6] Compiling Test.Hspec.QuickCheck ( src/Test/Hspec/QuickCheck.hs, nothing )
[2m[hspec] [mHaddock coverage:
[2m[hspec] [m  37% (  3 /  8) in 'Test.Hspec.Discover'
[2m[hspec] [m  Missing documentation for:
[2m[hspec] [m    Module header
[2m[hspec] [m    Spec
[2m[hspec] [m    IsFormatter (src/Test/Hspec/Discover.hs:19)
[2m[hspec] [m    hspecWithFormatter (src/Test/Hspec/Discover.hs:29)
[2m[hspec] [m    postProcessSpec (src/Test/Hspec/Discover.hs:34)
[2m[hspec] [m 100% (  2 /  2) in 'Test.Hspec.Formatters'
[2m[hspec] [m  50% (  1 /  2) in 'Test.Hspec.Runner'
[2m[hspec] [m  Missing documentation for:
[2m[hspec] [m    Module header
[2m[hspec] [m  94% ( 51 / 54) in 'Test.Hspec'
[2m[hspec] [m  Missing documentation for:
[2m[hspec] [m    Spec
[2m[hspec] [m    SpecWith
[2m[hspec] [m    Arg
[2m[hspec] [m  90% ( 10 / 11) in 'Test.Hspec.QuickCheck'
[2m[hspec] [m  Missing documentation for:
[2m[hspec] [m    Module header
[2m[hspec] [mWarning: Test.Hspec: could not find link destinations for: 
[2m[hspec] [m	- Test.Hspec.Core.Example.D:R:ArgFUN0
[2m[hspec] [m	- Test.Hspec.Core.Example.D:R:ArgBool
[2m[hspec] [m	- Test.Hspec.Core.Example.D:R:ArgFUN
[2m[hspec] [m	- Test.Hspec.Core.Example.D:R:ArgFUN1
[2m[hspec] [m	- Test.Hspec.Core.Example.D:R:ArgIO
[2m[hspec] [m	- Test.Hspec.Core.Example.D:R:ArgResult
[2m[hspec] [mDocumentation created: dist/doc/html/hspec/, dist/doc/html/hspec/hspec.txt
[2m[hspec] [m[1;36mPhase: installPhase[m
[2m[hspec] [mInstalling library in /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[hspec] [m[1;36mPhase: fixupPhase[m
[2m[hspec] [mshrinking RPATHs of ELF executables and libraries in /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12
[2m[hspec] [mshrinking /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHShspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH-ghc9.8.1.so
[2m[hspec] [mchecking for references to /build/ in /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12...
[2m[hspec] [mpatching script interpreter paths in /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12
[2m[hspec] [mstripping (with command strip and flags -S -p) in  /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12/lib
[2m[hspec] [mshrinking RPATHs of ELF executables and libraries in /nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc
[2m[hspec] [mchecking for references to /build/ in /nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc...
[2m[hspec] [mpatching script interpreter paths in /nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc
[2m[hspec:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12 /nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc[m
[2m[hspec:post-build] [m[2mPushing 2 paths (97 are already present) using zstd to cache sellout ⏳[m
[2m[hspec:post-build] [m[2m[m
[2m[hspec:post-build] [m[2mPushing /nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc (572.59 KiB)[m
[2m[hspec:post-build] [m[2mPushing /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12 (518.56 KiB)[m
[2m[hspec:post-build] [m[2m[m
[2m[hspec:post-build] [m[2mAll done.[m
[2m[hspec:post-build] [m[2mUploading to the NixCI cache: /nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12 /nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc[m
[2m[hspec:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec:post-build] [m[2mcopying 2 paths...[m
[2m[hspec:post-build] [m[2mcopying path '/nix/store/w4q2xzsj43yy07d47x2ckcpybsh0yifl-hspec-2.11.12-doc' to 'https://cache.nix-ci.com'...[m
[2m[hspec:post-build] [m[2mcopying path '/nix/store/3v90inwnppwqdlf2z2n2wl2fnwq60jqh-hspec-2.11.12' to 'https://cache.nix-ci.com'...[m
[2m[hspec:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hspec:post-build] [m[2mcopying 1 paths...[m
[2m[hspec:post-build] [m[2mcopying path '/nix/store/wmgl0n183a2s2xkh494gh3am39l2f6zr-hspec-2.11.12.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 9 of 68 built[m
[1;34mBuilding /nix/store/gl6lfsp052xb1scms6wzf7m51jah5wvn-base-orphans-0.9.3.drv[m
[1;34mBuilding /nix/store/gld31zr7zh8xyn8y3vahgjdgzwhgkdy9-generic-deriving-1.14.6.drv[m
[1;34mBuilding /nix/store/n3k7115vii6fqx4sjvn4500bablsjpfa-resourcet-1.3.0.drv[m
[1;34mBuilding /nix/store/snji0jpspl9hjdy6c0k7wv9plr36gva1-safe-exceptions-0.1.7.4.drv[m
[1;34mBuilding /nix/store/yvchxwmlm68kdpvgcppqwdf8crcar945-stringbuilder-0.5.1.drv[m
[2m[base-orphans] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[base-orphans] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[generic-deriving] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[generic-deriving] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[resourcet] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[resourcet] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[safe-exceptions] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[safe-exceptions] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[stringbuilder] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[stringbuilder] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[base-orphans] [m[1;36mPhase: unpackPhase[m
[2m[base-orphans] [munpacking source archive /nix/store/xx663jmxd6p36311kakpwz5yvi3vhhvw-base-orphans-0.9.3.tar.gz
[2m[base-orphans] [msource root is base-orphans-0.9.3
[2m[base-orphans] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "base-orphans-0.9.3/test/System/Posix/Types/OrphansSpec.hs"
[2m[generic-deriving] [m[1;36mPhase: unpackPhase[m
[2m[base-orphans] [m[1;36mPhase: patchPhase[m
[2m[generic-deriving] [munpacking source archive /nix/store/phlzkljg27q500glmb4fxs95sjhpivkb-generic-deriving-1.14.6.tar.gz
[2m[base-orphans] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[base-orphans] [msetupCompileFlags: -package-db=/build/tmp.Zkbx1S2sHL/setup-package.conf.d -threaded
[2m[generic-deriving] [msource root is generic-deriving-1.14.6
[2m[generic-deriving] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "generic-deriving-1.14.6/tests/TypeInTypeSpec.hs"
[2m[resourcet] [m[1;36mPhase: unpackPhase[m
[2m[generic-deriving] [m[1;36mPhase: patchPhase[m
[2m[resourcet] [munpacking source archive /nix/store/nlvh5lwsmyaxl60v5f30gh850hgr0mij-resourcet-1.3.0.tar.gz
[2m[generic-deriving] [mReplace Cabal file with edited version from mirror://hackage/generic-deriving-1.14.6/revision/1.cabal.
[2m[resourcet] [msource root is resourcet-1.3.0
[2m[safe-exceptions] [m[1;36mPhase: unpackPhase[m
[2m[resourcet] [msetting SOURCE_DATE_EPOCH to timestamp 1666509141 of file "resourcet-1.3.0/test/main.hs"
[2m[generic-deriving] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[safe-exceptions] [munpacking source archive /nix/store/5zaq4mnyvy4jl3gk25lj9wh4436n7sr9-safe-exceptions-0.1.7.4.tar.gz
[2m[resourcet] [m[1;36mPhase: patchPhase[m
[2m[generic-deriving] [msetupCompileFlags: -package-db=/build/tmp.8RZYfkdAU9/setup-package.conf.d -threaded
[2m[safe-exceptions] [msource root is safe-exceptions-0.1.7.4
[2m[resourcet] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[safe-exceptions] [msetting SOURCE_DATE_EPOCH to timestamp 1687801020 of file "safe-exceptions-0.1.7.4/src/Control/Exception/Safe.hs"
[2m[resourcet] [msetupCompileFlags: -package-db=/build/tmp.ky2quhbsXL/setup-package.conf.d -threaded
[2m[safe-exceptions] [m[1;36mPhase: patchPhase[m
[2m[base-orphans] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.Zkbx1S2sHL/Main.o )
[2m[safe-exceptions] [mReplace Cabal file with edited version from mirror://hackage/safe-exceptions-0.1.7.4/revision/1.cabal.
[2m[safe-exceptions] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[safe-exceptions] [msetupCompileFlags: -package-db=/build/tmp.Qhk7xcm6Oy/setup-package.conf.d -threaded
[2m[generic-deriving] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.8RZYfkdAU9/Main.o )
[2m[resourcet] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.ky2quhbsXL/Main.o )
[2m[stringbuilder] [m[1;36mPhase: unpackPhase[m
[2m[stringbuilder] [munpacking source archive /nix/store/9s62xakj6558lv4kginigg0j6gsvdva1-stringbuilder-0.5.1.tar.gz
[2m[safe-exceptions] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.Qhk7xcm6Oy/Main.o )
[2m[stringbuilder] [msource root is stringbuilder-0.5.1
[2m[stringbuilder] [msetting SOURCE_DATE_EPOCH to timestamp 1518112055 of file "stringbuilder-0.5.1/test/Spec.hs"
[2m[stringbuilder] [m[1;36mPhase: patchPhase[m
[2m[base-orphans] [m[2 of 2] Linking Setup
[2m[stringbuilder] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[stringbuilder] [msetupCompileFlags: -package-db=/build/tmp.3pPXqPhtVx/setup-package.conf.d -threaded
[2m[generic-deriving] [m[2 of 2] Linking Setup
[2m[resourcet] [m[2 of 2] Linking Setup
[2m[stringbuilder] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.3pPXqPhtVx/Main.o )
[2m[safe-exceptions] [m[2 of 2] Linking Setup
[2m[stringbuilder] [m[2 of 2] Linking Setup
[2m[base-orphans] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[base-orphans] [m[1;36mPhase: configurePhase[m
[2m[base-orphans] [mconfigureFlags: --verbose --prefix=/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc/share/doc/base-orphans-0.9.3 --with-gcc=gcc --package-db=/build/tmp.Zkbx1S2sHL/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[base-orphans] [mUsing Parsec parser
[2m[base-orphans] [mConfiguring base-orphans-0.9.3...
[2m[resourcet] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[resourcet] [m[1;36mPhase: configurePhase[m
[2m[resourcet] [mconfigureFlags: --verbose --prefix=/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc/share/doc/resourcet-1.3.0 --with-gcc=gcc --package-db=/build/tmp.ky2quhbsXL/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[resourcet] [mUsing Parsec parser
[2m[resourcet] [mConfiguring resourcet-1.3.0...
[2m[safe-exceptions] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[generic-deriving] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[safe-exceptions] [m[1;36mPhase: configurePhase[m
[2m[safe-exceptions] [mconfigureFlags: --verbose --prefix=/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc/share/doc/safe-exceptions-0.1.7.4 --with-gcc=gcc --package-db=/build/tmp.Qhk7xcm6Oy/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[generic-deriving] [m[1;36mPhase: configurePhase[m
[2m[safe-exceptions] [mUsing Parsec parser
[2m[safe-exceptions] [mConfiguring safe-exceptions-0.1.7.4...
[2m[generic-deriving] [mconfigureFlags: --verbose --prefix=/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc/share/doc/generic-deriving-1.14.6 --with-gcc=gcc --package-db=/build/tmp.8RZYfkdAU9/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[generic-deriving] [mUsing Parsec parser
[2m[generic-deriving] [mConfiguring generic-deriving-1.14.6...
[2m[stringbuilder] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[stringbuilder] [m[1;36mPhase: configurePhase[m
[2m[stringbuilder] [mconfigureFlags: --verbose --prefix=/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc/share/doc/stringbuilder-0.5.1 --with-gcc=gcc --package-db=/build/tmp.3pPXqPhtVx/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[stringbuilder] [mUsing Parsec parser
[2m[stringbuilder] [mConfiguring stringbuilder-0.5.1...
[2m[base-orphans] [mDependency base >=4.9 && <5: using base-4.19.0.0
[2m[base-orphans] [mDependency ghc-prim: using ghc-prim-0.11.0
[2m[base-orphans] [mDependency QuickCheck: using QuickCheck-2.14.3
[2m[base-orphans] [mDependency base >=4.9 && <5: using base-4.19.0.0
[2m[base-orphans] [mDependency base-orphans: using base-orphans-0.9.3
[2m[base-orphans] [mDependency hspec >=2 && <3: using hspec-2.11.12
[2m[resourcet] [mDependency base >=4.12 && <5: using base-4.19.0.0
[2m[resourcet] [mDependency containers: using containers-0.6.8
[2m[resourcet] [mDependency exceptions >=0.8 && <0.9 || >=0.10 && <0.11: using
[2m[resourcet] [mexceptions-0.10.7
[2m[resourcet] [mDependency mtl >=2.0 && <2.4: using mtl-2.3.1
[2m[resourcet] [mDependency primitive: using primitive-0.9.1.0
[2m[resourcet] [mDependency transformers >=0.4: using transformers-0.6.1.0
[2m[resourcet] [mDependency unliftio-core >=0.1.1.0: using unliftio-core-0.2.1.0
[2m[resourcet] [mDependency base: using base-4.19.0.0
[2m[resourcet] [mDependency exceptions: using exceptions-0.10.7
[2m[resourcet] [mDependency hspec >=1.3: using hspec-2.11.12
[2m[resourcet] [mDependency resourcet: using resourcet-1.3.0
[2m[resourcet] [mDependency transformers: using transformers-0.6.1.0
[2m[generic-deriving] [mDependency base >=4.9 && <5: using base-4.19.0.0
[2m[generic-deriving] [mDependency containers >=0.1 && <0.9: using containers-0.6.8
[2m[generic-deriving] [mDependency ghc-prim <1: using ghc-prim-0.11.0
[2m[generic-deriving] [mDependency template-haskell >=2.11 && <2.24: using template-haskell-2.21.0.0
[2m[generic-deriving] [mDependency th-abstraction >=0.4 && <0.8: using th-abstraction-0.7.1.0
[2m[generic-deriving] [mDependency base: using base-4.19.0.0
[2m[generic-deriving] [mDependency generic-deriving: using generic-deriving-1.14.6
[2m[generic-deriving] [mDependency hspec >=2 && <3: using hspec-2.11.12
[2m[generic-deriving] [mDependency template-haskell: using template-haskell-2.21.0.0
[2m[safe-exceptions] [mDependency base >=4.11 && <5: using base-4.19.0.0
[2m[safe-exceptions] [mDependency deepseq >=1.2 && <1.6: using deepseq-1.5.0.0
[2m[safe-exceptions] [mDependency exceptions >=0.10 && <0.11: using exceptions-0.10.7
[2m[safe-exceptions] [mDependency transformers >=0.2 && <0.7: using transformers-0.6.1.0
[2m[safe-exceptions] [mDependency base: using base-4.19.0.0
[2m[safe-exceptions] [mDependency hspec: using hspec-2.11.12
[2m[safe-exceptions] [mDependency safe-exceptions: using safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mDependency transformers: using transformers-0.6.1.0
[2m[safe-exceptions] [mDependency void: using void-0.7.3
[2m[stringbuilder] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[stringbuilder] [mDependency QuickCheck: using QuickCheck-2.14.3
[2m[stringbuilder] [mDependency base: using base-4.19.0.0
[2m[stringbuilder] [mDependency hspec >=1.3: using hspec-2.11.12
[2m[stringbuilder] [mDependency stringbuilder: using stringbuilder-0.5.1
[2m[generic-deriving] [mSource component graph:
[2m[generic-deriving] [m    component lib
[2m[generic-deriving] [m    component test:spec dependency lib
[2m[generic-deriving] [mConfigured component graph:
[2m[generic-deriving] [m    component generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [m        include base-4.19.0.0-b960
[2m[generic-deriving] [m        include containers-0.6.8-4775
[2m[generic-deriving] [m        include ghc-prim-0.11.0-a69e
[2m[generic-deriving] [m        include template-haskell-2.21.0.0-8831
[2m[generic-deriving] [m        include th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
[2m[generic-deriving] [m    component generic-deriving-1.14.6-CBASKocvWQUJg8HQOkiRDR-spec
[2m[generic-deriving] [m        include base-4.19.0.0-b960
[2m[generic-deriving] [m        include generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[generic-deriving] [m        include template-haskell-2.21.0.0-8831
[2m[generic-deriving] [mLinked component graph:
[2m[generic-deriving] [m    unit generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [m        include base-4.19.0.0-b960
[2m[generic-deriving] [m        include containers-0.6.8-4775
[2m[generic-deriving] [m        include ghc-prim-0.11.0-a69e
[2m[generic-deriving] [m        include template-haskell-2.21.0.0-8831
[2m[generic-deriving] [m        include th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
[2m[generic-deriving] [m        Generics.Deriving=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving,Generics.Deriving.Base=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Base,Generics.Deriving.ConNames=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.ConNames,Generics.Deriving.Copoint=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Copoint,Generics.Deriving.Default=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Default,Generics.Deriving.Enum=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Enum,Generics.Deriving.Eq=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Eq,Generics.Deriving.Foldable=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Foldable,Generics.Deriving.Functor=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Functor,Generics.Deriving.Instances=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Instances,Generics.Deriving.Monoid=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Monoid,Generics.Deriving.Semigroup=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Semigroup,Generics.Deriving.Show=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Show,Generics.Deriving.TH=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.TH,Generics.Deriving.Traversable=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Traversable,Generics.Deriving.Uniplate=generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT:Generics.Deriving.Uniplate
[2m[generic-deriving] [m    unit generic-deriving-1.14.6-CBASKocvWQUJg8HQOkiRDR-spec
[2m[generic-deriving] [m        include base-4.19.0.0-b960
[2m[generic-deriving] [m        include generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[generic-deriving] [m        include template-haskell-2.21.0.0-8831
[2m[generic-deriving] [mReady component graph:
[2m[generic-deriving] [m    definite generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [m        depends base-4.19.0.0-b960
[2m[generic-deriving] [m        depends containers-0.6.8-4775
[2m[generic-deriving] [m        depends ghc-prim-0.11.0-a69e
[2m[generic-deriving] [m        depends template-haskell-2.21.0.0-8831
[2m[generic-deriving] [m        depends th-abstraction-0.7.1.0-D2qAyomm2vvKhfkR0SrGAm
[2m[generic-deriving] [m    definite generic-deriving-1.14.6-CBASKocvWQUJg8HQOkiRDR-spec
[2m[generic-deriving] [m        depends base-4.19.0.0-b960
[2m[generic-deriving] [m        depends generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [m        depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[generic-deriving] [m        depends template-haskell-2.21.0.0-8831
[2m[generic-deriving] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[generic-deriving] [mUsing compiler: ghc-9.8.1
[2m[generic-deriving] [mUsing install prefix:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6
[2m[generic-deriving] [mExecutables installed in:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/bin
[2m[generic-deriving] [mLibraries installed in:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[generic-deriving] [mDynamic Libraries installed in:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[generic-deriving] [mPrivate executables installed in:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/libexec/x86_64-linux-ghc-9.8.1/generic-deriving-1.14.6
[2m[generic-deriving] [mData files installed in:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/share/x86_64-linux-ghc-9.8.1/generic-deriving-1.14.6
[2m[generic-deriving] [mDocumentation installed in:
[2m[generic-deriving] [m/nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc/share/doc/generic-deriving-1.14.6
[2m[generic-deriving] [mConfiguration files installed in:
[2m[generic-deriving] [m/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/etc
[2m[generic-deriving] [mNo alex found
[2m[generic-deriving] [mUsing ar found on system at:
[2m[generic-deriving] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[generic-deriving] [mNo c2hs found
[2m[generic-deriving] [mNo cpphs found
[2m[generic-deriving] [mNo doctest found
[2m[generic-deriving] [mUsing gcc version 14.3.0 given by user at:
[2m[generic-deriving] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[generic-deriving] [mUsing ghc version 9.8.1 found on system at:
[2m[generic-deriving] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[generic-deriving] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[generic-deriving] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[generic-deriving] [mNo ghcjs found
[2m[generic-deriving] [mNo ghcjs-pkg found
[2m[generic-deriving] [mNo greencard found
[2m[generic-deriving] [mUsing haddock version 2.30.0 found on system at:
[2m[generic-deriving] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[generic-deriving] [mNo happy found
[2m[generic-deriving] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[generic-deriving] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[generic-deriving] [mNo hmake found
[2m[generic-deriving] [mUsing hpc version 0.69 found on system at:
[2m[generic-deriving] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[generic-deriving] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[generic-deriving] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[generic-deriving] [mUsing hscolour version 1.25 found on system at:
[2m[generic-deriving] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[generic-deriving] [mNo jhc found
[2m[generic-deriving] [mUsing ld found on system at:
[2m[generic-deriving] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[generic-deriving] [mNo pkg-config found
[2m[generic-deriving] [mUsing runghc version 9.8.1 found on system at:
[2m[generic-deriving] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[generic-deriving] [mUsing strip version 2.44 found on system at:
[2m[generic-deriving] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[generic-deriving] [mUsing tar found on system at:
[2m[generic-deriving] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[generic-deriving] [mNo uhc found
[2m[resourcet] [mSource component graph:
[2m[resourcet] [m    component lib
[2m[resourcet] [m    component test:test dependency lib
[2m[resourcet] [mConfigured component graph:
[2m[resourcet] [m    component resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m        include base-4.19.0.0-b960
[2m[resourcet] [m        include containers-0.6.8-4775
[2m[resourcet] [m        include exceptions-0.10.7-d3e7
[2m[resourcet] [m        include mtl-2.3.1-63a4
[2m[resourcet] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[resourcet] [m        include transformers-0.6.1.0-c3ec
[2m[resourcet] [m        include unliftio-core-0.2.1.0-2laCvrT8ZpN896XVg0bA9P
[2m[resourcet] [m    component resourcet-1.3.0-4nVGZq4oZTR41s0ZVrsvNp-test
[2m[resourcet] [m        include base-4.19.0.0-b960
[2m[resourcet] [m        include exceptions-0.10.7-d3e7
[2m[resourcet] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[resourcet] [m        include resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m        include transformers-0.6.1.0-c3ec
[2m[resourcet] [mLinked component graph:
[2m[resourcet] [m    unit resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m        include base-4.19.0.0-b960
[2m[resourcet] [m        include containers-0.6.8-4775
[2m[resourcet] [m        include exceptions-0.10.7-d3e7
[2m[resourcet] [m        include mtl-2.3.1-63a4
[2m[resourcet] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[resourcet] [m        include transformers-0.6.1.0-c3ec
[2m[resourcet] [m        include unliftio-core-0.2.1.0-2laCvrT8ZpN896XVg0bA9P
[2m[resourcet] [m        Control.Monad.Trans.Resource=resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC:Control.Monad.Trans.Resource,Control.Monad.Trans.Resource.Internal=resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC:Control.Monad.Trans.Resource.Internal,Data.Acquire=resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC:Data.Acquire,Data.Acquire.Internal=resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC:Data.Acquire.Internal,UnliftIO.Resource=resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC:UnliftIO.Resource
[2m[resourcet] [m    unit resourcet-1.3.0-4nVGZq4oZTR41s0ZVrsvNp-test
[2m[resourcet] [m        include base-4.19.0.0-b960
[2m[resourcet] [m        include exceptions-0.10.7-d3e7
[2m[resourcet] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[resourcet] [m        include resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m        include transformers-0.6.1.0-c3ec
[2m[resourcet] [mReady component graph:
[2m[resourcet] [m    definite resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m        depends base-4.19.0.0-b960
[2m[resourcet] [m        depends containers-0.6.8-4775
[2m[resourcet] [m        depends exceptions-0.10.7-d3e7
[2m[resourcet] [m        depends mtl-2.3.1-63a4
[2m[resourcet] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[resourcet] [m        depends transformers-0.6.1.0-c3ec
[2m[resourcet] [m        depends unliftio-core-0.2.1.0-2laCvrT8ZpN896XVg0bA9P
[2m[resourcet] [m    definite resourcet-1.3.0-4nVGZq4oZTR41s0ZVrsvNp-test
[2m[resourcet] [m        depends base-4.19.0.0-b960
[2m[resourcet] [m        depends exceptions-0.10.7-d3e7
[2m[resourcet] [m        depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[resourcet] [m        depends resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m        depends transformers-0.6.1.0-c3ec
[2m[resourcet] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[resourcet] [mUsing compiler: ghc-9.8.1
[2m[resourcet] [mUsing install prefix:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0
[2m[resourcet] [mExecutables installed in:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/bin
[2m[resourcet] [mLibraries installed in:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [mDynamic Libraries installed in:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[resourcet] [mPrivate executables installed in:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/libexec/x86_64-linux-ghc-9.8.1/resourcet-1.3.0
[2m[resourcet] [mData files installed in:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/share/x86_64-linux-ghc-9.8.1/resourcet-1.3.0
[2m[resourcet] [mDocumentation installed in:
[2m[resourcet] [m/nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc/share/doc/resourcet-1.3.0
[2m[resourcet] [mConfiguration files installed in:
[2m[resourcet] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/etc
[2m[resourcet] [mNo alex found
[2m[resourcet] [mUsing ar found on system at:
[2m[resourcet] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[resourcet] [mNo c2hs found
[2m[resourcet] [mNo cpphs found
[2m[resourcet] [mNo doctest found
[2m[resourcet] [mUsing gcc version 14.3.0 given by user at:
[2m[resourcet] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[resourcet] [mUsing ghc version 9.8.1 found on system at:
[2m[resourcet] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[resourcet] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[resourcet] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[resourcet] [mNo ghcjs found
[2m[resourcet] [mNo ghcjs-pkg found
[2m[resourcet] [mNo greencard found
[2m[resourcet] [mUsing haddock version 2.30.0 found on system at:
[2m[resourcet] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[resourcet] [mNo happy found
[2m[resourcet] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[resourcet] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[resourcet] [mNo hmake found
[2m[resourcet] [mUsing hpc version 0.69 found on system at:
[2m[resourcet] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[resourcet] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[resourcet] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[resourcet] [mUsing hscolour version 1.25 found on system at:
[2m[resourcet] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[resourcet] [mNo jhc found
[2m[resourcet] [mUsing ld found on system at:
[2m[resourcet] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[resourcet] [mNo pkg-config found
[2m[resourcet] [mUsing runghc version 9.8.1 found on system at:
[2m[resourcet] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[resourcet] [mUsing strip version 2.44 found on system at:
[2m[resourcet] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[resourcet] [mUsing tar found on system at:
[2m[resourcet] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[resourcet] [mNo uhc found
[2m[base-orphans] [mSource component graph:
[2m[base-orphans] [m    component lib
[2m[base-orphans] [m    component test:spec dependency lib
[2m[base-orphans] [mConfigured component graph:
[2m[base-orphans] [m    component base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m        include base-4.19.0.0-b960
[2m[base-orphans] [m        include ghc-prim-0.11.0-a69e
[2m[base-orphans] [m    component base-orphans-0.9.3-76lHxWNy4D86BOdZ57780P-spec
[2m[base-orphans] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[base-orphans] [m        include base-4.19.0.0-b960
[2m[base-orphans] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[base-orphans] [mLinked component graph:
[2m[base-orphans] [m    unit base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m        include base-4.19.0.0-b960
[2m[base-orphans] [m        include ghc-prim-0.11.0-a69e
[2m[base-orphans] [m        Data.Orphans=base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU:Data.Orphans
[2m[base-orphans] [m    unit base-orphans-0.9.3-76lHxWNy4D86BOdZ57780P-spec
[2m[base-orphans] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[base-orphans] [m        include base-4.19.0.0-b960
[2m[base-orphans] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[base-orphans] [mReady component graph:
[2m[base-orphans] [m    definite base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m        depends base-4.19.0.0-b960
[2m[base-orphans] [m        depends ghc-prim-0.11.0-a69e
[2m[base-orphans] [m    definite base-orphans-0.9.3-76lHxWNy4D86BOdZ57780P-spec
[2m[base-orphans] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[base-orphans] [m        depends base-4.19.0.0-b960
[2m[base-orphans] [m        depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m        depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[base-orphans] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[base-orphans] [mUsing compiler: ghc-9.8.1
[2m[base-orphans] [mUsing install prefix:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3
[2m[base-orphans] [mExecutables installed in:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/bin
[2m[base-orphans] [mLibraries installed in:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [mDynamic Libraries installed in:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[base-orphans] [mPrivate executables installed in:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/libexec/x86_64-linux-ghc-9.8.1/base-orphans-0.9.3
[2m[base-orphans] [mData files installed in:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/share/x86_64-linux-ghc-9.8.1/base-orphans-0.9.3
[2m[base-orphans] [mDocumentation installed in:
[2m[base-orphans] [m/nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc/share/doc/base-orphans-0.9.3
[2m[base-orphans] [mConfiguration files installed in:
[2m[base-orphans] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/etc
[2m[base-orphans] [mNo alex found
[2m[base-orphans] [mUsing ar found on system at:
[2m[base-orphans] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[base-orphans] [mNo c2hs found
[2m[base-orphans] [mNo cpphs found
[2m[base-orphans] [mNo doctest found
[2m[base-orphans] [mUsing gcc version 14.3.0 given by user at:
[2m[base-orphans] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[base-orphans] [mUsing ghc version 9.8.1 found on system at:
[2m[base-orphans] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[base-orphans] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[base-orphans] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[base-orphans] [mNo ghcjs found
[2m[base-orphans] [mNo ghcjs-pkg found
[2m[base-orphans] [mNo greencard found
[2m[base-orphans] [mUsing haddock version 2.30.0 found on system at:
[2m[base-orphans] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[base-orphans] [mNo happy found
[2m[base-orphans] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[base-orphans] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[base-orphans] [mNo hmake found
[2m[base-orphans] [mUsing hpc version 0.69 found on system at:
[2m[base-orphans] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[base-orphans] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[base-orphans] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[base-orphans] [mUsing hscolour version 1.25 found on system at:
[2m[base-orphans] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[base-orphans] [mNo jhc found
[2m[base-orphans] [mUsing ld found on system at:
[2m[base-orphans] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[base-orphans] [mNo pkg-config found
[2m[base-orphans] [mUsing runghc version 9.8.1 found on system at:
[2m[base-orphans] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[base-orphans] [mUsing strip version 2.44 found on system at:
[2m[base-orphans] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[base-orphans] [mUsing tar found on system at:
[2m[base-orphans] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[base-orphans] [mNo uhc found
[2m[stringbuilder] [mSource component graph:
[2m[stringbuilder] [m    component lib
[2m[stringbuilder] [m    component test:spec dependency lib
[2m[stringbuilder] [mConfigured component graph:
[2m[stringbuilder] [m    component stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [m        include base-4.19.0.0-b960
[2m[stringbuilder] [m    component stringbuilder-0.5.1-GZqP41pKObDIygldD47jwR-spec
[2m[stringbuilder] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[stringbuilder] [m        include base-4.19.0.0-b960
[2m[stringbuilder] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[stringbuilder] [m        include stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [mLinked component graph:
[2m[stringbuilder] [m    unit stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [m        include base-4.19.0.0-b960
[2m[stringbuilder] [m        Data.String.Builder=stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq:Data.String.Builder
[2m[stringbuilder] [m    unit stringbuilder-0.5.1-GZqP41pKObDIygldD47jwR-spec
[2m[stringbuilder] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[stringbuilder] [m        include base-4.19.0.0-b960
[2m[stringbuilder] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[stringbuilder] [m        include stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [mReady component graph:
[2m[stringbuilder] [m    definite stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [m        depends base-4.19.0.0-b960
[2m[stringbuilder] [m    definite stringbuilder-0.5.1-GZqP41pKObDIygldD47jwR-spec
[2m[stringbuilder] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[stringbuilder] [m        depends base-4.19.0.0-b960
[2m[stringbuilder] [m        depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[stringbuilder] [m        depends stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[stringbuilder] [mUsing compiler: ghc-9.8.1
[2m[stringbuilder] [mUsing install prefix:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1
[2m[stringbuilder] [mExecutables installed in:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/bin
[2m[stringbuilder] [mLibraries installed in:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[stringbuilder] [mDynamic Libraries installed in:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[stringbuilder] [mPrivate executables installed in:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/libexec/x86_64-linux-ghc-9.8.1/stringbuilder-0.5.1
[2m[stringbuilder] [mData files installed in:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/share/x86_64-linux-ghc-9.8.1/stringbuilder-0.5.1
[2m[stringbuilder] [mDocumentation installed in:
[2m[stringbuilder] [m/nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc/share/doc/stringbuilder-0.5.1
[2m[stringbuilder] [mConfiguration files installed in:
[2m[stringbuilder] [m/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/etc
[2m[stringbuilder] [mNo alex found
[2m[stringbuilder] [mUsing ar found on system at:
[2m[stringbuilder] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[stringbuilder] [mNo c2hs found
[2m[stringbuilder] [mNo cpphs found
[2m[stringbuilder] [mNo doctest found
[2m[stringbuilder] [mUsing gcc version 14.3.0 given by user at:
[2m[stringbuilder] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[stringbuilder] [mUsing ghc version 9.8.1 found on system at:
[2m[stringbuilder] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[stringbuilder] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[stringbuilder] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[stringbuilder] [mNo ghcjs found
[2m[stringbuilder] [mNo ghcjs-pkg found
[2m[stringbuilder] [mNo greencard found
[2m[stringbuilder] [mUsing haddock version 2.30.0 found on system at:
[2m[stringbuilder] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[stringbuilder] [mNo happy found
[2m[stringbuilder] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[stringbuilder] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[stringbuilder] [mNo hmake found
[2m[stringbuilder] [mUsing hpc version 0.69 found on system at:
[2m[stringbuilder] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[stringbuilder] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[stringbuilder] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[stringbuilder] [mUsing hscolour version 1.25 found on system at:
[2m[stringbuilder] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[stringbuilder] [mNo jhc found
[2m[stringbuilder] [mUsing ld found on system at:
[2m[stringbuilder] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[stringbuilder] [mNo pkg-config found
[2m[stringbuilder] [mUsing runghc version 9.8.1 found on system at:
[2m[stringbuilder] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[stringbuilder] [mUsing strip version 2.44 found on system at:
[2m[stringbuilder] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[stringbuilder] [mUsing tar found on system at:
[2m[stringbuilder] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[stringbuilder] [mNo uhc found
[2m[safe-exceptions] [mSource component graph:
[2m[safe-exceptions] [m    component lib
[2m[safe-exceptions] [m    component test:safe-exceptions-test dependency lib
[2m[safe-exceptions] [mConfigured component graph:
[2m[safe-exceptions] [m    component safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m        include base-4.19.0.0-b960
[2m[safe-exceptions] [m        include deepseq-1.5.0.0-412f
[2m[safe-exceptions] [m        include exceptions-0.10.7-d3e7
[2m[safe-exceptions] [m        include transformers-0.6.1.0-c3ec
[2m[safe-exceptions] [m    component safe-exceptions-0.1.7.4-30Yvf5kHJBXHckMY7561IN-safe-exceptions-test
[2m[safe-exceptions] [m        include base-4.19.0.0-b960
[2m[safe-exceptions] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[safe-exceptions] [m        include safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m        include transformers-0.6.1.0-c3ec
[2m[safe-exceptions] [m        include void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
[2m[safe-exceptions] [mLinked component graph:
[2m[safe-exceptions] [m    unit safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m        include base-4.19.0.0-b960
[2m[safe-exceptions] [m        include deepseq-1.5.0.0-412f
[2m[safe-exceptions] [m        include exceptions-0.10.7-d3e7
[2m[safe-exceptions] [m        include transformers-0.6.1.0-c3ec
[2m[safe-exceptions] [m        Control.Exception.Safe=safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv:Control.Exception.Safe
[2m[safe-exceptions] [m    unit safe-exceptions-0.1.7.4-30Yvf5kHJBXHckMY7561IN-safe-exceptions-test
[2m[safe-exceptions] [m        include base-4.19.0.0-b960
[2m[safe-exceptions] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[safe-exceptions] [m        include safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m        include transformers-0.6.1.0-c3ec
[2m[safe-exceptions] [m        include void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
[2m[safe-exceptions] [mReady component graph:
[2m[safe-exceptions] [m    definite safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m        depends base-4.19.0.0-b960
[2m[safe-exceptions] [m        depends deepseq-1.5.0.0-412f
[2m[safe-exceptions] [m        depends exceptions-0.10.7-d3e7
[2m[safe-exceptions] [m        depends transformers-0.6.1.0-c3ec
[2m[safe-exceptions] [m    definite safe-exceptions-0.1.7.4-30Yvf5kHJBXHckMY7561IN-safe-exceptions-test
[2m[safe-exceptions] [m        depends base-4.19.0.0-b960
[2m[safe-exceptions] [m        depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[safe-exceptions] [m        depends safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m        depends transformers-0.6.1.0-c3ec
[2m[safe-exceptions] [m        depends void-0.7.3-5yU89rtcFpHDt8FMuiMLJt
[2m[safe-exceptions] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[safe-exceptions] [mUsing compiler: ghc-9.8.1
[2m[safe-exceptions] [mUsing install prefix:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mExecutables installed in:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/bin
[2m[safe-exceptions] [mLibraries installed in:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [mDynamic Libraries installed in:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[safe-exceptions] [mPrivate executables installed in:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/libexec/x86_64-linux-ghc-9.8.1/safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mData files installed in:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/share/x86_64-linux-ghc-9.8.1/safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mDocumentation installed in:
[2m[safe-exceptions] [m/nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc/share/doc/safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mConfiguration files installed in:
[2m[safe-exceptions] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/etc
[2m[safe-exceptions] [mNo alex found
[2m[safe-exceptions] [mUsing ar found on system at:
[2m[safe-exceptions] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[safe-exceptions] [mNo c2hs found
[2m[safe-exceptions] [mNo cpphs found
[2m[safe-exceptions] [mNo doctest found
[2m[safe-exceptions] [mUsing gcc version 14.3.0 given by user at:
[2m[safe-exceptions] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[safe-exceptions] [mUsing ghc version 9.8.1 found on system at:
[2m[safe-exceptions] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[safe-exceptions] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[safe-exceptions] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[safe-exceptions] [mNo ghcjs found
[2m[safe-exceptions] [mNo ghcjs-pkg found
[2m[safe-exceptions] [mNo greencard found
[2m[safe-exceptions] [mUsing haddock version 2.30.0 found on system at:
[2m[safe-exceptions] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[safe-exceptions] [mNo happy found
[2m[safe-exceptions] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[safe-exceptions] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[safe-exceptions] [mNo hmake found
[2m[safe-exceptions] [mUsing hpc version 0.69 found on system at:
[2m[safe-exceptions] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[safe-exceptions] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[safe-exceptions] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[safe-exceptions] [mUsing hscolour version 1.25 found on system at:
[2m[safe-exceptions] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[safe-exceptions] [mNo jhc found
[2m[safe-exceptions] [mUsing ld found on system at:
[2m[safe-exceptions] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[safe-exceptions] [mNo pkg-config found
[2m[safe-exceptions] [mUsing runghc version 9.8.1 found on system at:
[2m[safe-exceptions] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[safe-exceptions] [mUsing strip version 2.44 found on system at:
[2m[safe-exceptions] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[safe-exceptions] [mUsing tar found on system at:
[2m[safe-exceptions] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[safe-exceptions] [mNo uhc found
[2m[generic-deriving] [m[1;36mPhase: buildPhase[m
[2m[resourcet] [m[1;36mPhase: buildPhase[m
[2m[base-orphans] [m[1;36mPhase: buildPhase[m
[2m[generic-deriving] [mPreprocessing library for generic-deriving-1.14.6..
[2m[generic-deriving] [mBuilding library for generic-deriving-1.14.6..
[2m[stringbuilder] [m[1;36mPhase: buildPhase[m
[2m[resourcet] [mPreprocessing library for resourcet-1.3.0..
[2m[resourcet] [mBuilding library for resourcet-1.3.0..
[2m[safe-exceptions] [m[1;36mPhase: buildPhase[m
[2m[base-orphans] [mPreprocessing library for base-orphans-0.9.3..
[2m[base-orphans] [mBuilding library for base-orphans-0.9.3..
[2m[stringbuilder] [mPreprocessing library for stringbuilder-0.5.1..
[2m[stringbuilder] [mBuilding library for stringbuilder-0.5.1..
[2m[safe-exceptions] [mPreprocessing library for safe-exceptions-0.1.7.4..
[2m[safe-exceptions] [mBuilding library for safe-exceptions-0.1.7.4..
[2m[stringbuilder] [m[1 of 1] Compiling Data.String.Builder ( src/Data/String/Builder.hs, dist/build/Data/String/Builder.o, dist/build/Data/String/Builder.dyn_o )
[2m[resourcet] [m[1 of 5] Compiling Data.Acquire.Internal ( Data/Acquire/Internal.hs, dist/build/Data/Acquire/Internal.o, dist/build/Data/Acquire/Internal.dyn_o )
[2m[base-orphans] [m[1 of 2] Compiling Data.Orphans.Prelude ( src/Data/Orphans/Prelude.hs, dist/build/Data/Orphans/Prelude.o, dist/build/Data/Orphans/Prelude.dyn_o )
[2m[safe-exceptions] [m[1 of 1] Compiling Control.Exception.Safe ( src/Control/Exception/Safe.hs, dist/build/Control/Exception/Safe.o, dist/build/Control/Exception/Safe.dyn_o )
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:24:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The import of ‘Control.Applicative’ is redundant
[2m[stringbuilder] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[stringbuilder] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m24 |[0m[0m [;1m[35mimport           Control.Applicative[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:26:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The import of ‘Data.Monoid’ is redundant
[2m[stringbuilder] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[stringbuilder] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m26 |[0m[0m [;1m[35mimport           Data.Monoid[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:34:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-22705[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monad-instances[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    Noncanonical ‘pure = return’ definition detected
[2m[stringbuilder] [m    in the instance declaration for ‘Applicative BuilderM’.
[2m[stringbuilder] [m    Suggested fix:
[2m[stringbuilder] [m      Move definition from ‘return’ to ‘pure’
[2m[stringbuilder] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m34 |[0m[0m   [;1m[35mpure = return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m   ^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:38:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-22705[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monad-instances[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    Noncanonical ‘return’ definition detected
[2m[stringbuilder] [m    in the instance declaration for ‘Monad BuilderM’.
[2m[stringbuilder] [m    ‘return’ will eventually be removed in favour of ‘pure’
[2m[stringbuilder] [m    Suggested fix:
[2m[stringbuilder] [m      Either remove definition for ‘return’ (recommended) or define as ‘return = pure’
[2m[stringbuilder] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m38 |[0m[0m   [;1m[35mreturn a            = BuilderM a id[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:57:13: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The use of ‘~’ without TypeOperators
[2m[stringbuilder] [m    will become an error in a future GHC release.
[2m[stringbuilder] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m57 |[0m[0m instance (a [;1m[35m~[0m[0m ()) => IsString (BuilderM a) where
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m             ^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mData/Acquire/Internal.hs:17:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Control.Applicative’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[resourcet] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m17 |[0m[0m [;1m[35mimport Control.Applicative (Applicative (..))[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[generic-deriving] [m[ 1 of 21] Compiling Generics.Deriving.Instances ( src/Generics/Deriving/Instances.hs, dist/build/Generics/Deriving/Instances.o, dist/build/Generics/Deriving/Instances.dyn_o )
[2m[generic-deriving] [m[ 2 of 21] Compiling Generics.Deriving.Base ( src/Generics/Deriving/Base.hs, dist/build/Generics/Deriving/Base.o, dist/build/Generics/Deriving/Base.dyn_o )
[2m[base-orphans] [m[2 of 2] Compiling Data.Orphans     ( src/Data/Orphans.hs, dist/build/Data/Orphans.o, dist/build/Data/Orphans.dyn_o )
[2m[generic-deriving] [m[ 3 of 21] Compiling Generics.Deriving.Functor ( src/Generics/Deriving/Functor.hs, dist/build/Generics/Deriving/Functor.o, dist/build/Generics/Deriving/Functor.dyn_o )
[2m[resourcet] [m[2 of 5] Compiling Control.Monad.Trans.Resource.Internal ( Control/Monad/Trans/Resource/Internal.hs, dist/build/Control/Monad/Trans/Resource/Internal.o, dist/build/Control/Monad/Trans/Resource/Internal.dyn_o )
[2m[stringbuilder] [m[1 of 1] Compiling Data.String.Builder ( src/Data/String/Builder.hs, dist/build/Data/String/Builder.p_o )
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:24:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The import of ‘Control.Applicative’ is redundant
[2m[stringbuilder] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[stringbuilder] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m24 |[0m[0m [;1m[35mimport           Control.Applicative[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:26:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The import of ‘Data.Monoid’ is redundant
[2m[stringbuilder] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[stringbuilder] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m26 |[0m[0m [;1m[35mimport           Data.Monoid[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:34:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-22705[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monad-instances[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    Noncanonical ‘pure = return’ definition detected
[2m[stringbuilder] [m    in the instance declaration for ‘Applicative BuilderM’.
[2m[stringbuilder] [m    Suggested fix:
[2m[stringbuilder] [m      Move definition from ‘return’ to ‘pure’
[2m[stringbuilder] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m34 |[0m[0m   [;1m[35mpure = return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m   ^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:38:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-22705[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monad-instances[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    Noncanonical ‘return’ definition detected
[2m[stringbuilder] [m    in the instance declaration for ‘Monad BuilderM’.
[2m[stringbuilder] [m    ‘return’ will eventually be removed in favour of ‘pure’
[2m[stringbuilder] [m    Suggested fix:
[2m[stringbuilder] [m      Either remove definition for ‘return’ (recommended) or define as ‘return = pure’
[2m[stringbuilder] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m38 |[0m[0m   [;1m[35mreturn a            = BuilderM a id[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:57:13: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The use of ‘~’ without TypeOperators
[2m[stringbuilder] [m    will become an error in a future GHC release.
[2m[stringbuilder] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m57 |[0m[0m instance (a [;1m[35m~[0m[0m ()) => IsString (BuilderM a) where
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m             ^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:28:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-38856[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Applicative’
[2m[resourcet] [m    from module ‘Control.Applicative’ is redundant[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m28 |[0m[0m import Control.Applicative ([;1m[35mApplicative (..)[0m[0m, Alternative(..))
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m                             ^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:57:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Control.Monad.IO.Class’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Control.Monad.IO.Class’
[2m[resourcet] [m    To import instances alone, use: import Control.Monad.IO.Class()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m57 |[0m[0m [;1m[35mimport Control.Monad.IO.Class (MonadIO (..))[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:67:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Data.Word’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Data.Word’
[2m[resourcet] [m    To import instances alone, use: import Data.Word()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m67 |[0m[0m [;1m[35mimport Data.Word(Word)[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[safe-exceptions] [m[1 of 1] Compiling Control.Exception.Safe ( src/Control/Exception/Safe.hs, dist/build/Control/Exception/Safe.p_o )
[2m[resourcet] [m[3 of 5] Compiling Data.Acquire     ( Data/Acquire.hs, dist/build/Data/Acquire.o, dist/build/Data/Acquire.dyn_o )
[2m[resourcet] [m[4 of 5] Compiling Control.Monad.Trans.Resource ( Control/Monad/Trans/Resource.hs, dist/build/Control/Monad/Trans/Resource.o, dist/build/Control/Monad/Trans/Resource.dyn_o )
[2m[generic-deriving] [m[ 4 of 21] Compiling Generics.Deriving.Foldable ( src/Generics/Deriving/Foldable.hs, dist/build/Generics/Deriving/Foldable.o, dist/build/Generics/Deriving/Foldable.dyn_o )
[2m[stringbuilder] [mPreprocessing test suite 'spec' for stringbuilder-0.5.1..
[2m[stringbuilder] [mBuilding test suite 'spec' for stringbuilder-0.5.1..
[2m[resourcet] [m[5 of 5] Compiling UnliftIO.Resource ( UnliftIO/Resource.hs, dist/build/UnliftIO/Resource.o, dist/build/UnliftIO/Resource.dyn_o )
[2m[stringbuilder] [m[1 of 1] Compiling Main             ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
[2m[base-orphans] [m[1 of 2] Compiling Data.Orphans.Prelude ( src/Data/Orphans/Prelude.hs, dist/build/Data/Orphans/Prelude.p_o )
[2m[resourcet] [m[1 of 5] Compiling Data.Acquire.Internal ( Data/Acquire/Internal.hs, dist/build/Data/Acquire/Internal.p_o )
[2m[stringbuilder] [m[2 of 2] Linking dist/build/spec/spec
[2m[resourcet] [m
[2m[resourcet] [m[;1mData/Acquire/Internal.hs:17:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Control.Applicative’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[resourcet] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m17 |[0m[0m [;1m[35mimport Control.Applicative (Applicative (..))[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[base-orphans] [m[2 of 2] Compiling Data.Orphans     ( src/Data/Orphans.hs, dist/build/Data/Orphans.p_o )
[2m[generic-deriving] [m[ 5 of 21] Compiling Generics.Deriving.Eq ( src/Generics/Deriving/Eq.hs, dist/build/Generics/Deriving/Eq.o, dist/build/Generics/Deriving/Eq.dyn_o )
[2m[generic-deriving] [m[ 6 of 21] Compiling Generics.Deriving.Enum ( src/Generics/Deriving/Enum.hs, dist/build/Generics/Deriving/Enum.o, dist/build/Generics/Deriving/Enum.dyn_o )
[2m[resourcet] [m[2 of 5] Compiling Control.Monad.Trans.Resource.Internal ( Control/Monad/Trans/Resource/Internal.hs, dist/build/Control/Monad/Trans/Resource/Internal.p_o )
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:28:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-38856[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Applicative’
[2m[resourcet] [m    from module ‘Control.Applicative’ is redundant[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m28 |[0m[0m import Control.Applicative ([;1m[35mApplicative (..)[0m[0m, Alternative(..))
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m                             ^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:57:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Control.Monad.IO.Class’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Control.Monad.IO.Class’
[2m[resourcet] [m    To import instances alone, use: import Control.Monad.IO.Class()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m57 |[0m[0m [;1m[35mimport Control.Monad.IO.Class (MonadIO (..))[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:67:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Data.Word’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Data.Word’
[2m[resourcet] [m    To import instances alone, use: import Data.Word()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m67 |[0m[0m [;1m[35mimport Data.Word(Word)[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[safe-exceptions] [mPreprocessing test suite 'safe-exceptions-test' for safe-exceptions-0.1.7.4..
[2m[safe-exceptions] [mBuilding test suite 'safe-exceptions-test' for safe-exceptions-0.1.7.4..
[2m[stringbuilder] [m[1;36mPhase: checkPhase[m
[2m[stringbuilder] [mRunning 1 test suites...
[2m[stringbuilder] [mTest suite spec: RUNNING...
[2m[safe-exceptions] [m[1 of 2] Compiling Control.Exception.SafeSpec ( test/Control/Exception/SafeSpec.hs, dist/build/safe-exceptions-test/safe-exceptions-test-tmp/Control/Exception/SafeSpec.o )
[2m[stringbuilder] [m
[2m[stringbuilder] [mbuild
[2m[stringbuilder] [m  can be used to construct multi-line string literals in a monadic way [✔]
[2m[stringbuilder] [m  works for arbitrary input [✔]
[2m[stringbuilder] [m    +++ OK, passed 100 tests.
[2m[stringbuilder] [m
[2m[stringbuilder] [mFinished in 0.0206 seconds
[2m[stringbuilder] [m2 examples, 0 failures
[2m[stringbuilder] [mTest suite spec: PASS
[2m[stringbuilder] [mTest suite logged to: dist/test/stringbuilder-0.5.1-spec.log
[2m[stringbuilder] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[stringbuilder] [m[1;36mPhase: haddockPhase[m
[2m[stringbuilder] [mPreprocessing library for stringbuilder-0.5.1..
[2m[stringbuilder] [mRunning Haddock on library for stringbuilder-0.5.1..
[2m[stringbuilder] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[stringbuilder] [m[1 of 1] Compiling Data.String.Builder ( src/Data/String/Builder.hs, nothing )
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:24:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The import of ‘Control.Applicative’ is redundant
[2m[stringbuilder] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[stringbuilder] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m24 |[0m[0m [;1m[35mimport           Control.Applicative[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:26:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The import of ‘Data.Monoid’ is redundant
[2m[stringbuilder] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[stringbuilder] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m26 |[0m[0m [;1m[35mimport           Data.Monoid[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:34:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-22705[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monad-instances[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    Noncanonical ‘pure = return’ definition detected
[2m[stringbuilder] [m    in the instance declaration for ‘Applicative BuilderM’.
[2m[stringbuilder] [m    Suggested fix:
[2m[stringbuilder] [m      Move definition from ‘return’ to ‘pure’
[2m[stringbuilder] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m34 |[0m[0m   [;1m[35mpure = return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m   ^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:38:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-22705[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monad-instances[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    Noncanonical ‘return’ definition detected
[2m[stringbuilder] [m    in the instance declaration for ‘Monad BuilderM’.
[2m[stringbuilder] [m    ‘return’ will eventually be removed in favour of ‘pure’
[2m[stringbuilder] [m    Suggested fix:
[2m[stringbuilder] [m      Either remove definition for ‘return’ (recommended) or define as ‘return = pure’
[2m[stringbuilder] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m38 |[0m[0m   [;1m[35mreturn a            = BuilderM a id[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[stringbuilder] [m
[2m[stringbuilder] [m[;1msrc/Data/String/Builder.hs:57:13: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[stringbuilder] [m    The use of ‘~’ without TypeOperators
[2m[stringbuilder] [m    will become an error in a future GHC release.
[2m[stringbuilder] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[stringbuilder] [m[;1m[34m   |[0m[0m
[2m[stringbuilder] [m[;1m[34m57 |[0m[0m instance (a [;1m[35m~[0m[0m ()) => IsString (BuilderM a) where
[2m[stringbuilder] [m[;1m[34m   |[0m[0m[;1m[35m             ^[0m[0m
[2m[stringbuilder] [mHaddock coverage:
[2m[stringbuilder] [m  85% (  6 /  7) in 'Data.String.Builder'
[2m[stringbuilder] [m  Missing documentation for:
[2m[stringbuilder] [m    Builder (src/Data/String/Builder.hs:42)
[2m[resourcet] [m[3 of 5] Compiling Data.Acquire     ( Data/Acquire.hs, dist/build/Data/Acquire.p_o )
[2m[resourcet] [m[4 of 5] Compiling Control.Monad.Trans.Resource ( Control/Monad/Trans/Resource.hs, dist/build/Control/Monad/Trans/Resource.p_o )
[2m[resourcet] [m[5 of 5] Compiling UnliftIO.Resource ( UnliftIO/Resource.hs, dist/build/UnliftIO/Resource.p_o )
[2m[safe-exceptions] [m[2 of 2] Compiling Main             ( test/Spec.hs, dist/build/safe-exceptions-test/safe-exceptions-test-tmp/Main.o )
[2m[base-orphans] [mPreprocessing test suite 'spec' for base-orphans-0.9.3..
[2m[base-orphans] [mBuilding test suite 'spec' for base-orphans-0.9.3..
[2m[safe-exceptions] [m[3 of 3] Linking dist/build/safe-exceptions-test/safe-exceptions-test
[2m[base-orphans] [m[ 1 of 13] Compiling Control.Applicative.OrphansSpec ( test/Control/Applicative/OrphansSpec.hs, dist/build/spec/spec-tmp/Control/Applicative/OrphansSpec.o )
[2m[resourcet] [mPreprocessing test suite 'test' for resourcet-1.3.0..
[2m[resourcet] [mBuilding test suite 'test' for resourcet-1.3.0..
[2m[stringbuilder] [mDocumentation created: dist/doc/html/stringbuilder/,
[2m[stringbuilder] [mdist/doc/html/stringbuilder/stringbuilder.txt
[2m[base-orphans] [m[ 2 of 13] Compiling Control.Exception.OrphansSpec ( test/Control/Exception/OrphansSpec.hs, dist/build/spec/spec-tmp/Control/Exception/OrphansSpec.o )
[2m[base-orphans] [m[ 3 of 13] Compiling Data.Bits.OrphansSpec ( test/Data/Bits/OrphansSpec.hs, dist/build/spec/spec-tmp/Data/Bits/OrphansSpec.o )
[2m[base-orphans] [m[ 4 of 13] Compiling Data.Foldable.OrphansSpec ( test/Data/Foldable/OrphansSpec.hs, dist/build/spec/spec-tmp/Data/Foldable/OrphansSpec.o )
[2m[resourcet] [m[1 of 1] Compiling Main             ( test/main.hs, dist/build/test/test-tmp/Main.o )
[2m[stringbuilder] [mPreprocessing test suite 'spec' for stringbuilder-0.5.1..
[2m[stringbuilder] [m[1;36mPhase: installPhase[m
[2m[base-orphans] [m[ 5 of 13] Compiling Data.Monoid.OrphansSpec ( test/Data/Monoid/OrphansSpec.hs, dist/build/spec/spec-tmp/Data/Monoid/OrphansSpec.o )
[2m[base-orphans] [m[ 6 of 13] Compiling Data.Traversable.OrphansSpec ( test/Data/Traversable/OrphansSpec.hs, dist/build/spec/spec-tmp/Data/Traversable/OrphansSpec.o )
[2m[base-orphans] [m[ 7 of 13] Compiling Data.Version.OrphansSpec ( test/Data/Version/OrphansSpec.hs, dist/build/spec/spec-tmp/Data/Version/OrphansSpec.o )
[2m[base-orphans] [m[ 8 of 13] Compiling Foreign.Storable.OrphansSpec ( test/Foreign/Storable/OrphansSpec.hs, dist/build/spec/spec-tmp/Foreign/Storable/OrphansSpec.o )
[2m[base-orphans] [m[ 9 of 13] Compiling GHC.Fingerprint.OrphansSpec ( test/GHC/Fingerprint/OrphansSpec.hs, dist/build/spec/spec-tmp/GHC/Fingerprint/OrphansSpec.o )
[2m[base-orphans] [m[10 of 13] Compiling Paths_base_orphans ( dist/build/spec/autogen/Paths_base_orphans.hs, dist/build/spec/spec-tmp/Paths_base_orphans.o )
[2m[base-orphans] [m[11 of 13] Compiling System.Posix.Types.IntWord ( test/System/Posix/Types/IntWord.hs, dist/build/spec/spec-tmp/System/Posix/Types/IntWord.o )
[2m[base-orphans] [m[12 of 13] Compiling System.Posix.Types.OrphansSpec ( test/System/Posix/Types/OrphansSpec.hs, dist/build/spec/spec-tmp/System/Posix/Types/OrphansSpec.o )
[2m[generic-deriving] [m[ 7 of 21] Compiling Generics.Deriving.Copoint ( src/Generics/Deriving/Copoint.hs, dist/build/Generics/Deriving/Copoint.o, dist/build/Generics/Deriving/Copoint.dyn_o )
[2m[generic-deriving] [m[ 8 of 21] Compiling Generics.Deriving.ConNames ( src/Generics/Deriving/ConNames.hs, dist/build/Generics/Deriving/ConNames.o, dist/build/Generics/Deriving/ConNames.dyn_o )
[2m[generic-deriving] [m[ 9 of 21] Compiling Generics.Deriving.Semigroup.Internal ( src/Generics/Deriving/Semigroup/Internal.hs, dist/build/Generics/Deriving/Semigroup/Internal.o, dist/build/Generics/Deriving/Semigroup/Internal.dyn_o )
[2m[generic-deriving] [m[10 of 21] Compiling Generics.Deriving.Monoid.Internal ( src/Generics/Deriving/Monoid/Internal.hs, dist/build/Generics/Deriving/Monoid/Internal.o, dist/build/Generics/Deriving/Monoid/Internal.dyn_o )
[2m[generic-deriving] [m[11 of 21] Compiling Generics.Deriving.Semigroup ( src/Generics/Deriving/Semigroup.hs, dist/build/Generics/Deriving/Semigroup.o, dist/build/Generics/Deriving/Semigroup.dyn_o )
[2m[generic-deriving] [m[12 of 21] Compiling Generics.Deriving.Monoid ( src/Generics/Deriving/Monoid.hs, dist/build/Generics/Deriving/Monoid.o, dist/build/Generics/Deriving/Monoid.dyn_o )
[2m[generic-deriving] [m[13 of 21] Compiling Generics.Deriving.Show ( src/Generics/Deriving/Show.hs, dist/build/Generics/Deriving/Show.o, dist/build/Generics/Deriving/Show.dyn_o )
[2m[generic-deriving] [m[14 of 21] Compiling Generics.Deriving.Traversable ( src/Generics/Deriving/Traversable.hs, dist/build/Generics/Deriving/Traversable.o, dist/build/Generics/Deriving/Traversable.dyn_o )
[2m[generic-deriving] [m[15 of 21] Compiling Generics.Deriving.Uniplate ( src/Generics/Deriving/Uniplate.hs, dist/build/Generics/Deriving/Uniplate.o, dist/build/Generics/Deriving/Uniplate.dyn_o )
[2m[generic-deriving] [m[16 of 21] Compiling Generics.Deriving.Default ( src/Generics/Deriving/Default.hs, dist/build/Generics/Deriving/Default.o, dist/build/Generics/Deriving/Default.dyn_o )
[2m[safe-exceptions] [m[1;36mPhase: checkPhase[m
[2m[stringbuilder] [mInstalling library in /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
[2m[safe-exceptions] [mRunning 1 test suites...
[2m[safe-exceptions] [mTest suite safe-exceptions-test: RUNNING...
[2m[safe-exceptions] [m
[2m[safe-exceptions] [mControl.Exception.Safe
[2m[safe-exceptions] [m  isSyncException
[2m[safe-exceptions] [m    arithmetic overflow [✔]
[2m[safe-exceptions] [m    thread killed [✔]
[2m[safe-exceptions] [m    <<timeout>> [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  isAsncException
[2m[safe-exceptions] [m    arithmetic overflow [✔]
[2m[safe-exceptions] [m    thread killed [✔]
[2m[safe-exceptions] [m    <<timeout>> [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  toSyncException
[2m[safe-exceptions] [m    arithmetic overflow [✔]
[2m[safe-exceptions] [m    thread killed [✔]
[2m[safe-exceptions] [m    <<timeout>> [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  toAsyncException
[2m[safe-exceptions] [m    arithmetic overflow [✔]
[2m[safe-exceptions] [m    thread killed [✔]
[2m[safe-exceptions] [m    <<timeout>> [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  throw
[2m[safe-exceptions] [m    arithmetic overflow [✔]
[2m[safe-exceptions] [m    thread killed [✔]
[2m[safe-exceptions] [m    <<timeout>> [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  throwTo
[2m[safe-exceptions] [m    arithmetic overflow [✔]
[2m[safe-exceptions] [m    thread killed [✔]
[2m[safe-exceptions] [m    <<timeout>> [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m    thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  stays async
[2m[safe-exceptions] [m    onException
[2m[safe-exceptions] [m      sync/sync [✔]
[2m[safe-exceptions] [m      async/sync [✔]
[2m[safe-exceptions] [m      async/async [✔]
[2m[safe-exceptions] [m    withException
[2m[safe-exceptions] [m      sync/sync [✔]
[2m[safe-exceptions] [m      async/sync [✔]
[2m[safe-exceptions] [m      async/async [✔]
[2m[safe-exceptions] [m    bracket_
[2m[safe-exceptions] [m      sync/sync [✔]
[2m[safe-exceptions] [m      async/sync [✔]
[2m[safe-exceptions] [m      async/async [✔]
[2m[safe-exceptions] [m    finally
[2m[safe-exceptions] [m      sync/sync [✔]
[2m[safe-exceptions] [m      async/sync [✔]
[2m[safe-exceptions] [m      async/async [✔]
[2m[safe-exceptions] [m    bracketOnError_
[2m[safe-exceptions] [m      sync/sync [✔]
[2m[safe-exceptions] [m      async/sync [✔]
[2m[safe-exceptions] [m      async/async [✔]
[2m[safe-exceptions] [m  deepseq
[2m[safe-exceptions] [m    catchAnyDeep
[2m[safe-exceptions] [m      arithmetic overflow [✔]
[2m[safe-exceptions] [m      thread killed [✔]
[2m[safe-exceptions] [m      <<timeout>> [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m    handleAnyDeep
[2m[safe-exceptions] [m      arithmetic overflow [✔]
[2m[safe-exceptions] [m      thread killed [✔]
[2m[safe-exceptions] [m      <<timeout>> [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m    tryAnyDeep
[2m[safe-exceptions] [m      arithmetic overflow [✔]
[2m[safe-exceptions] [m      thread killed [✔]
[2m[safe-exceptions] [m      <<timeout>> [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m    catchesDeep
[2m[safe-exceptions] [m      arithmetic overflow [✔]
[2m[safe-exceptions] [m      thread killed [✔]
[2m[safe-exceptions] [m      <<timeout>> [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an MVar operation [✔]
[2m[safe-exceptions] [m      thread blocked indefinitely in an STM transaction [✔]
[2m[safe-exceptions] [m  catchJust
[2m[safe-exceptions] [m    catches a selected exception [✔]
[2m[safe-exceptions] [m    re-raises a selection that is passed on [✔]
[2m[safe-exceptions] [m  throwString
[2m[safe-exceptions] [m    is a StringException [✔]
[2m[safe-exceptions] [m  bracketWithError
[2m[safe-exceptions] [m    should prioritize exceptions from thing [✔]
[2m[safe-exceptions] [m    should lift through ExceptT [✔]
[2m[safe-exceptions] [m
[2m[safe-exceptions] [mFinished in 0.0273 seconds
[2m[safe-exceptions] [m70 examples, 0 failures
[2m[safe-exceptions] [mTest suite safe-exceptions-test: PASS
[2m[safe-exceptions] [mTest suite logged to:
[2m[safe-exceptions] [mdist/test/safe-exceptions-0.1.7.4-safe-exceptions-test.log
[2m[safe-exceptions] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[safe-exceptions] [m[1;36mPhase: haddockPhase[m
[2m[generic-deriving] [m[17 of 21] Compiling Generics.Deriving ( src/Generics/Deriving.hs, dist/build/Generics/Deriving.o, dist/build/Generics/Deriving.dyn_o )
[2m[generic-deriving] [m[18 of 21] Compiling Generics.Deriving.TH.Internal ( src/Generics/Deriving/TH/Internal.hs, dist/build/Generics/Deriving/TH/Internal.o, dist/build/Generics/Deriving/TH/Internal.dyn_o )
[2m[stringbuilder] [m[1;36mPhase: fixupPhase[m
[2m[safe-exceptions] [mPreprocessing library for safe-exceptions-0.1.7.4..
[2m[safe-exceptions] [mRunning Haddock on library for safe-exceptions-0.1.7.4..
[2m[stringbuilder] [mshrinking RPATHs of ELF executables and libraries in /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1
[2m[stringbuilder] [mshrinking /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSstringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq-ghc9.8.1.so
[2m[stringbuilder] [mchecking for references to /build/ in /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1...
[2m[stringbuilder] [mpatching script interpreter paths in /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1
[2m[stringbuilder] [mstripping (with command strip and flags -S -p) in  /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1/lib
[2m[safe-exceptions] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[stringbuilder] [mshrinking RPATHs of ELF executables and libraries in /nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc
[2m[stringbuilder] [mchecking for references to /build/ in /nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc...
[2m[stringbuilder] [mpatching script interpreter paths in /nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc
[2m[base-orphans] [m[13 of 13] Compiling Main             ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
[2m[stringbuilder:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1[m
[2m[stringbuilder:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[stringbuilder:post-build] [m[2m[m
[2m[stringbuilder:post-build] [m[2mPushing /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1 (181.77 KiB)[m
[2m[stringbuilder:post-build] [m[2mPushing /nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc (141.80 KiB)[m
[2m[stringbuilder:post-build] [m[2m[m
[2m[stringbuilder:post-build] [m[2mAll done.[m
[2m[stringbuilder:post-build] [m[2mUploading to the NixCI cache: /nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc /nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1[m
[2m[stringbuilder:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[stringbuilder:post-build] [m[2mcopying 2 paths...[m
[2m[stringbuilder:post-build] [m[2mcopying path '/nix/store/0prr987bvfy1yb3b9q746xlsc87mm563-stringbuilder-0.5.1-doc' to 'https://cache.nix-ci.com'...[m
[2m[stringbuilder:post-build] [m[2mcopying path '/nix/store/7rjn3ga8l1da47h9m7lr4r90aadd6g02-stringbuilder-0.5.1' to 'https://cache.nix-ci.com'...[m
[2m[stringbuilder:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[stringbuilder:post-build] [m[2mcopying 1 paths...[m
[2m[stringbuilder:post-build] [m[2mcopying path '/nix/store/yvchxwmlm68kdpvgcppqwdf8crcar945-stringbuilder-0.5.1.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 10 of 68 built (4 building)[m
[2m[base-orphans] [m[14 of 14] Linking dist/build/spec/spec
[2m[base-orphans] [m[1;36mPhase: checkPhase[m
[2m[base-orphans] [mRunning 1 test suites...
[2m[base-orphans] [mTest suite spec: RUNNING...
[2m[base-orphans] [m
[2m[base-orphans] [mControl.Applicative.Orphans
[2m[base-orphans] [m  Monoid (Const a b)
[2m[base-orphans] [m    mempty returns an empty const [✔]
[2m[base-orphans] [m    mappends const part [✔]
[2m[base-orphans] [m  Monad (WrappedMonad m)
[2m[base-orphans] [m    allows to use a Monad interface in a WrappedMonad [✔]
[2m[base-orphans] [mControl.Exception.Orphans
[2m[base-orphans] [m  ErrorCall
[2m[base-orphans] [m    has an Eq instance [✔]
[2m[base-orphans] [m    has an Ord instance [✔]
[2m[base-orphans] [mData.Bits.Orphans
[2m[base-orphans] [m  Bits Bool instance
[2m[base-orphans] [m    allows bitwise operations on Bools [✔]
[2m[base-orphans] [mData.Foldable.Orphans
[2m[base-orphans] [m  Either Foldable Instance
[2m[base-orphans] [m    foldMap returns mempty for a Left value [✔]
[2m[base-orphans] [m    foldMap returns the result of the function on the Right value [✔]
[2m[base-orphans] [m    foldr returns the accumulator for a Left value [✔]
[2m[base-orphans] [m    foldr returns the result of the function on the Right value and accumulator [✔]
[2m[base-orphans] [m  (,) Foldable Instance
[2m[base-orphans] [m    foldMap returns the result of the function applied to the second element [✔]
[2m[base-orphans] [m    foldr returns the result of the function on the second element of the tuple and accumulator [✔]
[2m[base-orphans] [m  Const m Foldable Instance
[2m[base-orphans] [m    foldMap always returns mempty [✔]
[2m[base-orphans] [m    foldr applies the function to the accumulator and mempty [✔]
[2m[base-orphans] [mData.Monoid.Orphans
[2m[base-orphans] [m  Num (Sum a) instance
[2m[base-orphans] [m    allows a Sum value to be created from a number [✔]
[2m[base-orphans] [m  Num (Product a) instance
[2m[base-orphans] [m    allows a Product value to be created from a number [✔]
[2m[base-orphans] [mData.Traversable.Orphans
[2m[base-orphans] [m  Either Traversable Instance
[2m[base-orphans] [m    traverses a Left value [✔]
[2m[base-orphans] [m    traverses a Right Value [✔]
[2m[base-orphans] [m  (,) a Traversable Instance
[2m[base-orphans] [m    traverses a (,) a value [✔]
[2m[base-orphans] [m  Const m Traversable Instance
[2m[base-orphans] [m    traverses a Const a value [✔]
[2m[base-orphans] [mData.Version.Orphans
[2m[base-orphans] [m  Data Version instance
[2m[base-orphans] [m    allows obtaining a Version constructor [✔]
[2m[base-orphans] [m  IsList Version instance
[2m[base-orphans] [m    creates a Version from an Int list [✔]
[2m[base-orphans] [mForeign.Storable.Orphans
[2m[base-orphans] [m  Storable Complex instance
[2m[base-orphans] [m    has twice the sizeOf its realPart [✔]
[2m[base-orphans] [m    has the alignment of its realPart [✔]
[2m[base-orphans] [m  Storable Ratio instance
[2m[base-orphans] [m    has twice the sizeOf its parameterized type [✔]
[2m[base-orphans] [m    has the alignment of its parameterized type [✔]
[2m[base-orphans] [mGHC.Fingerprint.Orphans
[2m[base-orphans] [m  Fingerprint
[2m[base-orphans] [m    has a Show instance [✔]
[2m[base-orphans] [mSystem.Posix.Types.Orphans
[2m[base-orphans] [m  CDev
[2m[base-orphans] [m    Bits instance
[2m[base-orphans] [m      implements (.&.) [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements (.|.) [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements xor [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements shift [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements rotate [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements setBit [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements clearBit [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements complementBit [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements testBit [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements complement [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements bit [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements bitSize [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements isSigned [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m    Bounded instance
[2m[base-orphans] [m      implements minBound [✔]
[2m[base-orphans] [m      implements maxBound [✔]
[2m[base-orphans] [m    Integral instance
[2m[base-orphans] [m      implements quot [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements rem [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements div [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements mod [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements quotRem [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements divMod [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m      implements toInteger [✔]
[2m[base-orphans] [m        +++ OK, passed 100 tests.
[2m[base-orphans] [m
[2m[base-orphans] [mFinished in 0.0124 seconds
[2m[base-orphans] [m49 examples, 0 failures
[2m[base-orphans] [mTest suite spec: PASS
[2m[base-orphans] [mTest suite logged to: dist/test/base-orphans-0.9.3-spec.log
[2m[base-orphans] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[base-orphans] [m[1;36mPhase: haddockPhase[m
[2m[base-orphans] [mPreprocessing library for base-orphans-0.9.3..
[2m[base-orphans] [mRunning Haddock on library for base-orphans-0.9.3..
[2m[base-orphans] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[generic-deriving] [m[19 of 21] Compiling Generics.Deriving.TH.Post4_9 ( src/Generics/Deriving/TH/Post4_9.hs, dist/build/Generics/Deriving/TH/Post4_9.o, dist/build/Generics/Deriving/TH/Post4_9.dyn_o )
[2m[generic-deriving] [m[20 of 21] Compiling Generics.Deriving.TH ( src/Generics/Deriving/TH.hs, dist/build/Generics/Deriving/TH.o, dist/build/Generics/Deriving/TH.dyn_o )
[2m[generic-deriving] [m[21 of 21] Compiling Paths_generic_deriving ( dist/build/autogen/Paths_generic_deriving.hs, dist/build/Paths_generic_deriving.o, dist/build/Paths_generic_deriving.dyn_o )
[2m[generic-deriving] [m[ 1 of 21] Compiling Generics.Deriving.Instances ( src/Generics/Deriving/Instances.hs, dist/build/Generics/Deriving/Instances.p_o )
[2m[generic-deriving] [m[ 2 of 21] Compiling Generics.Deriving.Base ( src/Generics/Deriving/Base.hs, dist/build/Generics/Deriving/Base.p_o )
[2m[generic-deriving] [m[ 3 of 21] Compiling Generics.Deriving.Functor ( src/Generics/Deriving/Functor.hs, dist/build/Generics/Deriving/Functor.p_o )
[2m[resourcet] [m[2 of 2] Linking dist/build/test/test
[2m[resourcet] [m[1;36mPhase: checkPhase[m
[2m[resourcet] [mRunning 1 test suites...
[2m[resourcet] [mTest suite test: RUNNING...
[2m[resourcet] [m
[2m[resourcet] [mgeneral
[2m[resourcet] [m  survives releasing bottom [✔]
[2m[resourcet] [mearly release
[2m[resourcet] [m  works from a different context [✔]
[2m[resourcet] [mresourceForkIO
[2m[resourcet] [m  waits for all threads [✔]
[2m[resourcet] [munprotecting
[2m[resourcet] [m  unprotect keeps resource from being cleared [✔]
[2m[resourcet] [mcleanup actions are masked #144 [✔]
[2m[resourcet] [mmkAcquireType
[2m[resourcet] [m  ResourceT
[2m[resourcet] [m    early [✔]
[2m[resourcet] [m    normal [✔]
[2m[resourcet] [m    exception [✔]
[2m[resourcet] [m  with
[2m[resourcet] [m    normal [✔]
[2m[resourcet] [m    exception [✔]
[2m[resourcet] [mrunResourceTChecked
[2m[resourcet] [m  catches exceptions [✔]
[2m[resourcet] [m  no exception is fine [✔]
[2m[resourcet] [m  catches multiple exceptions [✔]
[2m[resourcet] [mMonadMask
[2m[resourcet] [m  works [✔]
[2m[resourcet] [m
[2m[resourcet] [mFinished in 0.0007 seconds
[2m[resourcet] [m14 examples, 0 failures
[2m[resourcet] [mTest suite test: PASS
[2m[resourcet] [mTest suite logged to: dist/test/resourcet-1.3.0-test.log
[2m[resourcet] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[resourcet] [m[1;36mPhase: haddockPhase[m
[2m[resourcet] [mPreprocessing library for resourcet-1.3.0..
[2m[resourcet] [mRunning Haddock on library for resourcet-1.3.0..
[2m[resourcet] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[resourcet] [m[1 of 5] Compiling Data.Acquire.Internal ( Data/Acquire/Internal.hs, nothing )
[2m[resourcet] [m
[2m[resourcet] [m[;1mData/Acquire/Internal.hs:17:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Control.Applicative’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[resourcet] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m17 |[0m[0m [;1m[35mimport Control.Applicative (Applicative (..))[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m[2 of 5] Compiling Control.Monad.Trans.Resource.Internal ( Control/Monad/Trans/Resource/Internal.hs, nothing )
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:28:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-38856[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Applicative’
[2m[resourcet] [m    from module ‘Control.Applicative’ is redundant[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m28 |[0m[0m import Control.Applicative ([;1m[35mApplicative (..)[0m[0m, Alternative(..))
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m                             ^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:57:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Control.Monad.IO.Class’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Control.Monad.IO.Class’
[2m[resourcet] [m    To import instances alone, use: import Control.Monad.IO.Class()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m57 |[0m[0m [;1m[35mimport Control.Monad.IO.Class (MonadIO (..))[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m
[2m[resourcet] [m[;1mControl/Monad/Trans/Resource/Internal.hs:67:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[resourcet] [m    The import of ‘Data.Word’ is redundant
[2m[resourcet] [m      except perhaps to import instances from ‘Data.Word’
[2m[resourcet] [m    To import instances alone, use: import Data.Word()[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m
[2m[resourcet] [m[;1m[34m67 |[0m[0m [;1m[35mimport Data.Word(Word)[0m[0m
[2m[resourcet] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[resourcet] [m[3 of 5] Compiling Data.Acquire     ( Data/Acquire.hs, nothing )
[2m[resourcet] [m[4 of 5] Compiling Control.Monad.Trans.Resource ( Control/Monad/Trans/Resource.hs, nothing )
[2m[resourcet] [m[5 of 5] Compiling UnliftIO.Resource ( UnliftIO/Resource.hs, nothing )
[2m[resourcet] [mHaddock coverage:
[2m[resourcet] [m  71% (  5 /  7) in 'Data.Acquire.Internal'
[2m[resourcet] [m  Missing documentation for:
[2m[resourcet] [m    Module header
[2m[resourcet] [m    Allocated (Data/Acquire/Internal.hs:37)
[2m[resourcet] [mWarning: 'ResourceT' is ambiguous. It is defined
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:182:25
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:182:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m[1 of 1] Compiling Control.Exception.Safe ( src/Control/Exception/Safe.hs, nothing )
[2m[safe-exceptions] [mHaddock coverage:
[2m[safe-exceptions] [mWarning: 'throw' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘GHC.Exception’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:152:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:152:1
[2m[safe-exceptions] [mWarning: 'StringException' is ambiguous. It is defined
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:193:24
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:193:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:193:1
[2m[safe-exceptions] [mWarning: 'AsyncExceptionWrapper' is ambiguous. It is defined
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:553:30
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:553:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:553:1
[2m[safe-exceptions] [mWarning: 'catch' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘GHC.IO’
[2m[safe-exceptions] [m    * in ‘Control.Monad.Catch’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:247:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:247:1
[2m[safe-exceptions] [mWarning: 'catchJust' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘Control.Exception.Base’
[2m[safe-exceptions] [m    * in ‘Control.Monad.Catch’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:302:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:302:1
[2m[safe-exceptions] [mWarning: 'try' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘Control.Exception.Base’
[2m[safe-exceptions] [m    * in ‘Control.Monad.Catch’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:356:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:356:1
[2m[safe-exceptions] [mWarning: 'onException' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘Control.Exception.Base’
[2m[safe-exceptions] [m    * in ‘Control.Monad.Catch’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:404:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:404:1
[2m[safe-exceptions] [mWarning: 'bracketOnError' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘Control.Exception.Base’
[2m[safe-exceptions] [m    * in ‘Control.Monad.Catch’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:480:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:480:1
[2m[safe-exceptions] [mWarning: 'SyncExceptionWrapper' is ambiguous. It is defined
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:523:29
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:523:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:523:1
[2m[safe-exceptions] [mWarning: 'catches' is ambiguous. It is defined
[2m[safe-exceptions] [m    * in ‘Control.Exception’
[2m[safe-exceptions] [m    * in ‘Control.Monad.Catch’
[2m[safe-exceptions] [m    * at src/Control/Exception/Safe.hs:612:1
[2m[safe-exceptions] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[safe-exceptions] [m    by specifying the type/value namespace explicitly.
[2m[safe-exceptions] [m    Defaulting to the one defined at src/Control/Exception/Safe.hs:612:1
[2m[safe-exceptions] [m 100% ( 66 / 66) in 'Control.Exception.Safe'
[2m[safe-exceptions] [mWarning: Control.Exception.Safe: could not find link destinations for: 
[2m[safe-exceptions] [m	- GHC.IOPort.IOPortException
[2m[safe-exceptions] [mDocumentation created: dist/doc/html/safe-exceptions/,
[2m[safe-exceptions] [mdist/doc/html/safe-exceptions/safe-exceptions.txt
[2m[safe-exceptions] [mPreprocessing test suite 'safe-exceptions-test' for safe-exceptions-0.1.7.4..
[2m[safe-exceptions] [m[1;36mPhase: installPhase[m
[2m[base-orphans] [m[1 of 2] Compiling Data.Orphans.Prelude ( src/Data/Orphans/Prelude.hs, nothing )
[2m[base-orphans] [m[2 of 2] Compiling Data.Orphans     ( src/Data/Orphans.hs, nothing )
[2m[base-orphans] [mHaddock coverage:
[2m[base-orphans] [m 100% (  1 /  1) in 'Data.Orphans'
[2m[resourcet] [m    Defaulting to the one defined at Control/Monad/Trans/Resource/Internal.hs:182:1
[2m[resourcet] [mWarning: 'runResourceT' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'register' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'allocate' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'release' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'hoist' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'ResourceCleanupException' is ambiguous. It is defined
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:343:33
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:343:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[resourcet] [m    Defaulting to the one defined at Control/Monad/Trans/Resource/Internal.hs:343:1
[2m[resourcet] [m  64% (  9 / 14) in 'Control.Monad.Trans.Resource.Internal'
[2m[resourcet] [m  Missing documentation for:
[2m[resourcet] [m    Module header
[2m[resourcet] [m    ReleaseMap (Control/Monad/Trans/Resource/Internal.hs:98)
[2m[resourcet] [m    stateAlloc (Control/Monad/Trans/Resource/Internal.hs:289)
[2m[resourcet] [m    stateCleanup (Control/Monad/Trans/Resource/Internal.hs:297)
[2m[resourcet] [m    register' (Control/Monad/Trans/Resource/Internal.hs:317)
[2m[resourcet] [mWarning: 'Acquire' is ambiguous. It is defined
[2m[resourcet] [m    * at Data/Acquire/Internal.hs:51:21
[2m[resourcet] [m    * at Data/Acquire/Internal.hs:51:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[resourcet] [m    Defaulting to the one defined at Data/Acquire/Internal.hs:51:1
[2m[resourcet] [m 100% ( 10 / 10) in 'Data.Acquire'
[2m[resourcet] [mWarning: 'ReleaseKey' is ambiguous. It is defined
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:92:19
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:92:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[resourcet] [m    Defaulting to the one defined at Control/Monad/Trans/Resource/Internal.hs:92:1
[2m[resourcet] [mWarning: 'ResourceT' is ambiguous. It is defined
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:182:25
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:182:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[resourcet] [m    Defaulting to the one defined at Control/Monad/Trans/Resource/Internal.hs:182:1
[2m[resourcet] [mWarning: 'ResourceCleanupException' is ambiguous. It is defined
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:343:33
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:343:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[resourcet] [m    Defaulting to the one defined at Control/Monad/Trans/Resource/Internal.hs:343:1
[2m[resourcet] [mWarning: 'concurrently' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'race' is out of scope.
[2m[resourcet] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[resourcet] [mWarning: 'InvalidAccess' is ambiguous. It is defined
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:205:22
[2m[resourcet] [m    * at Control/Monad/Trans/Resource/Internal.hs:205:1
[2m[resourcet] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[resourcet] [m    by specifying the type/value namespace explicitly.
[2m[resourcet] [m    Defaulting to the one defined at Control/Monad/Trans/Resource/Internal.hs:205:1
[2m[resourcet] [m 100% ( 40 / 40) in 'Control.Monad.Trans.Resource'
[2m[resourcet] [m 100% ( 13 / 13) in 'UnliftIO.Resource'
[2m[resourcet] [mWarning: Control.Monad.Trans.Resource.Internal: could not find link destinations for: 
[2m[resourcet] [m	- Control.Monad.Trans.Resource.Internal.NextKey
[2m[resourcet] [m	- Control.Monad.Trans.Resource.Internal.RefCount
[2m[resourcet] [m	- Control.Monad.Trans.Resource.Internal.D:R:PrimStateResourceT
[2m[resourcet] [mWarning: Control.Monad.Trans.Resource: could not find link destinations for: 
[2m[resourcet] [m	- Control.Monad.Trans.Resource.Internal.D:R:PrimStateResourceT
[2m[resourcet] [mWarning: UnliftIO.Resource: could not find link destinations for: 
[2m[resourcet] [m	- Control.Monad.Trans.Resource.Internal.D:R:PrimStateResourceT
[2m[safe-exceptions] [mInstalling library in /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[safe-exceptions] [m[1;36mPhase: fixupPhase[m
[2m[safe-exceptions] [mshrinking RPATHs of ELF executables and libraries in /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mshrinking /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSsafe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv-ghc9.8.1.so
[2m[safe-exceptions] [mchecking for references to /build/ in /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4...
[2m[safe-exceptions] [mpatching script interpreter paths in /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4
[2m[safe-exceptions] [mstripping (with command strip and flags -S -p) in  /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/lib
[2m[safe-exceptions] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc
[2m[safe-exceptions] [mchecking for references to /build/ in /nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc...
[2m[safe-exceptions] [mpatching script interpreter paths in /nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc
[2m[safe-exceptions:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4[m
[2m[safe-exceptions:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[safe-exceptions:post-build] [m[2m[m
[2m[safe-exceptions:post-build] [m[2mPushing /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4 (987.36 KiB)[m
[2m[safe-exceptions:post-build] [m[2mPushing /nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc (766.74 KiB)[m
[2m[safe-exceptions:post-build] [m[2m[m
[2m[safe-exceptions:post-build] [m[2mAll done.[m
[2m[safe-exceptions:post-build] [m[2mUploading to the NixCI cache: /nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc /nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4[m
[2m[safe-exceptions:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[safe-exceptions:post-build] [m[2mcopying 2 paths...[m
[2m[safe-exceptions:post-build] [m[2mcopying path '/nix/store/2g2rga6h104kqlcgq4gik910qblzpkx2-safe-exceptions-0.1.7.4-doc' to 'https://cache.nix-ci.com'...[m
[2m[safe-exceptions:post-build] [m[2mcopying path '/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4' to 'https://cache.nix-ci.com'...[m
[2m[safe-exceptions:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[safe-exceptions:post-build] [m[2mcopying 1 paths...[m
[2m[safe-exceptions:post-build] [m[2mcopying path '/nix/store/snji0jpspl9hjdy6c0k7wv9plr36gva1-safe-exceptions-0.1.7.4.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 11 of 68 built (3 building)[m
[2m[base-orphans] [mDocumentation created: dist/doc/html/base-orphans/,
[2m[base-orphans] [mdist/doc/html/base-orphans/base-orphans.txt
[2m[base-orphans] [mPreprocessing test suite 'spec' for base-orphans-0.9.3..
[2m[base-orphans] [m[1;36mPhase: installPhase[m
[2m[base-orphans] [mInstalling library in /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[base-orphans] [m[1;36mPhase: fixupPhase[m
[2m[base-orphans] [mshrinking RPATHs of ELF executables and libraries in /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3
[2m[base-orphans] [mshrinking /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSbase-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU-ghc9.8.1.so
[2m[base-orphans] [mchecking for references to /build/ in /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3...
[2m[base-orphans] [mpatching script interpreter paths in /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3
[2m[base-orphans] [mstripping (with command strip and flags -S -p) in  /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/lib
[2m[base-orphans] [mshrinking RPATHs of ELF executables and libraries in /nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc
[2m[base-orphans] [mchecking for references to /build/ in /nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc...
[2m[base-orphans] [mpatching script interpreter paths in /nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc
[2m[generic-deriving] [m[ 4 of 21] Compiling Generics.Deriving.Foldable ( src/Generics/Deriving/Foldable.hs, dist/build/Generics/Deriving/Foldable.p_o )
[2m[generic-deriving] [m[ 5 of 21] Compiling Generics.Deriving.Eq ( src/Generics/Deriving/Eq.hs, dist/build/Generics/Deriving/Eq.p_o )
[2m[generic-deriving] [m[ 6 of 21] Compiling Generics.Deriving.Enum ( src/Generics/Deriving/Enum.hs, dist/build/Generics/Deriving/Enum.p_o )
[2m[generic-deriving] [m[ 7 of 21] Compiling Generics.Deriving.Copoint ( src/Generics/Deriving/Copoint.hs, dist/build/Generics/Deriving/Copoint.p_o )
[2m[generic-deriving] [m[ 8 of 21] Compiling Generics.Deriving.ConNames ( src/Generics/Deriving/ConNames.hs, dist/build/Generics/Deriving/ConNames.p_o )
[2m[generic-deriving] [m[ 9 of 21] Compiling Generics.Deriving.Semigroup.Internal ( src/Generics/Deriving/Semigroup/Internal.hs, dist/build/Generics/Deriving/Semigroup/Internal.p_o )
[2m[generic-deriving] [m[10 of 21] Compiling Generics.Deriving.Monoid.Internal ( src/Generics/Deriving/Monoid/Internal.hs, dist/build/Generics/Deriving/Monoid/Internal.p_o )
[2m[generic-deriving] [m[11 of 21] Compiling Generics.Deriving.Semigroup ( src/Generics/Deriving/Semigroup.hs, dist/build/Generics/Deriving/Semigroup.p_o )
[2m[generic-deriving] [m[12 of 21] Compiling Generics.Deriving.Monoid ( src/Generics/Deriving/Monoid.hs, dist/build/Generics/Deriving/Monoid.p_o )
[2m[generic-deriving] [m[13 of 21] Compiling Generics.Deriving.Show ( src/Generics/Deriving/Show.hs, dist/build/Generics/Deriving/Show.p_o )
[2m[generic-deriving] [m[14 of 21] Compiling Generics.Deriving.Traversable ( src/Generics/Deriving/Traversable.hs, dist/build/Generics/Deriving/Traversable.p_o )
[2m[generic-deriving] [m[15 of 21] Compiling Generics.Deriving.Uniplate ( src/Generics/Deriving/Uniplate.hs, dist/build/Generics/Deriving/Uniplate.p_o )
[2m[generic-deriving] [m[16 of 21] Compiling Generics.Deriving.Default ( src/Generics/Deriving/Default.hs, dist/build/Generics/Deriving/Default.p_o )
[2m[generic-deriving] [m[17 of 21] Compiling Generics.Deriving ( src/Generics/Deriving.hs, dist/build/Generics/Deriving.p_o )
[2m[generic-deriving] [m[18 of 21] Compiling Generics.Deriving.TH.Internal ( src/Generics/Deriving/TH/Internal.hs, dist/build/Generics/Deriving/TH/Internal.p_o )
[2m[resourcet] [mDocumentation created: dist/doc/html/resourcet/,
[2m[resourcet] [mdist/doc/html/resourcet/resourcet.txt
[2m[resourcet] [mPreprocessing test suite 'test' for resourcet-1.3.0..
[2m[resourcet] [m[1;36mPhase: installPhase[m
[2m[resourcet] [mInstalling library in /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[resourcet] [m[1;36mPhase: fixupPhase[m
[2m[resourcet] [mshrinking RPATHs of ELF executables and libraries in /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0
[2m[resourcet] [mshrinking /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSresourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC-ghc9.8.1.so
[2m[resourcet] [mchecking for references to /build/ in /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0...
[2m[resourcet] [mpatching script interpreter paths in /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0
[2m[resourcet] [mstripping (with command strip and flags -S -p) in  /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/lib
[2m[resourcet] [mshrinking RPATHs of ELF executables and libraries in /nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc
[2m[resourcet] [mchecking for references to /build/ in /nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc...
[2m[resourcet] [mpatching script interpreter paths in /nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc
[2m[base-orphans:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3[m
[2m[base-orphans:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[base-orphans:post-build] [m[2m[m
[2m[base-orphans:post-build] [m[2mPushing /nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc (1.12 MiB)[m
[2m[base-orphans:post-build] [m[2mPushing /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3 (1.78 MiB)[m
[2m[base-orphans:post-build] [m[2m[m
[2m[base-orphans:post-build] [m[2mAll done.[m
[2m[base-orphans:post-build] [m[2mUploading to the NixCI cache: /nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc /nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3[m
[2m[base-orphans:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[base-orphans:post-build] [m[2mcopying 2 paths...[m
[2m[base-orphans:post-build] [m[2mcopying path '/nix/store/b3swnkgh1g6cpady66yj5ym5g3nbl6cx-base-orphans-0.9.3-doc' to 'https://cache.nix-ci.com'...[m
[2m[base-orphans:post-build] [m[2mcopying path '/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3' to 'https://cache.nix-ci.com'...[m
[2m[base-orphans:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[base-orphans:post-build] [m[2mcopying 1 paths...[m
[2m[base-orphans:post-build] [m[2mcopying path '/nix/store/gl6lfsp052xb1scms6wzf7m51jah5wvn-base-orphans-0.9.3.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 12 of 68 built (2 building)[m
[2m[resourcet:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0[m
[2m[resourcet:post-build] [m[2mPushing 2 paths (70 are already present) using zstd to cache sellout ⏳[m
[2m[resourcet:post-build] [m[2m[m
[2m[resourcet:post-build] [m[2mPushing /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0 (2.21 MiB)[m
[2m[resourcet:post-build] [m[2mPushing /nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc (1.07 MiB)[m
[2m[resourcet:post-build] [m[2m[m
[2m[resourcet:post-build] [m[2mAll done.[m
[2m[resourcet:post-build] [m[2mUploading to the NixCI cache: /nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc /nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0[m
[2m[resourcet:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[resourcet:post-build] [m[2mcopying 2 paths...[m
[2m[resourcet:post-build] [m[2mcopying path '/nix/store/923av6b6q6l2j6vk69kbhsrd9yn9cppd-resourcet-1.3.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[resourcet:post-build] [m[2mcopying path '/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0' to 'https://cache.nix-ci.com'...[m
[2m[resourcet:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[resourcet:post-build] [m[2mcopying 1 paths...[m
[2m[resourcet:post-build] [m[2mcopying path '/nix/store/n3k7115vii6fqx4sjvn4500bablsjpfa-resourcet-1.3.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 13 of 69 built (1 building)[m
[1;34mBuilding /nix/store/pd914vc3p4kg4zji0f95f7m4mk92hggp-transformers-base-0.4.6.drv[m
[2m[generic-deriving] [m[19 of 21] Compiling Generics.Deriving.TH.Post4_9 ( src/Generics/Deriving/TH/Post4_9.hs, dist/build/Generics/Deriving/TH/Post4_9.p_o )
[2m[generic-deriving] [m[20 of 21] Compiling Generics.Deriving.TH ( src/Generics/Deriving/TH.hs, dist/build/Generics/Deriving/TH.p_o )
[2m[generic-deriving] [m[21 of 21] Compiling Paths_generic_deriving ( dist/build/autogen/Paths_generic_deriving.hs, dist/build/Paths_generic_deriving.p_o )
[2m[generic-deriving] [mPreprocessing test suite 'spec' for generic-deriving-1.14.6..
[2m[generic-deriving] [mBuilding test suite 'spec' for generic-deriving-1.14.6..
[2m[generic-deriving] [m[1 of 8] Compiling DefaultSpec      ( tests/DefaultSpec.hs, dist/build/spec/spec-tmp/DefaultSpec.o )
[2m[generic-deriving] [m[2 of 8] Compiling EmptyCaseSpec    ( tests/EmptyCaseSpec.hs, dist/build/spec/spec-tmp/EmptyCaseSpec.o )
[2m[generic-deriving] [m[3 of 8] Compiling ExampleSpec      ( tests/ExampleSpec.hs, dist/build/spec/spec-tmp/ExampleSpec.o )
[2m[generic-deriving] [m[4 of 8] Compiling T68Spec          ( tests/T68Spec.hs, dist/build/spec/spec-tmp/T68Spec.o )
[2m[generic-deriving] [m[5 of 8] Compiling T80Spec          ( tests/T80Spec.hs, dist/build/spec/spec-tmp/T80Spec.o )
[2m[generic-deriving] [m[6 of 8] Compiling T82Spec          ( tests/T82Spec.hs, dist/build/spec/spec-tmp/T82Spec.o )
[2m[generic-deriving] [m[7 of 8] Compiling TypeInTypeSpec   ( tests/TypeInTypeSpec.hs, dist/build/spec/spec-tmp/TypeInTypeSpec.o )
[2m[generic-deriving] [m[8 of 8] Compiling Main             ( tests/Spec.hs, dist/build/spec/spec-tmp/Main.o )
[2m[generic-deriving] [m[9 of 9] Linking dist/build/spec/spec
[2m[generic-deriving] [m[1;36mPhase: checkPhase[m
[2m[generic-deriving] [mRunning 1 test suites...
[2m[generic-deriving] [mTest suite spec: RUNNING...
[2m[generic-deriving] [m
[2m[generic-deriving] [mDefault
[2m[generic-deriving] [m  DerivingVia Default
[2m[generic-deriving] [m    GEq is commutative for derivingVia (Default MyType) [✔]
[2m[generic-deriving] [m    GShow for MyType is like Show for Bool with derivingVia (Default MyType) but prefixed with 'MyType ' [✔]
[2m[generic-deriving] [m    GEq is commutative for parameterized derivingVia (Default (MyType1 Bool)) [✔]
[2m[generic-deriving] [m    GShow for MyType1 Bool is like Show for Bool with derivingVia (Default (MyType1 Bool)) but prefixed with 'MyType1 ' [✔]
[2m[generic-deriving] [m    GEq is commutative for derivingVia (Default Bool) [✔]
[2m[generic-deriving] [m    GENum is correct for derivingVia (Default Bool) [✔]
[2m[generic-deriving] [m    GShow for TestShow is the same as Show for Bool with derivingVia (Default Bool) [✔]
[2m[generic-deriving] [m    GSemigroup is like First when instantiated with derivingVia (First Bool) [✔]
[2m[generic-deriving] [m    GFoldable with derivingVia (Default1 Option) acts like mconcat with Maybe (First Bool) [✔]
[2m[generic-deriving] [m      +++ OK, passed 100 tests.
[2m[generic-deriving] [m    GFunctor for TestFunctor Bool is as Functor for Maybe Bool [✔]
[2m[generic-deriving] [mExample
[2m[generic-deriving] [m  [] and Maybe tests
[2m[generic-deriving] [m    gshow hList [✔]
[2m[generic-deriving] [m    gshow (children maybe2) [✔]
[2m[generic-deriving] [m    gshow (transform (const "abc") []) [✔]
[2m[generic-deriving] [m    gshow (transform double hList) [✔]
[2m[generic-deriving] [m    gshow (geq hList hList) [✔]
[2m[generic-deriving] [m    gshow (geq maybe1 maybe2) [✔]
[2m[generic-deriving] [m    gshow (take 5 genum) [✔]
[2m[generic-deriving] [m    gshow (take 15 genum) [✔]
[2m[generic-deriving] [m    gshow (range ([0], [1])) [✔]
[2m[generic-deriving] [m    gshow (inRange ([0], [3,5]) hList) [✔]
[2m[generic-deriving] [m  Tests for Tree
[2m[generic-deriving] [m    gshow tree [✔]
[2m[generic-deriving] [m    gshow (children tree) [✔]
[2m[generic-deriving] [m    gshow (descend (descend (\_ -> Branch 0 Empty Empty)) tree) [✔]
[2m[generic-deriving] [m    gshow (context tree [Branch 1 Empty Empty,Empty]) [✔]
[2m[generic-deriving] [m    gshow (transform upgradeTree tree) [✔]
[2m[generic-deriving] [m    gshow (take 10 genum) [✔]
[2m[generic-deriving] [m  Tests for List
[2m[generic-deriving] [m    gshow (gmap fromEnum list) [✔]
[2m[generic-deriving] [m    gshow (gmap gshow listlist) [✔]
[2m[generic-deriving] [m    gshow list [✔]
[2m[generic-deriving] [m    gshow listlist [✔]
[2m[generic-deriving] [m    gshow (children list) [✔]
[2m[generic-deriving] [m    gshow (children listlist) [✔]
[2m[generic-deriving] [m  Tests for Rose
[2m[generic-deriving] [m    gshow rose1 [✔]
[2m[generic-deriving] [m    gshow (gmap gshow rose1) [✔]
[2m[generic-deriving] [m  Tests for GRose
[2m[generic-deriving] [m    gshow grose1 [✔]
[2m[generic-deriving] [m    gshow (gmap gshow grose1) [✔]
[2m[generic-deriving] [m  Tests for Either
[2m[generic-deriving] [m    gshow either1 [✔]
[2m[generic-deriving] [m    gshow (gmap gshow either1) [✔]
[2m[generic-deriving] [m  Tests for Nested
[2m[generic-deriving] [m    gshow nested [✔]
[2m[generic-deriving] [m    gshow (gmap gshow nested) [✔]
[2m[generic-deriving] [m  Tests for Bush
[2m[generic-deriving] [m    gshow bush1 [✔]
[2m[generic-deriving] [m    gshow (gmap gshow bush1) [✔]
[2m[generic-deriving] [mTypeInType
[2m[generic-deriving] [m  TyCon Bool 'False 'True
[2m[generic-deriving] [m    has an appropriately kinded Generic1 instance [✔]
[2m[generic-deriving] [m  TyFam Bool 'False 'True
[2m[generic-deriving] [m    has an appropriately kinded Generic1 instance [✔]
[2m[generic-deriving] [m
[2m[generic-deriving] [mFinished in 0.0266 seconds
[2m[generic-deriving] [m44 examples, 0 failures
[2m[generic-deriving] [mTest suite spec: PASS
[2m[generic-deriving] [mTest suite logged to: dist/test/generic-deriving-1.14.6-spec.log
[2m[generic-deriving] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[generic-deriving] [m[1;36mPhase: haddockPhase[m
[2m[generic-deriving] [mPreprocessing library for generic-deriving-1.14.6..
[2m[generic-deriving] [mRunning Haddock on library for generic-deriving-1.14.6..
[2m[generic-deriving] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[generic-deriving] [m[ 1 of 21] Compiling Generics.Deriving.Instances ( src/Generics/Deriving/Instances.hs, nothing )
[2m[generic-deriving] [m[ 2 of 21] Compiling Generics.Deriving.Base ( src/Generics/Deriving/Base.hs, nothing )
[2m[generic-deriving] [m[ 3 of 21] Compiling Generics.Deriving.Functor ( src/Generics/Deriving/Functor.hs, nothing )
[2m[generic-deriving] [m[ 4 of 21] Compiling Generics.Deriving.Foldable ( src/Generics/Deriving/Foldable.hs, nothing )
[2m[generic-deriving] [m[ 5 of 21] Compiling Generics.Deriving.Eq ( src/Generics/Deriving/Eq.hs, nothing )
[2m[generic-deriving] [m[ 6 of 21] Compiling Generics.Deriving.Enum ( src/Generics/Deriving/Enum.hs, nothing )
[2m[transformers-base] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[transformers-base] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[transformers-base] [m[1;36mPhase: unpackPhase[m
[2m[transformers-base] [munpacking source archive /nix/store/71kdgb07m7iidi66qjgqh0jvmr47j4m3-transformers-base-0.4.6.tar.gz
[2m[transformers-base] [msource root is transformers-base-0.4.6
[2m[transformers-base] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "transformers-base-0.4.6/transformers-base.cabal"
[2m[transformers-base] [m[1;36mPhase: patchPhase[m
[2m[transformers-base] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[transformers-base] [msetupCompileFlags: -package-db=/build/tmp.NWnFB7oGox/setup-package.conf.d -threaded
[2m[generic-deriving] [m[ 7 of 21] Compiling Generics.Deriving.Copoint ( src/Generics/Deriving/Copoint.hs, nothing )
[2m[transformers-base] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.NWnFB7oGox/Main.o )
[2m[generic-deriving] [m[ 8 of 21] Compiling Generics.Deriving.ConNames ( src/Generics/Deriving/ConNames.hs, nothing )
[2m[generic-deriving] [m[ 9 of 21] Compiling Generics.Deriving.Semigroup.Internal ( src/Generics/Deriving/Semigroup/Internal.hs, nothing )
[2m[generic-deriving] [m[10 of 21] Compiling Generics.Deriving.Monoid.Internal ( src/Generics/Deriving/Monoid/Internal.hs, nothing )
[2m[transformers-base] [m[2 of 2] Linking Setup
[2m[generic-deriving] [m[11 of 21] Compiling Generics.Deriving.Semigroup ( src/Generics/Deriving/Semigroup.hs, nothing )
[2m[generic-deriving] [m[12 of 21] Compiling Generics.Deriving.Monoid ( src/Generics/Deriving/Monoid.hs, nothing )
[2m[generic-deriving] [m[13 of 21] Compiling Generics.Deriving.Show ( src/Generics/Deriving/Show.hs, nothing )
[2m[generic-deriving] [m[14 of 21] Compiling Generics.Deriving.Traversable ( src/Generics/Deriving/Traversable.hs, nothing )
[2m[generic-deriving] [m[15 of 21] Compiling Generics.Deriving.Uniplate ( src/Generics/Deriving/Uniplate.hs, nothing )
[2m[generic-deriving] [m[16 of 21] Compiling Generics.Deriving.Default ( src/Generics/Deriving/Default.hs, nothing )
[2m[generic-deriving] [m[17 of 21] Compiling Generics.Deriving ( src/Generics/Deriving.hs, nothing )
[2m[generic-deriving] [m[18 of 21] Compiling Generics.Deriving.TH.Internal ( src/Generics/Deriving/TH/Internal.hs, nothing )
[2m[generic-deriving] [m[19 of 21] Compiling Generics.Deriving.TH.Post4_9 ( src/Generics/Deriving/TH/Post4_9.hs, nothing )
[2m[generic-deriving] [m[20 of 21] Compiling Generics.Deriving.TH ( src/Generics/Deriving/TH.hs, nothing )
[2m[generic-deriving] [m[21 of 21] Compiling Paths_generic_deriving ( dist/build/autogen/Paths_generic_deriving.hs, nothing )
[2m[generic-deriving] [mHaddock coverage:
[2m[generic-deriving] [m   0% (  0 /  1) in 'Generics.Deriving.Instances'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m  50% (  1 /  2) in 'Generics.Deriving.Base'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m  42% (  3 /  7) in 'Generics.Deriving.Functor'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GFunctor (src/Generics/Deriving/Functor.hs:92)
[2m[generic-deriving] [m    gmapdefault (src/Generics/Deriving/Functor.hs:100)
[2m[generic-deriving] [m    GFunctor' (src/Generics/Deriving/Functor.hs:43)
[2m[generic-deriving] [m  16% (  4 / 24) in 'Generics.Deriving.Foldable'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GFoldable (src/Generics/Deriving/Foldable.hs:108)
[2m[generic-deriving] [m    gfoldMapdefault (src/Generics/Deriving/Foldable.hs:147)
[2m[generic-deriving] [m    gtoList (src/Generics/Deriving/Foldable.hs:223)
[2m[generic-deriving] [m    gconcat (src/Generics/Deriving/Foldable.hs:226)
[2m[generic-deriving] [m    gconcatMap (src/Generics/Deriving/Foldable.hs:229)
[2m[generic-deriving] [m    gand (src/Generics/Deriving/Foldable.hs:232)
[2m[generic-deriving] [m    gor (src/Generics/Deriving/Foldable.hs:235)
[2m[generic-deriving] [m    gany (src/Generics/Deriving/Foldable.hs:238)
[2m[generic-deriving] [m    gall (src/Generics/Deriving/Foldable.hs:241)
[2m[generic-deriving] [m    gsum (src/Generics/Deriving/Foldable.hs:244)
[2m[generic-deriving] [m    gproduct (src/Generics/Deriving/Foldable.hs:247)
[2m[generic-deriving] [m    gmaximum (src/Generics/Deriving/Foldable.hs:250)
[2m[generic-deriving] [m    gmaximumBy (src/Generics/Deriving/Foldable.hs:253)
[2m[generic-deriving] [m    gminimum (src/Generics/Deriving/Foldable.hs:259)
[2m[generic-deriving] [m    gminimumBy (src/Generics/Deriving/Foldable.hs:262)
[2m[generic-deriving] [m    gelem (src/Generics/Deriving/Foldable.hs:268)
[2m[generic-deriving] [m    gnotElem (src/Generics/Deriving/Foldable.hs:271)
[2m[generic-deriving] [m    gfind (src/Generics/Deriving/Foldable.hs:274)
[2m[generic-deriving] [m    GFoldable' (src/Generics/Deriving/Foldable.hs:59)
[2m[generic-deriving] [m  42% (  3 /  7) in 'Generics.Deriving.Eq'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GEq (src/Generics/Deriving/Eq.hs:104)
[2m[generic-deriving] [m    geqdefault (src/Generics/Deriving/Eq.hs:111)
[2m[generic-deriving] [m    GEq' (src/Generics/Deriving/Eq.hs:64)
[2m[generic-deriving] [m  33% (  5 / 15) in 'Generics.Deriving.Enum'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GEnum (src/Generics/Deriving/Enum.hs:130)
[2m[generic-deriving] [m    genumDefault (src/Generics/Deriving/Enum.hs:115)
[2m[generic-deriving] [m    toEnumDefault (src/Generics/Deriving/Enum.hs:118)
[2m[generic-deriving] [m    fromEnumDefault (src/Generics/Deriving/Enum.hs:125)
[2m[generic-deriving] [m    Enum' (src/Generics/Deriving/Enum.hs:96)
[2m[generic-deriving] [m    GIx (src/Generics/Deriving/Enum.hs:519)
[2m[generic-deriving] [m    rangeDefault (src/Generics/Deriving/Enum.hs:539)
[2m[generic-deriving] [m    indexDefault (src/Generics/Deriving/Enum.hs:548)
[2m[generic-deriving] [m    inRangeDefault (src/Generics/Deriving/Enum.hs:559)
[2m[generic-deriving] [m  42% (  3 /  7) in 'Generics.Deriving.Copoint'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GCopoint (src/Generics/Deriving/Copoint.hs:71)
[2m[generic-deriving] [m    gcopointdefault (src/Generics/Deriving/Copoint.hs:79)
[2m[generic-deriving] [m    GCopoint' (src/Generics/Deriving/Copoint.hs:37)
[2m[generic-deriving] [m  80% (  4 /  5) in 'Generics.Deriving.ConNames'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    ConNames (src/Generics/Deriving/ConNames.hs:32)
[2m[generic-deriving] [m   0% (  0 /  4) in 'Generics.Deriving.Semigroup'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GSemigroup (src/Generics/Deriving/Semigroup/Internal.hs:51)
[2m[generic-deriving] [m    gsappenddefault (src/Generics/Deriving/Semigroup/Internal.hs:77)
[2m[generic-deriving] [m    GSemigroup' (src/Generics/Deriving/Semigroup/Internal.hs:33)
[2m[generic-deriving] [m  60% ( 12 / 20) in 'Generics.Deriving.Monoid'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GMonoid (src/Generics/Deriving/Monoid/Internal.hs:134)
[2m[generic-deriving] [m    gmemptydefault (src/Generics/Deriving/Monoid/Internal.hs:97)
[2m[generic-deriving] [m    gmappenddefault (src/Generics/Deriving/Monoid/Internal.hs:100)
[2m[generic-deriving] [m    GMonoid' (src/Generics/Deriving/Monoid/Internal.hs:74)
[2m[generic-deriving] [m    memptydefault (src/Generics/Deriving/Monoid/Internal.hs:127)
[2m[generic-deriving] [m    mappenddefault (src/Generics/Deriving/Monoid/Internal.hs:130)
[2m[generic-deriving] [m    Monoid' (src/Generics/Deriving/Monoid/Internal.hs:104)
[2m[generic-deriving] [m  42% (  3 /  7) in 'Generics.Deriving.Show'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GShow (src/Generics/Deriving/Show.hs:155)
[2m[generic-deriving] [m    gshowsPrecdefault (src/Generics/Deriving/Show.hs:175)
[2m[generic-deriving] [m    GShow' (src/Generics/Deriving/Show.hs:70)
[2m[generic-deriving] [m  42% (  3 /  7) in 'Generics.Deriving.Traversable'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [m    GTraversable (src/Generics/Deriving/Traversable.hs:94)
[2m[generic-deriving] [m    gtraversedefault (src/Generics/Deriving/Traversable.hs:111)
[2m[generic-deriving] [m    GTraversable' (src/Generics/Deriving/Traversable.hs:45)
[2m[generic-deriving] [m  27% (  6 / 22) in 'Generics.Deriving.Uniplate'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Uniplate (src/Generics/Deriving/Uniplate.hs:146)
[2m[generic-deriving] [m    uniplate (src/Generics/Deriving/Uniplate.hs:193)
[2m[generic-deriving] [m    universe (src/Generics/Deriving/Uniplate.hs:196)
[2m[generic-deriving] [m    rewrite (src/Generics/Deriving/Uniplate.hs:201)
[2m[generic-deriving] [m    rewriteM (src/Generics/Deriving/Uniplate.hs:206)
[2m[generic-deriving] [m    contexts (src/Generics/Deriving/Uniplate.hs:211)
[2m[generic-deriving] [m    holes (src/Generics/Deriving/Uniplate.hs:218)
[2m[generic-deriving] [m    para (src/Generics/Deriving/Uniplate.hs:224)
[2m[generic-deriving] [m    childrendefault (src/Generics/Deriving/Uniplate.hs:172)
[2m[generic-deriving] [m    contextdefault (src/Generics/Deriving/Uniplate.hs:175)
[2m[generic-deriving] [m    descenddefault (src/Generics/Deriving/Uniplate.hs:178)
[2m[generic-deriving] [m    descendMdefault (src/Generics/Deriving/Uniplate.hs:181)
[2m[generic-deriving] [m    transformdefault (src/Generics/Deriving/Uniplate.hs:184)
[2m[generic-deriving] [m    transformMdefault (src/Generics/Deriving/Uniplate.hs:187)
[2m[generic-deriving] [m    Uniplate' (src/Generics/Deriving/Uniplate.hs:61)
[2m[generic-deriving] [m    Context' (src/Generics/Deriving/Uniplate.hs:118)
[2m[generic-deriving] [mWarning: 'Default' is ambiguous. It is defined
[2m[generic-deriving] [m    * at src/Generics/Deriving/Default.hs:115:21
[2m[generic-deriving] [m    * at src/Generics/Deriving/Default.hs:115:1
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined at src/Generics/Deriving/Default.hs:115:1
[2m[generic-deriving] [mWarning: 'Default1' is ambiguous. It is defined
[2m[generic-deriving] [m    * at src/Generics/Deriving/Default.hs:139:24
[2m[generic-deriving] [m    * at src/Generics/Deriving/Default.hs:139:1
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined at src/Generics/Deriving/Default.hs:139:1
[2m[generic-deriving] [m 100% (  9 /  9) in 'Generics.Deriving.Default'
[2m[generic-deriving] [m  90% (  9 / 10) in 'Generics.Deriving'
[2m[generic-deriving] [m  Missing documentation for:
[2m[generic-deriving] [m    Module header
[2m[generic-deriving] [mWarning: 'ConstructorInfo' is ambiguous. It is defined
[2m[generic-deriving] [m    * in ‘Language.Haskell.TH.Datatype’
[2m[generic-deriving] [m    * in ‘Language.Haskell.TH.Datatype’
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined in ‘Language.Haskell.TH.Datatype’
[2m[generic-deriving] [mWarning: 'Name' is ambiguous. It is defined
[2m[generic-deriving] [m    * in ‘Language.Haskell.TH.Syntax’
[2m[generic-deriving] [m    * in ‘Language.Haskell.TH.Syntax’
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined in ‘Language.Haskell.TH.Syntax’
[2m[generic-deriving] [mWarning: 'Generic' is ambiguous. It is defined
[2m[generic-deriving] [m    * in ‘GHC.Generics’
[2m[generic-deriving] [m    * at src/Generics/Deriving/TH/Internal.hs:335:21
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined at src/Generics/Deriving/TH/Internal.hs:335:21
[2m[generic-deriving] [mWarning: 'Generic1' is ambiguous. It is defined
[2m[generic-deriving] [m    * in ‘GHC.Generics’
[2m[generic-deriving] [m    * at src/Generics/Deriving/TH/Internal.hs:335:31
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined at src/Generics/Deriving/TH/Internal.hs:335:31
[2m[generic-deriving] [mWarning: 'Data' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Constructor' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Selector' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Rep' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Rep1' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Options' is ambiguous. It is defined
[2m[generic-deriving] [m    * at src/Generics/Deriving/TH.hs:169:16
[2m[generic-deriving] [m    * at src/Generics/Deriving/TH.hs:169:1
[2m[generic-deriving] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[generic-deriving] [m    by specifying the type/value namespace explicitly.
[2m[generic-deriving] [m    Defaulting to the one defined at src/Generics/Deriving/TH.hs:169:1
[2m[generic-deriving] [mWarning: 'Data' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Constructor' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Selector' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Representable0' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Representable1' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'Rep0' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'from' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'to' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'from1' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'to1' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [mWarning: 'f' is out of scope.
[2m[generic-deriving] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[generic-deriving] [m 100% ( 50 / 50) in 'Generics.Deriving.TH'
[2m[transformers-base] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[transformers-base] [m[1;36mPhase: configurePhase[m
[2m[transformers-base] [mconfigureFlags: --verbose --prefix=/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc/share/doc/transformers-base-0.4.6 --with-gcc=gcc --package-db=/build/tmp.NWnFB7oGox/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[transformers-base] [mUsing Parsec parser
[2m[transformers-base] [mConfiguring transformers-base-0.4.6...
[2m[generic-deriving] [mWarning: Generics.Deriving.Monoid: could not find link destinations for: 
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_Alt
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep1_Alt
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_Product
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep1_Product
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_Sum
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep1_Sum
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_Any
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_All
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_Endo
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep_Dual
[2m[generic-deriving] [m	- Data.Semigroup.Internal.Rep1_Dual
[2m[generic-deriving] [m	- Data.Monoid.Rep_Ap
[2m[generic-deriving] [m	- Data.Monoid.Rep1_Ap
[2m[generic-deriving] [m	- Data.Monoid.Rep_Last
[2m[generic-deriving] [m	- Data.Monoid.Rep1_Last
[2m[generic-deriving] [m	- Data.Monoid.Rep_First
[2m[generic-deriving] [m	- Data.Monoid.Rep1_First
[2m[generic-deriving] [m	- Data.Set.Internal.MergeSet
[2m[generic-deriving] [mWarning: Generics.Deriving.Show: could not find link destinations for: 
[2m[generic-deriving] [m	- Generics.Deriving.Show.Type
[2m[generic-deriving] [mWarning: Generics.Deriving.TH: could not find link destinations for: 
[2m[generic-deriving] [m	- Generics.Deriving.TH.Internal.Generic
[2m[generic-deriving] [m	- Generics.Deriving.TH.Internal.Generic1
[2m[transformers-base] [mFlags chosen: orphaninstances=True
[2m[transformers-base] [mDependency base >=3 && <4.4 || >=4.5 && <5: using base-4.19.0.0
[2m[transformers-base] [mDependency base-orphans >=0.3: using base-orphans-0.9.3
[2m[transformers-base] [mDependency stm >=2.3: using stm-2.5.2.1
[2m[transformers-base] [mDependency transformers >=0.2: using transformers-0.6.1.0
[2m[transformers-base] [mDependency transformers-compat >=0.6.1: using transformers-compat-0.7.2
[2m[transformers-base] [mSource component graph: component lib
[2m[transformers-base] [mConfigured component graph:
[2m[transformers-base] [m    component transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[transformers-base] [m        include base-4.19.0.0-b960
[2m[transformers-base] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[transformers-base] [m        include stm-2.5.2.1-83fa
[2m[transformers-base] [m        include transformers-0.6.1.0-c3ec
[2m[transformers-base] [m        include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[transformers-base] [mLinked component graph:
[2m[transformers-base] [m    unit transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[transformers-base] [m        include base-4.19.0.0-b960
[2m[transformers-base] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[transformers-base] [m        include stm-2.5.2.1-83fa
[2m[transformers-base] [m        include transformers-0.6.1.0-c3ec
[2m[transformers-base] [m        include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[transformers-base] [m        Control.Monad.Base=transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg:Control.Monad.Base
[2m[transformers-base] [mReady component graph:
[2m[transformers-base] [m    definite transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[transformers-base] [m        depends base-4.19.0.0-b960
[2m[transformers-base] [m        depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[transformers-base] [m        depends stm-2.5.2.1-83fa
[2m[transformers-base] [m        depends transformers-0.6.1.0-c3ec
[2m[transformers-base] [m        depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[transformers-base] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[transformers-base] [mUsing compiler: ghc-9.8.1
[2m[transformers-base] [mUsing install prefix:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6
[2m[transformers-base] [mExecutables installed in:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/bin
[2m[transformers-base] [mLibraries installed in:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[transformers-base] [mDynamic Libraries installed in:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[transformers-base] [mPrivate executables installed in:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/libexec/x86_64-linux-ghc-9.8.1/transformers-base-0.4.6
[2m[transformers-base] [mData files installed in:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/share/x86_64-linux-ghc-9.8.1/transformers-base-0.4.6
[2m[transformers-base] [mDocumentation installed in:
[2m[transformers-base] [m/nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc/share/doc/transformers-base-0.4.6
[2m[transformers-base] [mConfiguration files installed in:
[2m[transformers-base] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/etc
[2m[transformers-base] [mNo alex found
[2m[transformers-base] [mUsing ar found on system at:
[2m[transformers-base] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[transformers-base] [mNo c2hs found
[2m[transformers-base] [mNo cpphs found
[2m[transformers-base] [mNo doctest found
[2m[transformers-base] [mUsing gcc version 14.3.0 given by user at:
[2m[transformers-base] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[transformers-base] [mUsing ghc version 9.8.1 found on system at:
[2m[transformers-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[transformers-base] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[transformers-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[transformers-base] [mNo ghcjs found
[2m[transformers-base] [mNo ghcjs-pkg found
[2m[transformers-base] [mNo greencard found
[2m[transformers-base] [mUsing haddock version 2.30.0 found on system at:
[2m[transformers-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[transformers-base] [mNo happy found
[2m[transformers-base] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[transformers-base] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[transformers-base] [mNo hmake found
[2m[transformers-base] [mUsing hpc version 0.69 found on system at:
[2m[transformers-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[transformers-base] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[transformers-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[transformers-base] [mUsing hscolour version 1.25 found on system at:
[2m[transformers-base] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[transformers-base] [mNo jhc found
[2m[transformers-base] [mUsing ld found on system at:
[2m[transformers-base] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[transformers-base] [mNo pkg-config found
[2m[transformers-base] [mUsing runghc version 9.8.1 found on system at:
[2m[transformers-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[transformers-base] [mUsing strip version 2.44 found on system at:
[2m[transformers-base] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[transformers-base] [mUsing tar found on system at:
[2m[transformers-base] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[transformers-base] [mNo uhc found
[2m[transformers-base] [m[1;36mPhase: buildPhase[m
[2m[transformers-base] [mPreprocessing library for transformers-base-0.4.6..
[2m[transformers-base] [mBuilding library for transformers-base-0.4.6..
[2m[transformers-base] [m[1 of 1] Compiling Control.Monad.Base ( src/Control/Monad/Base.hs, dist/build/Control/Monad/Base.o, dist/build/Control/Monad/Base.dyn_o )
[2m[transformers-base] [m[1 of 1] Compiling Control.Monad.Base ( src/Control/Monad/Base.hs, dist/build/Control/Monad/Base.p_o )
[2m[transformers-base] [m[1;36mPhase: checkPhase[m
[2m[transformers-base] [mPackage has no test suites.
[2m[transformers-base] [m[1;36mPhase: haddockPhase[m
[2m[generic-deriving] [mDocumentation created: dist/doc/html/generic-deriving/,
[2m[generic-deriving] [mdist/doc/html/generic-deriving/generic-deriving.txt
[2m[transformers-base] [mPreprocessing library for transformers-base-0.4.6..
[2m[transformers-base] [mRunning Haddock on library for transformers-base-0.4.6..
[2m[transformers-base] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[generic-deriving] [mPreprocessing test suite 'spec' for generic-deriving-1.14.6..
[2m[generic-deriving] [m[1;36mPhase: installPhase[m
[2m[transformers-base] [m[1 of 1] Compiling Control.Monad.Base ( src/Control/Monad/Base.hs, nothing )
[2m[generic-deriving] [mInstalling library in /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[transformers-base] [mHaddock coverage:
[2m[transformers-base] [m  33% (  1 /  3) in 'Control.Monad.Base'
[2m[transformers-base] [m  Missing documentation for:
[2m[transformers-base] [m    Module header
[2m[transformers-base] [m    MonadBase (src/Control/Monad/Base.hs:60)
[2m[generic-deriving] [m[1;36mPhase: fixupPhase[m
[2m[generic-deriving] [mshrinking RPATHs of ELF executables and libraries in /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6
[2m[generic-deriving] [mshrinking /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSgeneric-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT-ghc9.8.1.so
[2m[generic-deriving] [mchecking for references to /build/ in /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6...
[2m[generic-deriving] [mpatching script interpreter paths in /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6
[2m[generic-deriving] [mstripping (with command strip and flags -S -p) in  /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6/lib
[2m[generic-deriving] [mshrinking RPATHs of ELF executables and libraries in /nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc
[2m[generic-deriving] [mchecking for references to /build/ in /nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc...
[2m[generic-deriving] [mpatching script interpreter paths in /nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc
[2m[generic-deriving:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6[m
[2m[generic-deriving:post-build] [m[2mPushing 2 paths (68 are already present) using zstd to cache sellout ⏳[m
[2m[generic-deriving:post-build] [m[2m[m
[2m[generic-deriving:post-build] [m[2mPushing /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6 (23.31 MiB)[m
[2m[generic-deriving:post-build] [m[2mPushing /nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc (6.43 MiB)[m
[2m[generic-deriving:post-build] [m[2m[m
[2m[generic-deriving:post-build] [m[2mAll done.[m
[2m[generic-deriving:post-build] [m[2mUploading to the NixCI cache: /nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc /nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6[m
[2m[generic-deriving:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[generic-deriving:post-build] [m[2mcopying 2 paths...[m
[2m[generic-deriving:post-build] [m[2mcopying path '/nix/store/6m42mpfhy9wwap8y2kc216q2n35x8zzf-generic-deriving-1.14.6-doc' to 'https://cache.nix-ci.com'...[m
[2m[generic-deriving:post-build] [m[2mcopying path '/nix/store/vs62hf3vwgpnrx0l34w0mdm84dc69mdv-generic-deriving-1.14.6' to 'https://cache.nix-ci.com'...[m
[2m[generic-deriving:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[generic-deriving:post-build] [m[2mcopying 1 paths...[m
[2m[generic-deriving:post-build] [m[2mcopying path '/nix/store/gld31zr7zh8xyn8y3vahgjdgzwhgkdy9-generic-deriving-1.14.6.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 14 of 68 built (1 building)[m
[1;34mBuilding /nix/store/xx4vji9w9h43gzi55w3xrmxyq6p8m215-distributive-0.6.2.1.drv[m
[2m[transformers-base] [mDocumentation created: dist/doc/html/transformers-base/,
[2m[transformers-base] [mdist/doc/html/transformers-base/transformers-base.txt
[2m[transformers-base] [m[1;36mPhase: installPhase[m
[2m[transformers-base] [mInstalling library in /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[transformers-base] [m[1;36mPhase: fixupPhase[m
[2m[transformers-base] [mshrinking RPATHs of ELF executables and libraries in /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6
[2m[transformers-base] [mshrinking /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStransformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg-ghc9.8.1.so
[2m[transformers-base] [mchecking for references to /build/ in /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6...
[2m[transformers-base] [mpatching script interpreter paths in /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6
[2m[transformers-base] [mstripping (with command strip and flags -S -p) in  /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/lib
[2m[transformers-base] [mshrinking RPATHs of ELF executables and libraries in /nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc
[2m[transformers-base] [mchecking for references to /build/ in /nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc...
[2m[transformers-base] [mpatching script interpreter paths in /nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc
[2m[transformers-base:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6 /nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc[m
[2m[transformers-base:post-build] [m[2mPushing 2 paths (70 are already present) using zstd to cache sellout ⏳[m
[2m[transformers-base:post-build] [m[2m[m
[2m[transformers-base:post-build] [m[2mPushing /nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc (182.16 KiB)[m
[2m[transformers-base:post-build] [m[2mPushing /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6 (583.28 KiB)[m
[2m[transformers-base:post-build] [m[2m[m
[2m[transformers-base:post-build] [m[2mAll done.[m
[2m[transformers-base:post-build] [m[2mUploading to the NixCI cache: /nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6 /nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc[m
[2m[transformers-base:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[transformers-base:post-build] [m[2mcopying 2 paths...[m
[2m[transformers-base:post-build] [m[2mcopying path '/nix/store/xdiag5yjf0j0i8m2agxsidajz5b1psv8-transformers-base-0.4.6-doc' to 'https://cache.nix-ci.com'...[m
[2m[transformers-base:post-build] [m[2mcopying path '/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6' to 'https://cache.nix-ci.com'...[m
[2m[transformers-base:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[transformers-base:post-build] [m[2mcopying 1 paths...[m
[2m[transformers-base:post-build] [m[2mcopying path '/nix/store/pd914vc3p4kg4zji0f95f7m4mk92hggp-transformers-base-0.4.6.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 15 of 68 built (1 building)[m
[1;34mBuilding /nix/store/9jk9z4rr6pz0gsadagdy5y97a28ifdhq-monad-control-1.0.3.1.drv[m
[2m[distributive] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[distributive] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[distributive] [m[1;36mPhase: unpackPhase[m
[2m[distributive] [munpacking source archive /nix/store/v1axhj3cpaixlyfy04qv0442ny8d7m5w-distributive-0.6.2.1.tar.gz
[2m[distributive] [msource root is distributive-0.6.2.1
[2m[distributive] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "distributive-0.6.2.1/.vim.custom"
[2m[distributive] [m[1;36mPhase: patchPhase[m
[2m[distributive] [mReplace Cabal file with edited version from mirror://hackage/distributive-0.6.2.1/revision/1.cabal.
[2m[distributive] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[distributive] [msetupCompileFlags: -package-db=/build/tmp.uP5Z8PdS5B/setup-package.conf.d -threaded
[2m[distributive] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.uP5Z8PdS5B/Main.o )
[2m[distributive] [m[2 of 2] Linking Setup
[2m[distributive] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[distributive] [m[1;36mPhase: configurePhase[m
[2m[distributive] [mconfigureFlags: --verbose --prefix=/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc/share/doc/distributive-0.6.2.1 --with-gcc=gcc --package-db=/build/tmp.uP5Z8PdS5B/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[distributive] [mUsing Parsec parser
[2m[distributive] [mConfiguring distributive-0.6.2.1...
[2m[distributive] [mFlags chosen: semigroups=True, tagged=True
[2m[distributive] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[distributive] [mDependency base-orphans >=0.5.2 && <1: using base-orphans-0.9.3
[2m[distributive] [mDependency tagged >=0.7 && <1: using tagged-0.8.8
[2m[distributive] [mDependency transformers >=0.3 && <0.7: using transformers-0.6.1.0
[2m[distributive] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[distributive] [mDependency distributive: using distributive-0.6.2.1
[2m[distributive] [mDependency generic-deriving >=1.11 && <2: using generic-deriving-1.14.6
[2m[distributive] [mDependency hspec >=2 && <3: using hspec-2.11.12
[2m[distributive] [mSource component graph:
[2m[distributive] [m    component lib
[2m[distributive] [m    component test:spec dependency lib
[2m[distributive] [mConfigured component graph:
[2m[distributive] [m    component distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m        include base-4.19.0.0-b960
[2m[distributive] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[distributive] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[distributive] [m        include transformers-0.6.1.0-c3ec
[2m[distributive] [m    component distributive-0.6.2.1-Et5l07TCsjh9OVr2SE0RCb-spec
[2m[distributive] [m        include base-4.19.0.0-b960
[2m[distributive] [m        include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m        include generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[distributive] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[distributive] [mLinked component graph:
[2m[distributive] [m    unit distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m        include base-4.19.0.0-b960
[2m[distributive] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[distributive] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[distributive] [m        include transformers-0.6.1.0-c3ec
[2m[distributive] [m        Data.Distributive=distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4:Data.Distributive,Data.Distributive.Generic=distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4:Data.Distributive.Generic
[2m[distributive] [m    unit distributive-0.6.2.1-Et5l07TCsjh9OVr2SE0RCb-spec
[2m[distributive] [m        include base-4.19.0.0-b960
[2m[distributive] [m        include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m        include generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[distributive] [m        include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[distributive] [mReady component graph:
[2m[distributive] [m    definite distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m        depends base-4.19.0.0-b960
[2m[distributive] [m        depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[distributive] [m        depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[distributive] [m        depends transformers-0.6.1.0-c3ec
[2m[distributive] [m    definite distributive-0.6.2.1-Et5l07TCsjh9OVr2SE0RCb-spec
[2m[distributive] [m        depends base-4.19.0.0-b960
[2m[distributive] [m        depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m        depends generic-deriving-1.14.6-L2c8KtMQpHl6FJlO1K6CsT
[2m[distributive] [m        depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
[2m[distributive] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[distributive] [mUsing compiler: ghc-9.8.1
[2m[distributive] [mUsing install prefix:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1
[2m[distributive] [mExecutables installed in:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/bin
[2m[distributive] [mLibraries installed in:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [mDynamic Libraries installed in:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[distributive] [mPrivate executables installed in:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/libexec/x86_64-linux-ghc-9.8.1/distributive-0.6.2.1
[2m[distributive] [mData files installed in:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/share/x86_64-linux-ghc-9.8.1/distributive-0.6.2.1
[2m[distributive] [mDocumentation installed in:
[2m[distributive] [m/nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc/share/doc/distributive-0.6.2.1
[2m[distributive] [mConfiguration files installed in:
[2m[distributive] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/etc
[2m[distributive] [mNo alex found
[2m[distributive] [mUsing ar found on system at:
[2m[distributive] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[distributive] [mNo c2hs found
[2m[distributive] [mNo cpphs found
[2m[distributive] [mNo doctest found
[2m[distributive] [mUsing gcc version 14.3.0 given by user at:
[2m[distributive] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[distributive] [mUsing ghc version 9.8.1 found on system at:
[2m[distributive] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[distributive] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[distributive] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[distributive] [mNo ghcjs found
[2m[distributive] [mNo ghcjs-pkg found
[2m[distributive] [mNo greencard found
[2m[distributive] [mUsing haddock version 2.30.0 found on system at:
[2m[distributive] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[distributive] [mNo happy found
[2m[distributive] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[distributive] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[distributive] [mNo hmake found
[2m[distributive] [mUsing hpc version 0.69 found on system at:
[2m[distributive] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[distributive] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[distributive] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[distributive] [mUsing hscolour version 1.25 found on system at:
[2m[distributive] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[distributive] [mNo jhc found
[2m[distributive] [mUsing ld found on system at:
[2m[distributive] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[distributive] [mNo pkg-config found
[2m[distributive] [mUsing runghc version 9.8.1 found on system at:
[2m[distributive] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[distributive] [mUsing strip version 2.44 found on system at:
[2m[distributive] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[distributive] [mUsing tar found on system at:
[2m[distributive] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[distributive] [mNo uhc found
[2m[distributive] [m[1;36mPhase: buildPhase[m
[2m[distributive] [mPreprocessing library for distributive-0.6.2.1..
[2m[distributive] [mBuilding library for distributive-0.6.2.1..
[2m[distributive] [m[1 of 2] Compiling Data.Distributive ( src/Data/Distributive.hs, dist/build/Data/Distributive.o, dist/build/Data/Distributive.dyn_o )
[2m[distributive] [m
[2m[distributive] [m[;1msrc/Data/Distributive.hs:157:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-47082[0m[0m[;1m] [[;1m[35m-Woperator-whitespace-ext-conflict[0m[0m[;1m][0m[0m[;1m
[2m[distributive] [m    The prefix use of a ‘$’ would denote an untyped splice
[2m[distributive] [m      were the TemplateHaskell extension enabled.
[2m[distributive] [m    Suggested fix: Add whitespace after the ‘$’.[0m[0m
[2m[distributive] [m[;1m[34m    |[0m[0m
[2m[distributive] [m[;1m[34m157 |[0m[0m   distribute a e = fmap ([;1m[35m$[0m[0me) a
[2m[distributive] [m[;1m[34m    |[0m[0m[;1m[35m                          ^[0m[0m
[2m[distributive] [m[2 of 2] Compiling Data.Distributive.Generic ( src/Data/Distributive/Generic.hs, dist/build/Data/Distributive/Generic.o, dist/build/Data/Distributive/Generic.dyn_o )
[2m[distributive] [m[1 of 2] Compiling Data.Distributive ( src/Data/Distributive.hs, dist/build/Data/Distributive.p_o )
[2m[distributive] [m
[2m[distributive] [m[;1msrc/Data/Distributive.hs:157:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-47082[0m[0m[;1m] [[;1m[35m-Woperator-whitespace-ext-conflict[0m[0m[;1m][0m[0m[;1m
[2m[distributive] [m    The prefix use of a ‘$’ would denote an untyped splice
[2m[distributive] [m      were the TemplateHaskell extension enabled.
[2m[distributive] [m    Suggested fix: Add whitespace after the ‘$’.[0m[0m
[2m[distributive] [m[;1m[34m    |[0m[0m
[2m[distributive] [m[;1m[34m157 |[0m[0m   distribute a e = fmap ([;1m[35m$[0m[0me) a
[2m[distributive] [m[;1m[34m    |[0m[0m[;1m[35m                          ^[0m[0m
[2m[monad-control] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[monad-control] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[monad-control] [m[1;36mPhase: unpackPhase[m
[2m[monad-control] [munpacking source archive /nix/store/396b43ags6h9xxjjcz1ykx39qy5hxywi-monad-control-1.0.3.1.tar.gz
[2m[monad-control] [msource root is monad-control-1.0.3.1
[2m[monad-control] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "monad-control-1.0.3.1/src/Control/Monad/Trans/Control.hs"
[2m[monad-control] [m[1;36mPhase: patchPhase[m
[2m[monad-control] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[monad-control] [msetupCompileFlags: -package-db=/build/tmp.MJ52t9SMEE/setup-package.conf.d -threaded
[2m[monad-control] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.MJ52t9SMEE/Main.o )
[2m[monad-control] [m[2 of 2] Linking Setup
[2m[distributive] [m[2 of 2] Compiling Data.Distributive.Generic ( src/Data/Distributive/Generic.hs, dist/build/Data/Distributive/Generic.p_o )
[2m[distributive] [mPreprocessing test suite 'spec' for distributive-0.6.2.1..
[2m[distributive] [mBuilding test suite 'spec' for distributive-0.6.2.1..
[2m[monad-control] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[monad-control] [m[1;36mPhase: configurePhase[m
[2m[distributive] [m[1 of 2] Compiling GenericsSpec     ( tests/GenericsSpec.hs, dist/build/spec/spec-tmp/GenericsSpec.o )
[2m[monad-control] [mconfigureFlags: --verbose --prefix=/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc/share/doc/monad-control-1.0.3.1 --with-gcc=gcc --package-db=/build/tmp.MJ52t9SMEE/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[monad-control] [mUsing Parsec parser
[2m[monad-control] [mConfiguring monad-control-1.0.3.1...
[2m[monad-control] [mDependency base >=4.5 && <5: using base-4.19.0.0
[2m[monad-control] [mDependency stm >=2.3 && <3: using stm-2.5.2.1
[2m[monad-control] [mDependency transformers >=0.2 && <0.7: using transformers-0.6.1.0
[2m[monad-control] [mDependency transformers-base >=0.4.4 && <0.5: using transformers-base-0.4.6
[2m[monad-control] [mDependency transformers-compat >=0.3 && <0.8: using transformers-compat-0.7.2
[2m[distributive] [m[2 of 2] Compiling Main             ( tests/Spec.hs, dist/build/spec/spec-tmp/Main.o )
[2m[monad-control] [mSource component graph: component lib
[2m[monad-control] [mConfigured component graph:
[2m[monad-control] [m    component monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[monad-control] [m        include base-4.19.0.0-b960
[2m[monad-control] [m        include stm-2.5.2.1-83fa
[2m[monad-control] [m        include transformers-0.6.1.0-c3ec
[2m[monad-control] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[monad-control] [m        include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[monad-control] [mLinked component graph:
[2m[monad-control] [m    unit monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[monad-control] [m        include base-4.19.0.0-b960
[2m[monad-control] [m        include stm-2.5.2.1-83fa
[2m[monad-control] [m        include transformers-0.6.1.0-c3ec
[2m[monad-control] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[monad-control] [m        include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[monad-control] [m        Control.Monad.Trans.Control=monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV:Control.Monad.Trans.Control
[2m[monad-control] [mReady component graph:
[2m[monad-control] [m    definite monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[monad-control] [m        depends base-4.19.0.0-b960
[2m[monad-control] [m        depends stm-2.5.2.1-83fa
[2m[monad-control] [m        depends transformers-0.6.1.0-c3ec
[2m[monad-control] [m        depends transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[monad-control] [m        depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[monad-control] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[monad-control] [mUsing compiler: ghc-9.8.1
[2m[monad-control] [mUsing install prefix:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1
[2m[monad-control] [mExecutables installed in:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/bin
[2m[monad-control] [mLibraries installed in:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[monad-control] [mDynamic Libraries installed in:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[monad-control] [mPrivate executables installed in:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/libexec/x86_64-linux-ghc-9.8.1/monad-control-1.0.3.1
[2m[monad-control] [mData files installed in:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/share/x86_64-linux-ghc-9.8.1/monad-control-1.0.3.1
[2m[monad-control] [mDocumentation installed in:
[2m[monad-control] [m/nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc/share/doc/monad-control-1.0.3.1
[2m[monad-control] [mConfiguration files installed in:
[2m[monad-control] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/etc
[2m[monad-control] [mNo alex found
[2m[monad-control] [mUsing ar found on system at:
[2m[monad-control] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[monad-control] [mNo c2hs found
[2m[monad-control] [mNo cpphs found
[2m[monad-control] [mNo doctest found
[2m[monad-control] [mUsing gcc version 14.3.0 given by user at:
[2m[monad-control] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[monad-control] [mUsing ghc version 9.8.1 found on system at:
[2m[monad-control] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[monad-control] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[monad-control] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[monad-control] [mNo ghcjs found
[2m[monad-control] [mNo ghcjs-pkg found
[2m[monad-control] [mNo greencard found
[2m[monad-control] [mUsing haddock version 2.30.0 found on system at:
[2m[monad-control] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[monad-control] [mNo happy found
[2m[monad-control] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[monad-control] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[monad-control] [mNo hmake found
[2m[monad-control] [mUsing hpc version 0.69 found on system at:
[2m[monad-control] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[monad-control] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[monad-control] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[monad-control] [mUsing hscolour version 1.25 found on system at:
[2m[monad-control] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[monad-control] [mNo jhc found
[2m[monad-control] [mUsing ld found on system at:
[2m[monad-control] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[monad-control] [mNo pkg-config found
[2m[monad-control] [mUsing runghc version 9.8.1 found on system at:
[2m[monad-control] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[monad-control] [mUsing strip version 2.44 found on system at:
[2m[monad-control] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[monad-control] [mUsing tar found on system at:
[2m[monad-control] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[monad-control] [mNo uhc found
[2m[monad-control] [m[1;36mPhase: buildPhase[m
[2m[monad-control] [mPreprocessing library for monad-control-1.0.3.1..
[2m[monad-control] [mBuilding library for monad-control-1.0.3.1..
[2m[distributive] [m[3 of 3] Linking dist/build/spec/spec
[2m[monad-control] [m[1 of 1] Compiling Control.Monad.Trans.Control ( src/Control/Monad/Trans/Control.hs, dist/build/Control/Monad/Trans/Control.o, dist/build/Control/Monad/Trans/Control.dyn_o )
[2m[monad-control] [m
[2m[monad-control] [m[;1msrc/Control/Monad/Trans/Control.hs:207:19: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-39567[0m[0m[;1m] [[;1m[35m-Wstar-is-type[0m[0m[;1m][0m[0m[;1m
[2m[monad-control] [m    Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
[2m[monad-control] [m    relies on the StarIsType extension, which will become
[2m[monad-control] [m    deprecated in the future.
[2m[monad-control] [m    Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m
[2m[monad-control] [m[;1m[34m207 |[0m[0m   type StT t a :: [;1m[35m*[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m[;1m[35m                   ^[0m[0m
[2m[monad-control] [m
[2m[monad-control] [m[;1msrc/Control/Monad/Trans/Control.hs:546:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-39567[0m[0m[;1m] [[;1m[35m-Wstar-is-type[0m[0m[;1m][0m[0m[;1m
[2m[monad-control] [m    Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
[2m[monad-control] [m    relies on the StarIsType extension, which will become
[2m[monad-control] [m    deprecated in the future.
[2m[monad-control] [m    Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m
[2m[monad-control] [m[;1m[34m546 |[0m[0m     type StM m a :: [;1m[35m*[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m[;1m[35m                     ^[0m[0m
[2m[monad-control] [m[1 of 1] Compiling Control.Monad.Trans.Control ( src/Control/Monad/Trans/Control.hs, dist/build/Control/Monad/Trans/Control.p_o )
[2m[distributive] [m[1;36mPhase: checkPhase[m
[2m[distributive] [mRunning 1 test suites...
[2m[distributive] [mTest suite spec: RUNNING...
[2m[distributive] [m
[2m[distributive] [mGenerics
[2m[distributive] [m  Id
[2m[distributive] [m    distribute idExample = idExample [✔]
[2m[distributive] [m  Stream
[2m[distributive] [m    runId (shead (stail (distribute streamExample))) = 1 [✔]
[2m[distributive] [m  PolyRec
[2m[distributive] [m    runId (plast (runId (pinit (distribute polyRecExample)))) = 1 [✔]
[2m[distributive] [m
[2m[distributive] [mFinished in 0.0008 seconds
[2m[distributive] [m3 examples, 0 failures
[2m[distributive] [mTest suite spec: PASS
[2m[distributive] [mTest suite logged to: dist/test/distributive-0.6.2.1-spec.log
[2m[distributive] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[distributive] [m[1;36mPhase: haddockPhase[m
[2m[monad-control] [m
[2m[monad-control] [m[;1msrc/Control/Monad/Trans/Control.hs:207:19: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-39567[0m[0m[;1m] [[;1m[35m-Wstar-is-type[0m[0m[;1m][0m[0m[;1m
[2m[monad-control] [m    Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
[2m[monad-control] [m    relies on the StarIsType extension, which will become
[2m[monad-control] [m    deprecated in the future.
[2m[monad-control] [m    Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m
[2m[monad-control] [m[;1m[34m207 |[0m[0m   type StT t a :: [;1m[35m*[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m[;1m[35m                   ^[0m[0m
[2m[monad-control] [m
[2m[monad-control] [m[;1msrc/Control/Monad/Trans/Control.hs:546:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-39567[0m[0m[;1m] [[;1m[35m-Wstar-is-type[0m[0m[;1m][0m[0m[;1m
[2m[monad-control] [m    Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
[2m[monad-control] [m    relies on the StarIsType extension, which will become
[2m[monad-control] [m    deprecated in the future.
[2m[monad-control] [m    Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m
[2m[monad-control] [m[;1m[34m546 |[0m[0m     type StM m a :: [;1m[35m*[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m[;1m[35m                     ^[0m[0m
[2m[distributive] [mPreprocessing library for distributive-0.6.2.1..
[2m[distributive] [mRunning Haddock on library for distributive-0.6.2.1..
[2m[distributive] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[distributive] [m[1 of 2] Compiling Data.Distributive ( src/Data/Distributive.hs, nothing )
[2m[distributive] [m
[2m[distributive] [m[;1msrc/Data/Distributive.hs:157:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-47082[0m[0m[;1m] [[;1m[35m-Woperator-whitespace-ext-conflict[0m[0m[;1m][0m[0m[;1m
[2m[distributive] [m    The prefix use of a ‘$’ would denote an untyped splice
[2m[distributive] [m      were the TemplateHaskell extension enabled.
[2m[distributive] [m    Suggested fix: Add whitespace after the ‘$’.[0m[0m
[2m[distributive] [m[;1m[34m    |[0m[0m
[2m[distributive] [m[;1m[34m157 |[0m[0m   distribute a e = fmap ([;1m[35m$[0m[0me) a
[2m[distributive] [m[;1m[34m    |[0m[0m[;1m[35m                          ^[0m[0m
[2m[distributive] [m[2 of 2] Compiling Data.Distributive.Generic ( src/Data/Distributive/Generic.hs, nothing )
[2m[distributive] [mHaddock coverage:
[2m[distributive] [mWarning: 'Representable' is out of scope.
[2m[distributive] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[distributive] [mWarning: 'Identity' is ambiguous. It is defined
[2m[distributive] [m    * in ‘Data.Functor.Identity’
[2m[distributive] [m    * in ‘Data.Functor.Identity’
[2m[distributive] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[distributive] [m    by specifying the type/value namespace explicitly.
[2m[distributive] [m    Defaulting to the one defined in ‘Data.Functor.Identity’
[2m[distributive] [mWarning: 'Compose' is ambiguous. It is defined
[2m[distributive] [m    * in ‘Data.Functor.Compose’
[2m[distributive] [m    * in ‘Data.Functor.Compose’
[2m[distributive] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[distributive] [m    by specifying the type/value namespace explicitly.
[2m[distributive] [m    Defaulting to the one defined in ‘Data.Functor.Compose’
[2m[distributive] [m 100% (  4 /  4) in 'Data.Distributive'
[2m[distributive] [m  75% (  3 /  4) in 'Data.Distributive.Generic'
[2m[distributive] [m  Missing documentation for:
[2m[distributive] [m    GDistributive (src/Data/Distributive/Generic.hs:51)
[2m[monad-control] [m[1;36mPhase: checkPhase[m
[2m[monad-control] [mPackage has no test suites.
[2m[monad-control] [m[1;36mPhase: haddockPhase[m
[2m[monad-control] [mPreprocessing library for monad-control-1.0.3.1..
[2m[monad-control] [mRunning Haddock on library for monad-control-1.0.3.1..
[2m[monad-control] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[monad-control] [m[1 of 1] Compiling Control.Monad.Trans.Control ( src/Control/Monad/Trans/Control.hs, nothing )
[2m[monad-control] [m
[2m[monad-control] [m[;1msrc/Control/Monad/Trans/Control.hs:207:19: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-39567[0m[0m[;1m] [[;1m[35m-Wstar-is-type[0m[0m[;1m][0m[0m[;1m
[2m[monad-control] [m    Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
[2m[monad-control] [m    relies on the StarIsType extension, which will become
[2m[monad-control] [m    deprecated in the future.
[2m[monad-control] [m    Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m
[2m[monad-control] [m[;1m[34m207 |[0m[0m   type StT t a :: [;1m[35m*[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m[;1m[35m                   ^[0m[0m
[2m[monad-control] [m
[2m[monad-control] [m[;1msrc/Control/Monad/Trans/Control.hs:546:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-39567[0m[0m[;1m] [[;1m[35m-Wstar-is-type[0m[0m[;1m][0m[0m[;1m
[2m[monad-control] [m    Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
[2m[monad-control] [m    relies on the StarIsType extension, which will become
[2m[monad-control] [m    deprecated in the future.
[2m[monad-control] [m    Suggested fix: Use ‘Type’ from ‘Data.Kind’ instead.[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m
[2m[monad-control] [m[;1m[34m546 |[0m[0m     type StM m a :: [;1m[35m*[0m[0m
[2m[monad-control] [m[;1m[34m    |[0m[0m[;1m[35m                     ^[0m[0m
[2m[monad-control] [mHaddock coverage:
[2m[monad-control] [mWarning: 'IdentityT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Identity’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Identity’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Identity’
[2m[monad-control] [mWarning: 'MaybeT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Maybe’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Maybe’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Maybe’
[2m[monad-control] [mWarning: 'ErrorT' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'Error' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'ExceptT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Except’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Except’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Except’
[2m[monad-control] [mWarning: 'ListT' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'ReaderT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Reader’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Reader’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Reader’
[2m[monad-control] [mWarning: 'StateT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.State.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.State.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.State.Strict’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.State.Strict’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.State.Strict’
[2m[monad-control] [mWarning: 'WriterT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Writer.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Writer.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Writer.Strict’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.Writer.Strict’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Writer.Strict’
[2m[monad-control] [mWarning: 'RWST' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.RWS.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.RWS.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.RWS.Strict’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.RWS.Strict’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.RWS.Strict’
[2m[monad-control] [mWarning: 'ST' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.ST.Lazy.Imp’
[2m[monad-control] [m    * in ‘GHC.ST’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘GHC.ST’
[2m[monad-control] [mWarning: 'liftIO' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'liftBase' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'MonadIO' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'flip' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'runStateT' is ambiguous. It is defined
[2m[monad-control] [m    * in ‘Control.Monad.Trans.State.Lazy’
[2m[monad-control] [m    * in ‘Control.Monad.Trans.State.Strict’
[2m[monad-control] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[monad-control] [m    by specifying the type/value namespace explicitly.
[2m[monad-control] [m    Defaulting to the one defined in ‘Control.Monad.Trans.State.Strict’
[2m[monad-control] [mWarning: 'lift' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'withFile' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [mWarning: 'Just' is out of scope.
[2m[monad-control] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[monad-control] [m 100% ( 35 / 35) in 'Control.Monad.Trans.Control'
[2m[monad-control] [mWarning: Control.Monad.Trans.Control: could not find link destinations for: 
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StTMaybeTa
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StTIdentityTa
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StMSTMa
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StMIdentitya
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StMLista
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StMMaybea
[2m[monad-control] [m	- Control.Monad.Trans.Control.D:R:StMIOa
[2m[distributive] [mDocumentation created: dist/doc/html/distributive/,
[2m[distributive] [mdist/doc/html/distributive/distributive.txt
[2m[distributive] [mPreprocessing test suite 'spec' for distributive-0.6.2.1..
[2m[distributive] [m[1;36mPhase: installPhase[m
[2m[distributive] [mInstalling library in /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[distributive] [m[1;36mPhase: fixupPhase[m
[2m[distributive] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1
[2m[distributive] [mshrinking /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSdistributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4-ghc9.8.1.so
[2m[distributive] [mchecking for references to /build/ in /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1...
[2m[distributive] [mpatching script interpreter paths in /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1
[2m[distributive] [mstripping (with command strip and flags -S -p) in  /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/lib
[2m[distributive] [mshrinking RPATHs of ELF executables and libraries in /nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc
[2m[distributive] [mchecking for references to /build/ in /nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc...
[2m[distributive] [mpatching script interpreter paths in /nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc
[2m[distributive:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1 /nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc[m
[2m[distributive:post-build] [m[2mPushing 2 paths (70 are already present) using zstd to cache sellout ⏳[m
[2m[distributive:post-build] [m[2m[m
[2m[distributive:post-build] [m[2mPushing /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1 (1.23 MiB)[m
[2m[distributive:post-build] [m[2mPushing /nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc (490.02 KiB)[m
[2m[distributive:post-build] [m[2m[m
[2m[distributive:post-build] [m[2mAll done.[m
[2m[distributive:post-build] [m[2mUploading to the NixCI cache: /nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1 /nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc[m
[2m[distributive:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[distributive:post-build] [m[2mcopying 2 paths...[m
[2m[distributive:post-build] [m[2mcopying path '/nix/store/xi3xr2ygvzsml7wmqysgnv7fdhd0x2k7-distributive-0.6.2.1-doc' to 'https://cache.nix-ci.com'...[m
[2m[distributive:post-build] [m[2mcopying path '/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1' to 'https://cache.nix-ci.com'...[m
[2m[distributive:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[distributive:post-build] [m[2mcopying 1 paths...[m
[2m[distributive:post-build] [m[2mcopying path '/nix/store/xx4vji9w9h43gzi55w3xrmxyq6p8m215-distributive-0.6.2.1.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 16 of 68 built (1 building)[m
[2m[monad-control] [mDocumentation created: dist/doc/html/monad-control/,
[2m[monad-control] [mdist/doc/html/monad-control/monad-control.txt
[2m[monad-control] [m[1;36mPhase: installPhase[m
[2m[monad-control] [mInstalling library in /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[monad-control] [m[1;36mPhase: fixupPhase[m
[2m[monad-control] [mshrinking RPATHs of ELF executables and libraries in /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1
[2m[monad-control] [mshrinking /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSmonad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV-ghc9.8.1.so
[2m[monad-control] [mchecking for references to /build/ in /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1...
[2m[monad-control] [mpatching script interpreter paths in /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1
[2m[monad-control] [mstripping (with command strip and flags -S -p) in  /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/lib
[2m[monad-control] [mshrinking RPATHs of ELF executables and libraries in /nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc
[2m[monad-control] [mchecking for references to /build/ in /nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc...
[2m[monad-control] [mpatching script interpreter paths in /nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc
[2m[monad-control:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1 /nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc[m
[2m[monad-control:post-build] [m[2mPushing 2 paths (72 are already present) using zstd to cache sellout ⏳[m
[2m[monad-control:post-build] [m[2m[m
[2m[monad-control:post-build] [m[2mPushing /nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc (694.90 KiB)[m
[2m[monad-control:post-build] [m[2mPushing /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1 (885.62 KiB)[m
[2m[monad-control:post-build] [m[2m[m
[2m[monad-control:post-build] [m[2mAll done.[m
[2m[monad-control:post-build] [m[2mUploading to the NixCI cache: /nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1 /nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc[m
[2m[monad-control:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[monad-control:post-build] [m[2mcopying 2 paths...[m
[2m[monad-control:post-build] [m[2mcopying path '/nix/store/w7m2b0mfi979436da6mipa8mkdrmcjny-monad-control-1.0.3.1-doc' to 'https://cache.nix-ci.com'...[m
[2m[monad-control:post-build] [m[2mcopying path '/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1' to 'https://cache.nix-ci.com'...[m
[2m[monad-control:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[monad-control:post-build] [m[2mcopying 1 paths...[m
[2m[monad-control:post-build] [m[2mcopying path '/nix/store/9jk9z4rr6pz0gsadagdy5y97a28ifdhq-monad-control-1.0.3.1.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 17 of 68 built[m
[1;34mBuilding /nix/store/rfhpr7aas4v554h04b9cjwxmizagwzfy-lifted-base-0.2.3.12.drv[m
[2m[lifted-base] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[lifted-base] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[lifted-base] [m[1;36mPhase: unpackPhase[m
[2m[lifted-base] [munpacking source archive /nix/store/w69j2sj76rm1fkacbv4ikkk7k9f0q603-lifted-base-0.2.3.12.tar.gz
[2m[lifted-base] [msource root is lifted-base-0.2.3.12
[2m[lifted-base] [msetting SOURCE_DATE_EPOCH to timestamp 1521058398 of file "lifted-base-0.2.3.12/test/test.hs"
[2m[lifted-base] [m[1;36mPhase: patchPhase[m
[2m[lifted-base] [mapplying patch /nix/store/wjvpd3257lnn4zxpn7711nmjb4ilsfaj-6b61483ec7fd0d5d5d56ccb967860d42740781e8.patch
[2m[lifted-base] [mpatching file test/test.hs
[2m[lifted-base] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[lifted-base] [msetupCompileFlags: -package-db=/build/tmp.WRvE920tDo/setup-package.conf.d -threaded
[2m[lifted-base] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.WRvE920tDo/Main.o )
[2m[lifted-base] [m[2 of 2] Linking Setup
[33mWaiting for lock on tasty-1.5.3-doc[m
[2m[lifted-base] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[lifted-base] [m[1;36mPhase: configurePhase[m
[2m[lifted-base] [mconfigureFlags: --verbose --prefix=/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc/share/doc/lifted-base-0.2.3.12 --with-gcc=gcc --package-db=/build/tmp.WRvE920tDo/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[lifted-base] [mUsing Parsec parser
[2m[lifted-base] [mConfiguring lifted-base-0.2.3.12...
[2m[lifted-base] [mDependency base >=3 && <5: using base-4.19.0.0
[2m[lifted-base] [mDependency monad-control >=0.3: using monad-control-1.0.3.1
[2m[lifted-base] [mDependency transformers-base >=0.4: using transformers-base-0.4.6
[2m[lifted-base] [mDependency HUnit >=1.2.2: using HUnit-1.6.2.0
[2m[lifted-base] [mDependency base >=3 && <5: using base-4.19.0.0
[2m[lifted-base] [mDependency lifted-base: using lifted-base-0.2.3.12
[2m[lifted-base] [mDependency monad-control >=1.0.0.3: using monad-control-1.0.3.1
[2m[lifted-base] [mDependency test-framework >=0.2.4: using test-framework-0.8.2.2
[2m[lifted-base] [mDependency test-framework-hunit >=0.2.4: using test-framework-hunit-0.3.0.2
[2m[lifted-base] [mDependency transformers >=0.3: using transformers-0.6.1.0
[2m[lifted-base] [mDependency transformers-base >=0.4.4: using transformers-base-0.4.6
[2m[lifted-base] [mDependency transformers-compat >=0.3: using transformers-compat-0.7.2
[2m[lifted-base] [mSource component graph:
[2m[lifted-base] [m    component lib
[2m[lifted-base] [m    component test:test-lifted-base dependency lib
[2m[lifted-base] [mConfigured component graph:
[2m[lifted-base] [m    component lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m        include base-4.19.0.0-b960
[2m[lifted-base] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-base] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-base] [m    component lifted-base-0.2.3.12-4OxNeW8xcwTLhN9h9Y2lzq-test-lifted-base
[2m[lifted-base] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[lifted-base] [m        include base-4.19.0.0-b960
[2m[lifted-base] [m        include lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-base] [m        include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[lifted-base] [m        include test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[lifted-base] [m        include transformers-0.6.1.0-c3ec
[2m[lifted-base] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-base] [m        include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[lifted-base] [mLinked component graph:
[2m[lifted-base] [m    unit lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m        include base-4.19.0.0-b960
[2m[lifted-base] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-base] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-base] [m        Control.Concurrent.Chan.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Control.Concurrent.Chan.Lifted,Control.Concurrent.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Control.Concurrent.Lifted,Control.Concurrent.MVar.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Control.Concurrent.MVar.Lifted,Control.Concurrent.QSem.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Control.Concurrent.QSem.Lifted,Control.Concurrent.QSemN.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Control.Concurrent.QSemN.Lifted,Control.Exception.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Control.Exception.Lifted,Data.IORef.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Data.IORef.Lifted,Foreign.Marshal.Utils.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:Foreign.Marshal.Utils.Lifted,System.Timeout.Lifted=lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ:System.Timeout.Lifted
[2m[lifted-base] [m    unit lifted-base-0.2.3.12-4OxNeW8xcwTLhN9h9Y2lzq-test-lifted-base
[2m[lifted-base] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[lifted-base] [m        include base-4.19.0.0-b960
[2m[lifted-base] [m        include lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-base] [m        include test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[lifted-base] [m        include test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[lifted-base] [m        include transformers-0.6.1.0-c3ec
[2m[lifted-base] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-base] [m        include transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[lifted-base] [mReady component graph:
[2m[lifted-base] [m    definite lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m        depends base-4.19.0.0-b960
[2m[lifted-base] [m        depends monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-base] [m        depends transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-base] [m    definite lifted-base-0.2.3.12-4OxNeW8xcwTLhN9h9Y2lzq-test-lifted-base
[2m[lifted-base] [m        depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[lifted-base] [m        depends base-4.19.0.0-b960
[2m[lifted-base] [m        depends lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m        depends monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-base] [m        depends test-framework-0.8.2.2-L9qmYvatCN96QTQQKuiFpm
[2m[lifted-base] [m        depends test-framework-hunit-0.3.0.2-8WJfP9uTArrJ9OkFdKwpDm
[2m[lifted-base] [m        depends transformers-0.6.1.0-c3ec
[2m[lifted-base] [m        depends transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-base] [m        depends transformers-compat-0.7.2-5fRE4L51nMWD2Qd3d5RTa8
[2m[lifted-base] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[lifted-base] [mUsing compiler: ghc-9.8.1
[2m[lifted-base] [mUsing install prefix:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12
[2m[lifted-base] [mExecutables installed in:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/bin
[2m[lifted-base] [mLibraries installed in:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [mDynamic Libraries installed in:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[lifted-base] [mPrivate executables installed in:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/libexec/x86_64-linux-ghc-9.8.1/lifted-base-0.2.3.12
[2m[lifted-base] [mData files installed in:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/share/x86_64-linux-ghc-9.8.1/lifted-base-0.2.3.12
[2m[lifted-base] [mDocumentation installed in:
[2m[lifted-base] [m/nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc/share/doc/lifted-base-0.2.3.12
[2m[lifted-base] [mConfiguration files installed in:
[2m[lifted-base] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/etc
[2m[lifted-base] [mNo alex found
[2m[lifted-base] [mUsing ar found on system at:
[2m[lifted-base] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[lifted-base] [mNo c2hs found
[2m[lifted-base] [mNo cpphs found
[2m[lifted-base] [mNo doctest found
[2m[lifted-base] [mUsing gcc version 14.3.0 given by user at:
[2m[lifted-base] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[lifted-base] [mUsing ghc version 9.8.1 found on system at:
[2m[lifted-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[lifted-base] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[lifted-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[lifted-base] [mNo ghcjs found
[2m[lifted-base] [mNo ghcjs-pkg found
[2m[lifted-base] [mNo greencard found
[2m[lifted-base] [mUsing haddock version 2.30.0 found on system at:
[2m[lifted-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[lifted-base] [mNo happy found
[2m[lifted-base] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[lifted-base] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[lifted-base] [mNo hmake found
[2m[lifted-base] [mUsing hpc version 0.69 found on system at:
[2m[lifted-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[lifted-base] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[lifted-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[lifted-base] [mUsing hscolour version 1.25 found on system at:
[2m[lifted-base] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[lifted-base] [mNo jhc found
[2m[lifted-base] [mUsing ld found on system at:
[2m[lifted-base] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[lifted-base] [mNo pkg-config found
[2m[lifted-base] [mUsing runghc version 9.8.1 found on system at:
[2m[lifted-base] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[lifted-base] [mUsing strip version 2.44 found on system at:
[2m[lifted-base] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[lifted-base] [mUsing tar found on system at:
[2m[lifted-base] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[lifted-base] [mNo uhc found
[2m[lifted-base] [m[1;36mPhase: buildPhase[m
[2m[lifted-base] [mPreprocessing library for lifted-base-0.2.3.12..
[2m[lifted-base] [mBuilding library for lifted-base-0.2.3.12..
[2m[lifted-base] [m[1 of 9] Compiling Control.Concurrent.Chan.Lifted ( Control/Concurrent/Chan/Lifted.hs, dist/build/Control/Concurrent/Chan/Lifted.o, dist/build/Control/Concurrent/Chan/Lifted.dyn_o )
[2m[lifted-base] [m[2 of 9] Compiling Control.Concurrent.MVar.Lifted ( Control/Concurrent/MVar/Lifted.hs, dist/build/Control/Concurrent/MVar/Lifted.o, dist/build/Control/Concurrent/MVar/Lifted.dyn_o )
[2m[lifted-base] [m[3 of 9] Compiling Control.Concurrent.QSem.Lifted ( Control/Concurrent/QSem/Lifted.hs, dist/build/Control/Concurrent/QSem/Lifted.o, dist/build/Control/Concurrent/QSem/Lifted.dyn_o )
[2m[lifted-base] [m[4 of 9] Compiling Control.Concurrent.QSemN.Lifted ( Control/Concurrent/QSemN/Lifted.hs, dist/build/Control/Concurrent/QSemN/Lifted.o, dist/build/Control/Concurrent/QSemN/Lifted.dyn_o )
[2m[lifted-base] [m[5 of 9] Compiling Control.Exception.Lifted ( Control/Exception/Lifted.hs, dist/build/Control/Exception/Lifted.o, dist/build/Control/Exception/Lifted.dyn_o )
[2m[lifted-base] [m[6 of 9] Compiling Control.Concurrent.Lifted ( Control/Concurrent/Lifted.hs, dist/build/Control/Concurrent/Lifted.o, dist/build/Control/Concurrent/Lifted.dyn_o )
[2m[lifted-base] [m[7 of 9] Compiling Data.IORef.Lifted ( Data/IORef/Lifted.hs, dist/build/Data/IORef/Lifted.o, dist/build/Data/IORef/Lifted.dyn_o )
[2m[lifted-base] [m[8 of 9] Compiling Foreign.Marshal.Utils.Lifted ( Foreign/Marshal/Utils/Lifted.hs, dist/build/Foreign/Marshal/Utils/Lifted.o, dist/build/Foreign/Marshal/Utils/Lifted.dyn_o )
[2m[lifted-base] [m[9 of 9] Compiling System.Timeout.Lifted ( System/Timeout/Lifted.hs, dist/build/System/Timeout/Lifted.o, dist/build/System/Timeout/Lifted.dyn_o )
[2m[lifted-base] [m[1 of 9] Compiling Control.Concurrent.Chan.Lifted ( Control/Concurrent/Chan/Lifted.hs, dist/build/Control/Concurrent/Chan/Lifted.p_o )
[2m[lifted-base] [m[2 of 9] Compiling Control.Concurrent.MVar.Lifted ( Control/Concurrent/MVar/Lifted.hs, dist/build/Control/Concurrent/MVar/Lifted.p_o )
[2m[lifted-base] [m[3 of 9] Compiling Control.Concurrent.QSem.Lifted ( Control/Concurrent/QSem/Lifted.hs, dist/build/Control/Concurrent/QSem/Lifted.p_o )
[2m[lifted-base] [m[4 of 9] Compiling Control.Concurrent.QSemN.Lifted ( Control/Concurrent/QSemN/Lifted.hs, dist/build/Control/Concurrent/QSemN/Lifted.p_o )
[2m[lifted-base] [m[5 of 9] Compiling Control.Exception.Lifted ( Control/Exception/Lifted.hs, dist/build/Control/Exception/Lifted.p_o )
[2m[lifted-base] [m[6 of 9] Compiling Control.Concurrent.Lifted ( Control/Concurrent/Lifted.hs, dist/build/Control/Concurrent/Lifted.p_o )
[2m[lifted-base] [m[7 of 9] Compiling Data.IORef.Lifted ( Data/IORef/Lifted.hs, dist/build/Data/IORef/Lifted.p_o )
[2m[lifted-base] [m[8 of 9] Compiling Foreign.Marshal.Utils.Lifted ( Foreign/Marshal/Utils/Lifted.hs, dist/build/Foreign/Marshal/Utils/Lifted.p_o )
[2m[lifted-base] [m[9 of 9] Compiling System.Timeout.Lifted ( System/Timeout/Lifted.hs, dist/build/System/Timeout/Lifted.p_o )
[2m[lifted-base] [mPreprocessing test suite 'test-lifted-base' for lifted-base-0.2.3.12..
[2m[lifted-base] [mBuilding test suite 'test-lifted-base' for lifted-base-0.2.3.12..
[2m[lifted-base] [m[1 of 1] Compiling Main             ( test/test.hs, dist/build/test-lifted-base/test-lifted-base-tmp/Main.o )
[2m[lifted-base] [m[2 of 2] Linking dist/build/test-lifted-base/test-lifted-base
[2m[lifted-base] [m[1;36mPhase: checkPhase[m
[2m[lifted-base] [mRunning 1 test suites...
[2m[lifted-base] [mTest suite test-lifted-base: RUNNING...
[2m[lifted-base] [mIdentityT:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mMaybeT:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mReaderT:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mWriterT:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mExceptT:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mStateT:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mRWST:
[2m[lifted-base] [m  finally: [OK]
[2m[lifted-base] [m  catch: [OK]
[2m[lifted-base] [m  bracket: [OK]
[2m[lifted-base] [m  bracket_: [OK]
[2m[lifted-base] [m  onException: [OK]
[2m[lifted-base] [mExceptT throwE: [OK]
[2m[lifted-base] [mWriterT tell: [OK]
[2m[lifted-base] [m
[2m[lifted-base] [m         Test Cases  Total 
[2m[lifted-base] [m Passed  37          37    
[2m[lifted-base] [m Failed  0           0     
[2m[lifted-base] [m Total   37          37    
[2m[lifted-base] [mTest suite test-lifted-base: PASS
[2m[lifted-base] [mTest suite logged to: dist/test/lifted-base-0.2.3.12-test-lifted-base.log
[2m[lifted-base] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[lifted-base] [m[1;36mPhase: haddockPhase[m
[2m[lifted-base] [mPreprocessing library for lifted-base-0.2.3.12..
[2m[lifted-base] [mRunning Haddock on library for lifted-base-0.2.3.12..
[2m[lifted-base] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[lifted-base] [m[1 of 9] Compiling Control.Concurrent.Chan.Lifted ( Control/Concurrent/Chan/Lifted.hs, nothing )
[2m[lifted-base] [m[2 of 9] Compiling Control.Concurrent.MVar.Lifted ( Control/Concurrent/MVar/Lifted.hs, nothing )
[2m[lifted-base] [m[3 of 9] Compiling Control.Concurrent.QSem.Lifted ( Control/Concurrent/QSem/Lifted.hs, nothing )
[2m[lifted-base] [m[4 of 9] Compiling Control.Concurrent.QSemN.Lifted ( Control/Concurrent/QSemN/Lifted.hs, nothing )
[2m[lifted-base] [m[5 of 9] Compiling Control.Exception.Lifted ( Control/Exception/Lifted.hs, nothing )
[2m[lifted-base] [m[6 of 9] Compiling Control.Concurrent.Lifted ( Control/Concurrent/Lifted.hs, nothing )
[2m[lifted-base] [m[7 of 9] Compiling Data.IORef.Lifted ( Data/IORef/Lifted.hs, nothing )
[2m[lifted-base] [m[8 of 9] Compiling Foreign.Marshal.Utils.Lifted ( Foreign/Marshal/Utils/Lifted.hs, nothing )
[2m[lifted-base] [m[9 of 9] Compiling System.Timeout.Lifted ( System/Timeout/Lifted.hs, nothing )
[2m[lifted-base] [mHaddock coverage:
[2m[lifted-base] [m 100% (  8 /  8) in 'Control.Concurrent.Chan.Lifted'
[2m[lifted-base] [m 100% ( 19 / 19) in 'Control.Concurrent.MVar.Lifted'
[2m[lifted-base] [m 100% (  5 /  5) in 'Control.Concurrent.QSem.Lifted'
[2m[lifted-base] [m 100% (  5 /  5) in 'Control.Concurrent.QSemN.Lifted'
[2m[lifted-base] [mWarning: 'liftBaseOp' is out of scope.
[2m[lifted-base] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[lifted-base] [mWarning: 'bracket' is ambiguous. It is defined
[2m[lifted-base] [m    * in ‘Control.Exception.Base’
[2m[lifted-base] [m    * at Control/Exception/Lifted.hs:352:1
[2m[lifted-base] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-base] [m    by specifying the type/value namespace explicitly.
[2m[lifted-base] [m    Defaulting to the one defined at Control/Exception/Lifted.hs:352:1
[2m[lifted-base] [m 100% ( 64 / 64) in 'Control.Exception.Lifted'
[2m[lifted-base] [m 100% ( 36 / 36) in 'Control.Concurrent.Lifted'
[2m[lifted-base] [m 100% ( 11 / 11) in 'Data.IORef.Lifted'
[2m[lifted-base] [mWarning: 'MonadBase' is out of scope.
[2m[lifted-base] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[lifted-base] [m 100% (  2 /  2) in 'Foreign.Marshal.Utils.Lifted'
[2m[lifted-base] [m 100% (  2 /  2) in 'System.Timeout.Lifted'
[2m[lifted-base] [mWarning: Control.Exception.Lifted: could not find link destinations for: 
[2m[lifted-base] [m	- GHC.IOPort.IOPortException
[2m[lifted-base] [mDocumentation created: dist/doc/html/lifted-base/,
[2m[lifted-base] [mdist/doc/html/lifted-base/lifted-base.txt
[2m[lifted-base] [mPreprocessing test suite 'test-lifted-base' for lifted-base-0.2.3.12..
[2m[lifted-base] [m[1;36mPhase: installPhase[m
[2m[lifted-base] [mInstalling library in /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-base] [m[1;36mPhase: fixupPhase[m
[2m[lifted-base] [mshrinking RPATHs of ELF executables and libraries in /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12
[2m[lifted-base] [mshrinking /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSlifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ-ghc9.8.1.so
[2m[lifted-base] [mchecking for references to /build/ in /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12...
[2m[lifted-base] [mpatching script interpreter paths in /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12
[2m[lifted-base] [mstripping (with command strip and flags -S -p) in  /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/lib
[2m[lifted-base] [mshrinking RPATHs of ELF executables and libraries in /nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc
[2m[lifted-base] [mchecking for references to /build/ in /nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc...
[2m[lifted-base] [mpatching script interpreter paths in /nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc
[2m[lifted-base:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12[m
[2m[lifted-base:post-build] [m[2mPushing 2 paths (74 are already present) using zstd to cache sellout ⏳[m
[2m[lifted-base:post-build] [m[2m[m
[2m[lifted-base:post-build] [m[2mPushing /nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc (1.13 MiB)[m
[2m[lifted-base:post-build] [m[2mPushing /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12 (1.21 MiB)[m
[2m[lifted-base:post-build] [m[2m[m
[2m[lifted-base:post-build] [m[2mAll done.[m
[2m[lifted-base:post-build] [m[2mUploading to the NixCI cache: /nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc /nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12[m
[2m[lifted-base:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[lifted-base:post-build] [m[2mcopying 2 paths...[m
[2m[lifted-base:post-build] [m[2mcopying path '/nix/store/qqadk3af352cmdnm84smgxg3vkw01bcs-lifted-base-0.2.3.12-doc' to 'https://cache.nix-ci.com'...[m
[2m[lifted-base:post-build] [m[2mcopying path '/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12' to 'https://cache.nix-ci.com'...[m
[2m[lifted-base:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[lifted-base:post-build] [m[2mcopying 1 paths...[m
[2m[lifted-base:post-build] [m[2mcopying path '/nix/store/rfhpr7aas4v554h04b9cjwxmizagwzfy-lifted-base-0.2.3.12.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 18 of 67 built[m
[33mWaiting for lock on tasty-hunit[m
[33mWaiting for lock on tasty-inspection-testing-0.2.1-doc[m
[33mWaiting for lock on os-string[m
[1;34mBuilding /nix/store/cd1ry03s337cjw2hw21l3b85nyab4nrn-syb-0.7.2.4.drv[m
[1;34mBuilding /nix/store/5x143i0gr2cgah8vi0vpd3imk23hiiq1-tasty-quickcheck-0.11.drv[m
[1;34mBuilding /nix/store/31gabxsazmdi2qprqh914g394xpzcj5z-wherefrom-compat-0.1.1.1.drv[m
[1;34mBuilding /nix/store/mi7f2j158zasc25kavjp2v10q5ipw78z-wl-pprint-annotated-0.1.0.1.drv[m
[2m[syb] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[syb] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[tasty-quickcheck] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[tasty-quickcheck] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[wherefrom-compat] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[wherefrom-compat] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[wl-pprint-annotated] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[wl-pprint-annotated] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[syb] [m[1;36mPhase: unpackPhase[m
[2m[syb] [munpacking source archive /nix/store/p37dsy0shv5hlnynhc1l831h8wx3i5li-syb-0.7.2.4.tar.gz
[2m[syb] [msource root is syb-0.7.2.4
[2m[syb] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "syb-0.7.2.4/tests/XML.hs"
[2m[syb] [m[1;36mPhase: patchPhase[m
[2m[syb] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[syb] [msetupCompileFlags: -package-db=/build/tmp.xeRGw0AzSF/setup-package.conf.d -threaded
[2m[tasty-quickcheck] [m[1;36mPhase: unpackPhase[m
[2m[tasty-quickcheck] [munpacking source archive /nix/store/6qj6q0g4kqx2n1q4f2fbsqczgkmw13xm-tasty-quickcheck-0.11.tar.gz
[2m[tasty-quickcheck] [msource root is tasty-quickcheck-0.11
[2m[tasty-quickcheck] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "tasty-quickcheck-0.11/Test/Tasty/QuickCheck.hs"
[2m[wl-pprint-annotated] [m[1;36mPhase: unpackPhase[m
[2m[syb] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.xeRGw0AzSF/Main.o )
[2m[wl-pprint-annotated] [munpacking source archive /nix/store/320gy380f672zd3i5qqg12igsnisd76p-wl-pprint-annotated-0.1.0.1.tar.gz
[2m[tasty-quickcheck] [m[1;36mPhase: patchPhase[m
[2m[wl-pprint-annotated] [msource root is wl-pprint-annotated-0.1.0.1
[2m[tasty-quickcheck] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[tasty-quickcheck] [msetupCompileFlags: -package-db=/build/tmp.8P5IlX1ftZ/setup-package.conf.d -threaded
[2m[wl-pprint-annotated] [msetting SOURCE_DATE_EPOCH to timestamp 1534196192 of file "wl-pprint-annotated-0.1.0.1/wl-pprint-annotated.cabal"
[2m[wl-pprint-annotated] [m[1;36mPhase: patchPhase[m
[2m[wherefrom-compat] [m[1;36mPhase: unpackPhase[m
[2m[wherefrom-compat] [munpacking source archive /nix/store/v59qprs3lj2kkn01f2g4v8a6irqd9vnh-wherefrom-compat-0.1.1.1.tar.gz
[2m[wl-pprint-annotated] [mReplace Cabal file with edited version from mirror://hackage/wl-pprint-annotated-0.1.0.1/revision/4.cabal.
[2m[wl-pprint-annotated] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[wherefrom-compat] [msource root is wherefrom-compat-0.1.1.1
[2m[wl-pprint-annotated] [msetupCompileFlags: -package-db=/build/tmp.68R0wbyMho/setup-package.conf.d -threaded
[2m[wherefrom-compat] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "wherefrom-compat-0.1.1.1/wherefrom-compat.cabal"
[2m[wherefrom-compat] [m[1;36mPhase: patchPhase[m
[2m[wherefrom-compat] [mReplace Cabal file with edited version from mirror://hackage/wherefrom-compat-0.1.1.1/revision/1.cabal.
[2m[wherefrom-compat] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[wherefrom-compat] [msetupCompileFlags: -package-db=/build/tmp.UVro7eJpsZ/setup-package.conf.d -threaded
[2m[tasty-quickcheck] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.8P5IlX1ftZ/Main.o )
[2m[wl-pprint-annotated] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.68R0wbyMho/Main.o )
[2m[syb] [m[2 of 2] Linking Setup
[2m[wherefrom-compat] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.UVro7eJpsZ/Main.o )
[2m[tasty-quickcheck] [m[2 of 2] Linking Setup
[2m[wl-pprint-annotated] [m[2 of 2] Linking Setup
[2m[wherefrom-compat] [m[2 of 2] Linking Setup
[2m[syb] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[syb] [m[1;36mPhase: configurePhase[m
[2m[syb] [mconfigureFlags: --verbose --prefix=/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc/share/doc/syb-0.7.2.4 --with-gcc=gcc --package-db=/build/tmp.xeRGw0AzSF/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[syb] [mUsing Parsec parser
[2m[syb] [mConfiguring syb-0.7.2.4...
[2m[wl-pprint-annotated] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[wl-pprint-annotated] [m[1;36mPhase: configurePhase[m
[2m[wl-pprint-annotated] [mconfigureFlags: --verbose --prefix=/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc/share/doc/wl-pprint-annotated-0.1.0.1 --with-gcc=gcc --package-db=/build/tmp.68R0wbyMho/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[wl-pprint-annotated] [mUsing Parsec parser
[2m[wl-pprint-annotated] [mConfiguring wl-pprint-annotated-0.1.0.1...
[2m[tasty-quickcheck] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[tasty-quickcheck] [m[1;36mPhase: configurePhase[m
[2m[tasty-quickcheck] [mconfigureFlags: --verbose --prefix=/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc/share/doc/tasty-quickcheck-0.11 --with-gcc=gcc --package-db=/build/tmp.8P5IlX1ftZ/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[wherefrom-compat] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[tasty-quickcheck] [mUsing Parsec parser
[2m[tasty-quickcheck] [mConfiguring tasty-quickcheck-0.11...
[2m[wherefrom-compat] [m[1;36mPhase: configurePhase[m
[2m[wherefrom-compat] [mconfigureFlags: --verbose --prefix=/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc/share/doc/wherefrom-compat-0.1.1.1 --with-gcc=gcc --package-db=/build/tmp.UVro7eJpsZ/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[wherefrom-compat] [mUsing Parsec parser
[2m[wherefrom-compat] [mConfiguring wherefrom-compat-0.1.1.1...
[2m[syb] [mDependency base >=4.0 && <5.0: using base-4.19.0.0
[2m[syb] [mDependency base: using base-4.19.0.0
[2m[syb] [mDependency containers: using containers-0.6.8
[2m[syb] [mDependency mtl: using mtl-2.3.1
[2m[syb] [mDependency syb: using syb-0.7.2.4
[2m[syb] [mDependency tasty: using tasty-1.5.3
[2m[syb] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[wl-pprint-annotated] [mDependency base >=4.8 && <5: using base-4.19.0.0
[2m[wl-pprint-annotated] [mDependency containers >=0.4 && <0.9: using containers-0.6.8
[2m[wl-pprint-annotated] [mDependency deepseq >=1.4 && <1.6: using deepseq-1.5.0.0
[2m[wl-pprint-annotated] [mDependency text >=0.11 && <2.2: using text-2.1
[2m[wl-pprint-annotated] [mDependency base >=4.8 && <5: using base-4.19.0.0
[2m[wl-pprint-annotated] [mDependency containers >=0.4 && <0.9: using containers-0.6.8
[2m[wl-pprint-annotated] [mDependency deepseq >=1.4 && <1.6: using deepseq-1.5.0.0
[2m[wl-pprint-annotated] [mDependency tasty: using tasty-1.5.3
[2m[wl-pprint-annotated] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[wl-pprint-annotated] [mDependency text >=0.11 && <2.2: using text-2.1
[2m[wl-pprint-annotated] [mDependency wl-pprint-annotated: using wl-pprint-annotated-0.1.0.1
[2m[tasty-quickcheck] [mDependency QuickCheck >=2.10 && <2.16: using QuickCheck-2.14.3
[2m[tasty-quickcheck] [mDependency base >=4.8 && <5: using base-4.19.0.0
[2m[tasty-quickcheck] [mDependency optparse-applicative <0.19: using optparse-applicative-0.18.1.0
[2m[tasty-quickcheck] [mDependency random <1.3: using random-1.2.1.3
[2m[tasty-quickcheck] [mDependency tagged <0.9: using tagged-0.8.8
[2m[tasty-quickcheck] [mDependency tasty >=1.5 && <1.6: using tasty-1.5.3
[2m[tasty-quickcheck] [mDependency QuickCheck: using QuickCheck-2.14.3
[2m[tasty-quickcheck] [mDependency base >=4.7 && <5: using base-4.19.0.0
[2m[tasty-quickcheck] [mDependency pcre-light: using pcre-light-0.4.1.3
[2m[tasty-quickcheck] [mDependency tasty >=1.5: using tasty-1.5.3
[2m[tasty-quickcheck] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[tasty-quickcheck] [mDependency tasty-quickcheck: using tasty-quickcheck-0.11
[2m[wherefrom-compat] [mDependency base >=4.16.0.0 && <4.22.0.0: using base-4.19.0.0
[2m[wherefrom-compat] [mDependency base: using base-4.19.0.0
[2m[wherefrom-compat] [mDependency tasty >=1.5 && <1.6: using tasty-1.5.3
[2m[wherefrom-compat] [mDependency tasty-hunit >=0.10 && <0.11: using tasty-hunit-0.10.2
[2m[wherefrom-compat] [mDependency wherefrom-compat: using wherefrom-compat-0.1.1.1
[2m[wl-pprint-annotated] [mSource component graph:
[2m[wl-pprint-annotated] [m    component lib
[2m[wl-pprint-annotated] [m    component test:wl-pprint dependency lib
[2m[wl-pprint-annotated] [mConfigured component graph:
[2m[wl-pprint-annotated] [m    component wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [m        include base-4.19.0.0-b960
[2m[wl-pprint-annotated] [m        include containers-0.6.8-4775
[2m[wl-pprint-annotated] [m        include deepseq-1.5.0.0-412f
[2m[wl-pprint-annotated] [m        include text-2.1-c36a
[2m[wl-pprint-annotated] [m    component wl-pprint-annotated-0.1.0.1-GqRfvVrsoy6JNh2wx8uECY-wl-pprint
[2m[wl-pprint-annotated] [m        include base-4.19.0.0-b960
[2m[wl-pprint-annotated] [m        include containers-0.6.8-4775
[2m[wl-pprint-annotated] [m        include deepseq-1.5.0.0-412f
[2m[wl-pprint-annotated] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[wl-pprint-annotated] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[wl-pprint-annotated] [m        include text-2.1-c36a
[2m[wl-pprint-annotated] [m        include wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [mLinked component graph:
[2m[wl-pprint-annotated] [m    unit wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [m        include base-4.19.0.0-b960
[2m[wl-pprint-annotated] [m        include containers-0.6.8-4775
[2m[wl-pprint-annotated] [m        include deepseq-1.5.0.0-412f
[2m[wl-pprint-annotated] [m        include text-2.1-c36a
[2m[wl-pprint-annotated] [m        Text.PrettyPrint.Annotated.WL=wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3:Text.PrettyPrint.Annotated.WL
[2m[wl-pprint-annotated] [m    unit wl-pprint-annotated-0.1.0.1-GqRfvVrsoy6JNh2wx8uECY-wl-pprint
[2m[wl-pprint-annotated] [m        include base-4.19.0.0-b960
[2m[wl-pprint-annotated] [m        include containers-0.6.8-4775
[2m[wl-pprint-annotated] [m        include deepseq-1.5.0.0-412f
[2m[wl-pprint-annotated] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[wl-pprint-annotated] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[wl-pprint-annotated] [m        include text-2.1-c36a
[2m[wl-pprint-annotated] [m        include wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [mReady component graph:
[2m[wl-pprint-annotated] [m    definite wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [m        depends base-4.19.0.0-b960
[2m[wl-pprint-annotated] [m        depends containers-0.6.8-4775
[2m[wl-pprint-annotated] [m        depends deepseq-1.5.0.0-412f
[2m[wl-pprint-annotated] [m        depends text-2.1-c36a
[2m[wl-pprint-annotated] [m    definite wl-pprint-annotated-0.1.0.1-GqRfvVrsoy6JNh2wx8uECY-wl-pprint
[2m[wl-pprint-annotated] [m        depends base-4.19.0.0-b960
[2m[wl-pprint-annotated] [m        depends containers-0.6.8-4775
[2m[wl-pprint-annotated] [m        depends deepseq-1.5.0.0-412f
[2m[wl-pprint-annotated] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[wl-pprint-annotated] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[wl-pprint-annotated] [m        depends text-2.1-c36a
[2m[wl-pprint-annotated] [m        depends wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[wl-pprint-annotated] [mUsing compiler: ghc-9.8.1
[2m[wl-pprint-annotated] [mUsing install prefix:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1
[2m[wl-pprint-annotated] [mExecutables installed in:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/bin
[2m[wl-pprint-annotated] [mLibraries installed in:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[wl-pprint-annotated] [mDynamic Libraries installed in:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[wl-pprint-annotated] [mPrivate executables installed in:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/libexec/x86_64-linux-ghc-9.8.1/wl-pprint-annotated-0.1.0.1
[2m[wl-pprint-annotated] [mData files installed in:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/share/x86_64-linux-ghc-9.8.1/wl-pprint-annotated-0.1.0.1
[2m[wl-pprint-annotated] [mDocumentation installed in:
[2m[wl-pprint-annotated] [m/nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc/share/doc/wl-pprint-annotated-0.1.0.1
[2m[wl-pprint-annotated] [mConfiguration files installed in:
[2m[wl-pprint-annotated] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/etc
[2m[wl-pprint-annotated] [mNo alex found
[2m[wl-pprint-annotated] [mUsing ar found on system at:
[2m[wl-pprint-annotated] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[wl-pprint-annotated] [mNo c2hs found
[2m[wl-pprint-annotated] [mNo cpphs found
[2m[wl-pprint-annotated] [mNo doctest found
[2m[wl-pprint-annotated] [mUsing gcc version 14.3.0 given by user at:
[2m[wl-pprint-annotated] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[wl-pprint-annotated] [mUsing ghc version 9.8.1 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[wl-pprint-annotated] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[wl-pprint-annotated] [mNo ghcjs found
[2m[wl-pprint-annotated] [mNo ghcjs-pkg found
[2m[wl-pprint-annotated] [mNo greencard found
[2m[wl-pprint-annotated] [mUsing haddock version 2.30.0 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[wl-pprint-annotated] [mNo happy found
[2m[wl-pprint-annotated] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[wl-pprint-annotated] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[wl-pprint-annotated] [mNo hmake found
[2m[wl-pprint-annotated] [mUsing hpc version 0.69 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[wl-pprint-annotated] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[wl-pprint-annotated] [mUsing hscolour version 1.25 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[wl-pprint-annotated] [mNo jhc found
[2m[wl-pprint-annotated] [mUsing ld found on system at:
[2m[wl-pprint-annotated] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[wl-pprint-annotated] [mNo pkg-config found
[2m[wl-pprint-annotated] [mUsing runghc version 9.8.1 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[wl-pprint-annotated] [mUsing strip version 2.44 found on system at:
[2m[wl-pprint-annotated] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[wl-pprint-annotated] [mUsing tar found on system at:
[2m[wl-pprint-annotated] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[wl-pprint-annotated] [mNo uhc found
[2m[syb] [mSource component graph:
[2m[syb] [m    component lib
[2m[syb] [m    component test:unit-tests dependency lib
[2m[syb] [mConfigured component graph:
[2m[syb] [m    component syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [m        include base-4.19.0.0-b960
[2m[syb] [m    component syb-0.7.2.4-IwDXl0sLvSv13CXrpdLxVO-unit-tests
[2m[syb] [m        include base-4.19.0.0-b960
[2m[syb] [m        include containers-0.6.8-4775
[2m[syb] [m        include mtl-2.3.1-63a4
[2m[syb] [m        include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[syb] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[syb] [mLinked component graph:
[2m[syb] [m    unit syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [m        include base-4.19.0.0-b960
[2m[syb] [m        Data.Generics=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics,Data.Generics.Aliases=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Aliases,Data.Generics.Basics=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Basics,Data.Generics.Builders=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Builders,Data.Generics.Instances=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Instances,Data.Generics.Schemes=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Schemes,Data.Generics.Text=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Text,Data.Generics.Twins=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Data.Generics.Twins,Generics.SYB=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB,Generics.SYB.Aliases=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Aliases,Generics.SYB.Basics=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Basics,Generics.SYB.Builders=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Builders,Generics.SYB.Instances=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Instances,Generics.SYB.Schemes=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Schemes,Generics.SYB.Text=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Text,Generics.SYB.Twins=syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI:Generics.SYB.Twins
[2m[syb] [m    unit syb-0.7.2.4-IwDXl0sLvSv13CXrpdLxVO-unit-tests
[2m[syb] [m        include base-4.19.0.0-b960
[2m[syb] [m        include containers-0.6.8-4775
[2m[syb] [m        include mtl-2.3.1-63a4
[2m[syb] [m        include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[syb] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[syb] [mReady component graph:
[2m[syb] [m    definite syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [m        depends base-4.19.0.0-b960
[2m[syb] [m    definite syb-0.7.2.4-IwDXl0sLvSv13CXrpdLxVO-unit-tests
[2m[syb] [m        depends base-4.19.0.0-b960
[2m[syb] [m        depends containers-0.6.8-4775
[2m[syb] [m        depends mtl-2.3.1-63a4
[2m[syb] [m        depends syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[syb] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[syb] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[syb] [mUsing compiler: ghc-9.8.1
[2m[syb] [mUsing install prefix: /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4
[2m[syb] [mExecutables installed in:
[2m[syb] [m/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/bin
[2m[syb] [mLibraries installed in:
[2m[syb] [m/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[syb] [mDynamic Libraries installed in:
[2m[syb] [m/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[syb] [mPrivate executables installed in:
[2m[syb] [m/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/libexec/x86_64-linux-ghc-9.8.1/syb-0.7.2.4
[2m[syb] [mData files installed in:
[2m[syb] [m/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/share/x86_64-linux-ghc-9.8.1/syb-0.7.2.4
[2m[syb] [mDocumentation installed in:
[2m[syb] [m/nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc/share/doc/syb-0.7.2.4
[2m[syb] [mConfiguration files installed in:
[2m[syb] [m/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/etc
[2m[syb] [mNo alex found
[2m[syb] [mUsing ar found on system at:
[2m[syb] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[syb] [mNo c2hs found
[2m[syb] [mNo cpphs found
[2m[syb] [mNo doctest found
[2m[syb] [mUsing gcc version 14.3.0 given by user at:
[2m[syb] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[syb] [mUsing ghc version 9.8.1 found on system at:
[2m[syb] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[syb] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[syb] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[syb] [mNo ghcjs found
[2m[syb] [mNo ghcjs-pkg found
[2m[syb] [mNo greencard found
[2m[syb] [mUsing haddock version 2.30.0 found on system at:
[2m[syb] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[syb] [mNo happy found
[2m[syb] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[syb] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[syb] [mNo hmake found
[2m[syb] [mUsing hpc version 0.69 found on system at:
[2m[syb] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[syb] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[syb] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[syb] [mUsing hscolour version 1.25 found on system at:
[2m[syb] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[syb] [mNo jhc found
[2m[syb] [mUsing ld found on system at:
[2m[syb] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[syb] [mNo pkg-config found
[2m[syb] [mUsing runghc version 9.8.1 found on system at:
[2m[syb] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[syb] [mUsing strip version 2.44 found on system at:
[2m[syb] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[syb] [mUsing tar found on system at:
[2m[syb] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[syb] [mNo uhc found
[2m[wherefrom-compat] [mSource component graph:
[2m[wherefrom-compat] [m    component lib
[2m[wherefrom-compat] [m    component test:test dependency lib
[2m[wherefrom-compat] [mConfigured component graph:
[2m[wherefrom-compat] [m    component wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [m        include base-4.19.0.0-b960
[2m[wherefrom-compat] [m    component wherefrom-compat-0.1.1.1-4mlPPcW49uh3goCTEM4g8t-test
[2m[wherefrom-compat] [m        include base-4.19.0.0-b960
[2m[wherefrom-compat] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[wherefrom-compat] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[wherefrom-compat] [m        include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [mLinked component graph:
[2m[wherefrom-compat] [m    unit wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [m        include base-4.19.0.0-b960
[2m[wherefrom-compat] [m        GHC.InfoProv.Compat=wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn:GHC.InfoProv.Compat
[2m[wherefrom-compat] [m    unit wherefrom-compat-0.1.1.1-4mlPPcW49uh3goCTEM4g8t-test
[2m[wherefrom-compat] [m        include base-4.19.0.0-b960
[2m[wherefrom-compat] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[wherefrom-compat] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[wherefrom-compat] [m        include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [mReady component graph:
[2m[wherefrom-compat] [m    definite wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [m        depends base-4.19.0.0-b960
[2m[wherefrom-compat] [m    definite wherefrom-compat-0.1.1.1-4mlPPcW49uh3goCTEM4g8t-test
[2m[wherefrom-compat] [m        depends base-4.19.0.0-b960
[2m[wherefrom-compat] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[wherefrom-compat] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[wherefrom-compat] [m        depends wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[wherefrom-compat] [mUsing compiler: ghc-9.8.1
[2m[wherefrom-compat] [mUsing install prefix:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1
[2m[wherefrom-compat] [mExecutables installed in:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/bin
[2m[wherefrom-compat] [mLibraries installed in:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[wherefrom-compat] [mDynamic Libraries installed in:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[wherefrom-compat] [mPrivate executables installed in:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/libexec/x86_64-linux-ghc-9.8.1/wherefrom-compat-0.1.1.1
[2m[wherefrom-compat] [mData files installed in:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/share/x86_64-linux-ghc-9.8.1/wherefrom-compat-0.1.1.1
[2m[wherefrom-compat] [mDocumentation installed in:
[2m[wherefrom-compat] [m/nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc/share/doc/wherefrom-compat-0.1.1.1
[2m[wherefrom-compat] [mConfiguration files installed in:
[2m[wherefrom-compat] [m/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/etc
[2m[wherefrom-compat] [mNo alex found
[2m[wherefrom-compat] [mUsing ar found on system at:
[2m[wherefrom-compat] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[wherefrom-compat] [mNo c2hs found
[2m[wherefrom-compat] [mNo cpphs found
[2m[wherefrom-compat] [mNo doctest found
[2m[wherefrom-compat] [mUsing gcc version 14.3.0 given by user at:
[2m[wherefrom-compat] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[wherefrom-compat] [mUsing ghc version 9.8.1 found on system at:
[2m[wherefrom-compat] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[wherefrom-compat] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[wherefrom-compat] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[wherefrom-compat] [mNo ghcjs found
[2m[wherefrom-compat] [mNo ghcjs-pkg found
[2m[wherefrom-compat] [mNo greencard found
[2m[wherefrom-compat] [mUsing haddock version 2.30.0 found on system at:
[2m[wherefrom-compat] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[wherefrom-compat] [mNo happy found
[2m[wherefrom-compat] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[wherefrom-compat] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[wherefrom-compat] [mNo hmake found
[2m[wherefrom-compat] [mUsing hpc version 0.69 found on system at:
[2m[wherefrom-compat] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[wherefrom-compat] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[wherefrom-compat] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[wherefrom-compat] [mUsing hscolour version 1.25 found on system at:
[2m[wherefrom-compat] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[wherefrom-compat] [mNo jhc found
[2m[wherefrom-compat] [mUsing ld found on system at:
[2m[wherefrom-compat] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[wherefrom-compat] [mNo pkg-config found
[2m[wherefrom-compat] [mUsing runghc version 9.8.1 found on system at:
[2m[wherefrom-compat] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[wherefrom-compat] [mUsing strip version 2.44 found on system at:
[2m[wherefrom-compat] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[wherefrom-compat] [mUsing tar found on system at:
[2m[wherefrom-compat] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[wherefrom-compat] [mNo uhc found
[2m[tasty-quickcheck] [mSource component graph:
[2m[tasty-quickcheck] [m    component lib
[2m[tasty-quickcheck] [m    component test:test dependency lib
[2m[tasty-quickcheck] [mConfigured component graph:
[2m[tasty-quickcheck] [m    component tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[tasty-quickcheck] [m        include base-4.19.0.0-b960
[2m[tasty-quickcheck] [m        include optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
[2m[tasty-quickcheck] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[tasty-quickcheck] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-quickcheck] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-quickcheck] [m    component tasty-quickcheck-0.11-9kP08E8SxWAA1RHeRCIH5o-test
[2m[tasty-quickcheck] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[tasty-quickcheck] [m        include base-4.19.0.0-b960
[2m[tasty-quickcheck] [m        include pcre-light-0.4.1.3-2zuqqUboRiHItQaeLEjH89
[2m[tasty-quickcheck] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-quickcheck] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[tasty-quickcheck] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [mLinked component graph:
[2m[tasty-quickcheck] [m    unit tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[tasty-quickcheck] [m        include base-4.19.0.0-b960
[2m[tasty-quickcheck] [m        include optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
[2m[tasty-quickcheck] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[tasty-quickcheck] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-quickcheck] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-quickcheck] [m        Test.Tasty.QuickCheck=tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2:Test.Tasty.QuickCheck
[2m[tasty-quickcheck] [m    unit tasty-quickcheck-0.11-9kP08E8SxWAA1RHeRCIH5o-test
[2m[tasty-quickcheck] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[tasty-quickcheck] [m        include base-4.19.0.0-b960
[2m[tasty-quickcheck] [m        include pcre-light-0.4.1.3-2zuqqUboRiHItQaeLEjH89
[2m[tasty-quickcheck] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-quickcheck] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[tasty-quickcheck] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [mReady component graph:
[2m[tasty-quickcheck] [m    definite tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[tasty-quickcheck] [m        depends base-4.19.0.0-b960
[2m[tasty-quickcheck] [m        depends optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
[2m[tasty-quickcheck] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[tasty-quickcheck] [m        depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-quickcheck] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-quickcheck] [m    definite tasty-quickcheck-0.11-9kP08E8SxWAA1RHeRCIH5o-test
[2m[tasty-quickcheck] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[tasty-quickcheck] [m        depends base-4.19.0.0-b960
[2m[tasty-quickcheck] [m        depends pcre-light-0.4.1.3-2zuqqUboRiHItQaeLEjH89
[2m[tasty-quickcheck] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-quickcheck] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[tasty-quickcheck] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[tasty-quickcheck] [mUsing compiler: ghc-9.8.1
[2m[tasty-quickcheck] [mUsing install prefix:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11
[2m[tasty-quickcheck] [mExecutables installed in:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/bin
[2m[tasty-quickcheck] [mLibraries installed in:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [mDynamic Libraries installed in:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[tasty-quickcheck] [mPrivate executables installed in:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/libexec/x86_64-linux-ghc-9.8.1/tasty-quickcheck-0.11
[2m[tasty-quickcheck] [mData files installed in:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/share/x86_64-linux-ghc-9.8.1/tasty-quickcheck-0.11
[2m[tasty-quickcheck] [mDocumentation installed in:
[2m[tasty-quickcheck] [m/nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc/share/doc/tasty-quickcheck-0.11
[2m[tasty-quickcheck] [mConfiguration files installed in:
[2m[tasty-quickcheck] [m/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/etc
[2m[tasty-quickcheck] [mNo alex found
[2m[tasty-quickcheck] [mUsing ar found on system at:
[2m[tasty-quickcheck] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[tasty-quickcheck] [mNo c2hs found
[2m[tasty-quickcheck] [mNo cpphs found
[2m[tasty-quickcheck] [mNo doctest found
[2m[tasty-quickcheck] [mUsing gcc version 14.3.0 given by user at:
[2m[tasty-quickcheck] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[tasty-quickcheck] [mUsing ghc version 9.8.1 found on system at:
[2m[tasty-quickcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[tasty-quickcheck] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[tasty-quickcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[tasty-quickcheck] [mNo ghcjs found
[2m[tasty-quickcheck] [mNo ghcjs-pkg found
[2m[tasty-quickcheck] [mNo greencard found
[2m[tasty-quickcheck] [mUsing haddock version 2.30.0 found on system at:
[2m[tasty-quickcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[tasty-quickcheck] [mNo happy found
[2m[tasty-quickcheck] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[tasty-quickcheck] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[tasty-quickcheck] [mNo hmake found
[2m[tasty-quickcheck] [mUsing hpc version 0.69 found on system at:
[2m[tasty-quickcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[tasty-quickcheck] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[tasty-quickcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[tasty-quickcheck] [mUsing hscolour version 1.25 found on system at:
[2m[tasty-quickcheck] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[tasty-quickcheck] [mNo jhc found
[2m[tasty-quickcheck] [mUsing ld found on system at:
[2m[tasty-quickcheck] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[tasty-quickcheck] [mNo pkg-config found
[2m[tasty-quickcheck] [mUsing runghc version 9.8.1 found on system at:
[2m[tasty-quickcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[tasty-quickcheck] [mUsing strip version 2.44 found on system at:
[2m[tasty-quickcheck] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[tasty-quickcheck] [mUsing tar found on system at:
[2m[tasty-quickcheck] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[tasty-quickcheck] [mNo uhc found
[2m[tasty-quickcheck] [m[1;36mPhase: buildPhase[m
[2m[wherefrom-compat] [m[1;36mPhase: buildPhase[m
[2m[wl-pprint-annotated] [m[1;36mPhase: buildPhase[m
[2m[syb] [m[1;36mPhase: buildPhase[m
[2m[wherefrom-compat] [mPreprocessing library for wherefrom-compat-0.1.1.1..
[2m[wherefrom-compat] [mBuilding library for wherefrom-compat-0.1.1.1..
[2m[wl-pprint-annotated] [mPreprocessing library for wl-pprint-annotated-0.1.0.1..
[2m[wl-pprint-annotated] [mBuilding library for wl-pprint-annotated-0.1.0.1..
[2m[tasty-quickcheck] [mPreprocessing library for tasty-quickcheck-0.11..
[2m[tasty-quickcheck] [mBuilding library for tasty-quickcheck-0.11..
[2m[syb] [mPreprocessing library for syb-0.7.2.4..
[2m[syb] [mBuilding library for syb-0.7.2.4..
[2m[wherefrom-compat] [m[1 of 1] Compiling GHC.InfoProv.Compat ( src/GHC/InfoProv/Compat.hs, dist/build/GHC/InfoProv/Compat.o, dist/build/GHC/InfoProv/Compat.dyn_o )
[2m[wl-pprint-annotated] [m[1 of 2] Compiling Paths_wl_pprint_annotated ( dist/build/autogen/Paths_wl_pprint_annotated.hs, dist/build/Paths_wl_pprint_annotated.o, dist/build/Paths_wl_pprint_annotated.dyn_o )
[2m[tasty-quickcheck] [m[1 of 1] Compiling Test.Tasty.QuickCheck ( Test/Tasty/QuickCheck.hs, dist/build/Test/Tasty/QuickCheck.o, dist/build/Test/Tasty/QuickCheck.dyn_o )
[2m[syb] [m[ 1 of 16] Compiling Data.Generics.Aliases ( src/Data/Generics/Aliases.hs, dist/build/Data/Generics/Aliases.o, dist/build/Data/Generics/Aliases.dyn_o )
[2m[wherefrom-compat] [m[1 of 1] Compiling GHC.InfoProv.Compat ( src/GHC/InfoProv/Compat.hs, dist/build/GHC/InfoProv/Compat.p_o )
[2m[wl-pprint-annotated] [m[2 of 2] Compiling Text.PrettyPrint.Annotated.WL ( src/Text/PrettyPrint/Annotated/WL.hs, dist/build/Text/PrettyPrint/Annotated/WL.o, dist/build/Text/PrettyPrint/Annotated/WL.dyn_o )
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:141:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    The import of ‘Control.Applicative’ is redundant
[2m[wl-pprint-annotated] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[wl-pprint-annotated] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m141 |[0m[0m [;1m[35mimport Control.Applicative[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:143:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    The import of ‘Data.Semigroup’ is redundant
[2m[wl-pprint-annotated] [m      except perhaps to import instances from ‘Data.Semigroup’
[2m[wl-pprint-annotated] [m    To import instances alone, use: import Data.Semigroup()[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m143 |[0m[0m [;1m[35mimport Data.Semigroup[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:245:35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    Pattern match(es) are non-exhaustive
[2m[wl-pprint-annotated] [m    In a lambda abstraction:
[2m[wl-pprint-annotated] [m        Patterns of type ‘[Doc a]’, ‘Doc a’ not matched: [] _[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m245 |[0m[0m punctuate p xs = snd $ mapAccumL ([;1m[35m\(d:ds) _ -> (ds, if null ds then d else d <> p)[0m[0m) (toList xs) xs
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m                                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:345:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-50928[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monoid-instances[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    Noncanonical ‘mappend’ definition detected
[2m[wl-pprint-annotated] [m    in the instance declaration for ‘Monoid (Doc a)’.
[2m[wl-pprint-annotated] [m    ‘mappend’ will eventually be removed in favour of ‘(<>)’
[2m[wl-pprint-annotated] [m    Suggested fix:
[2m[wl-pprint-annotated] [m      Either remove definition for ‘mappend’ (recommended) or define as ‘mappend = (<>)’
[2m[wl-pprint-annotated] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m345 |[0m[0m   [;1m[35mmappend = Cat[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m   ^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:1062:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    In the use of ‘head’
[2m[wl-pprint-annotated] [m    (imported from Prelude, but defined in GHC.List):
[2m[wl-pprint-annotated] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m1062 |[0m[0m simpleDocScanAnn f r0 = simpleDocMapAnn merge pop (SPushAnn . [;1m[35mhead[0m[0m) (SPopAnn . head) [r0]
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m[;1m[35m                                                               ^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:1062:80: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    In the use of ‘head’
[2m[wl-pprint-annotated] [m    (imported from Prelude, but defined in GHC.List):
[2m[wl-pprint-annotated] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m1062 |[0m[0m simpleDocScanAnn f r0 = simpleDocMapAnn merge pop (SPushAnn . head) (SPopAnn . [;1m[35mhead[0m[0m) [r0]
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m[;1m[35m                                                                                ^^^^[0m[0m
[2m[syb] [m[ 2 of 16] Compiling Data.Generics.Basics ( src/Data/Generics/Basics.hs, dist/build/Data/Generics/Basics.o, dist/build/Data/Generics/Basics.dyn_o )
[2m[syb] [m[ 3 of 16] Compiling Data.Generics.Builders ( src/Data/Generics/Builders.hs, dist/build/Data/Generics/Builders.o, dist/build/Data/Generics/Builders.dyn_o )
[2m[syb] [m[ 4 of 16] Compiling Data.Generics.Instances ( src/Data/Generics/Instances.hs, dist/build/Data/Generics/Instances.o, dist/build/Data/Generics/Instances.dyn_o )
[2m[tasty-quickcheck] [m[1 of 1] Compiling Test.Tasty.QuickCheck ( Test/Tasty/QuickCheck.hs, dist/build/Test/Tasty/QuickCheck.p_o )
[2m[wherefrom-compat] [mPreprocessing test suite 'test' for wherefrom-compat-0.1.1.1..
[2m[wherefrom-compat] [mBuilding test suite 'test' for wherefrom-compat-0.1.1.1..
[2m[syb] [m[ 5 of 16] Compiling Data.Generics.Schemes ( src/Data/Generics/Schemes.hs, dist/build/Data/Generics/Schemes.o, dist/build/Data/Generics/Schemes.dyn_o )
[2m[syb] [m[ 6 of 16] Compiling Data.Generics.Text ( src/Data/Generics/Text.hs, dist/build/Data/Generics/Text.o, dist/build/Data/Generics/Text.dyn_o )
[2m[syb] [m[ 7 of 16] Compiling Data.Generics.Twins ( src/Data/Generics/Twins.hs, dist/build/Data/Generics/Twins.o, dist/build/Data/Generics/Twins.dyn_o )
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:224:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m224 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGT (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:224:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m224 |[0m[0m   perkid a d = (tail a, unGT ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:237:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m237 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGM (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:237:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m237 |[0m[0m   perkid a d = (tail a, unGM ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:249:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m249 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGQ (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:249:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m249 |[0m[0m   perkid a d = (tail a, unGQ ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m[ 8 of 16] Compiling Data.Generics    ( src/Data/Generics.hs, dist/build/Data/Generics.o, dist/build/Data/Generics.dyn_o )
[2m[syb] [m[ 9 of 16] Compiling Generics.SYB     ( src/Generics/SYB.hs, dist/build/Generics/SYB.o, dist/build/Generics/SYB.dyn_o )
[2m[wherefrom-compat] [m[1 of 1] Compiling Main             ( test/Spec.hs, dist/build/test/test-tmp/Main.o )
[2m[syb] [m[10 of 16] Compiling Generics.SYB.Aliases ( src/Generics/SYB/Aliases.hs, dist/build/Generics/SYB/Aliases.o, dist/build/Generics/SYB/Aliases.dyn_o )
[2m[syb] [m[11 of 16] Compiling Generics.SYB.Basics ( src/Generics/SYB/Basics.hs, dist/build/Generics/SYB/Basics.o, dist/build/Generics/SYB/Basics.dyn_o )
[2m[syb] [m[12 of 16] Compiling Generics.SYB.Builders ( src/Generics/SYB/Builders.hs, dist/build/Generics/SYB/Builders.o, dist/build/Generics/SYB/Builders.dyn_o )
[2m[syb] [m[13 of 16] Compiling Generics.SYB.Instances ( src/Generics/SYB/Instances.hs, dist/build/Generics/SYB/Instances.o, dist/build/Generics/SYB/Instances.dyn_o )
[2m[syb] [m[14 of 16] Compiling Generics.SYB.Schemes ( src/Generics/SYB/Schemes.hs, dist/build/Generics/SYB/Schemes.o, dist/build/Generics/SYB/Schemes.dyn_o )
[2m[syb] [m[15 of 16] Compiling Generics.SYB.Text ( src/Generics/SYB/Text.hs, dist/build/Generics/SYB/Text.o, dist/build/Generics/SYB/Text.dyn_o )
[2m[syb] [m[16 of 16] Compiling Generics.SYB.Twins ( src/Generics/SYB/Twins.hs, dist/build/Generics/SYB/Twins.o, dist/build/Generics/SYB/Twins.dyn_o )
[2m[wherefrom-compat] [m[2 of 2] Linking dist/build/test/test
[2m[syb] [m[ 1 of 16] Compiling Data.Generics.Aliases ( src/Data/Generics/Aliases.hs, dist/build/Data/Generics/Aliases.p_o )
[2m[syb] [m[ 2 of 16] Compiling Data.Generics.Basics ( src/Data/Generics/Basics.hs, dist/build/Data/Generics/Basics.p_o )
[2m[syb] [m[ 3 of 16] Compiling Data.Generics.Builders ( src/Data/Generics/Builders.hs, dist/build/Data/Generics/Builders.p_o )
[2m[wl-pprint-annotated] [m[1 of 2] Compiling Paths_wl_pprint_annotated ( dist/build/autogen/Paths_wl_pprint_annotated.hs, dist/build/Paths_wl_pprint_annotated.p_o )
[2m[syb] [m[ 4 of 16] Compiling Data.Generics.Instances ( src/Data/Generics/Instances.hs, dist/build/Data/Generics/Instances.p_o )
[2m[wherefrom-compat] [m[1;36mPhase: checkPhase[m
[2m[wherefrom-compat] [mRunning 1 test suites...
[2m[wherefrom-compat] [mTest suite test: RUNNING...
[2m[wherefrom-compat] [mTests
[2m[wherefrom-compat] [m  whereFrom works: OK
[2m[wherefrom-compat] [m
[2m[wherefrom-compat] [mAll 1 tests passed (0.00s)
[2m[wherefrom-compat] [mTest suite test: PASS
[2m[wherefrom-compat] [mTest suite logged to: dist/test/wherefrom-compat-0.1.1.1-test.log
[2m[wherefrom-compat] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[wherefrom-compat] [m[1;36mPhase: haddockPhase[m
[2m[syb] [m[ 5 of 16] Compiling Data.Generics.Schemes ( src/Data/Generics/Schemes.hs, dist/build/Data/Generics/Schemes.p_o )
[2m[syb] [m[ 6 of 16] Compiling Data.Generics.Text ( src/Data/Generics/Text.hs, dist/build/Data/Generics/Text.p_o )
[2m[syb] [m[ 7 of 16] Compiling Data.Generics.Twins ( src/Data/Generics/Twins.hs, dist/build/Data/Generics/Twins.p_o )
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:224:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m224 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGT (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:224:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m224 |[0m[0m   perkid a d = (tail a, unGT ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:237:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m237 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGM (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:237:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m237 |[0m[0m   perkid a d = (tail a, unGM ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:249:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m249 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGQ (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:249:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m249 |[0m[0m   perkid a d = (tail a, unGQ ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[wl-pprint-annotated] [m[2 of 2] Compiling Text.PrettyPrint.Annotated.WL ( src/Text/PrettyPrint/Annotated/WL.hs, dist/build/Text/PrettyPrint/Annotated/WL.p_o )
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:141:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    The import of ‘Control.Applicative’ is redundant
[2m[wl-pprint-annotated] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[wl-pprint-annotated] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m141 |[0m[0m [;1m[35mimport Control.Applicative[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:143:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    The import of ‘Data.Semigroup’ is redundant
[2m[wl-pprint-annotated] [m      except perhaps to import instances from ‘Data.Semigroup’
[2m[wl-pprint-annotated] [m    To import instances alone, use: import Data.Semigroup()[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m143 |[0m[0m [;1m[35mimport Data.Semigroup[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:245:35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    Pattern match(es) are non-exhaustive
[2m[wl-pprint-annotated] [m    In a lambda abstraction:
[2m[wl-pprint-annotated] [m        Patterns of type ‘[Doc a]’, ‘Doc a’ not matched: [] _[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m245 |[0m[0m punctuate p xs = snd $ mapAccumL ([;1m[35m\(d:ds) _ -> (ds, if null ds then d else d <> p)[0m[0m) (toList xs) xs
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m                                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:345:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-50928[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monoid-instances[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    Noncanonical ‘mappend’ definition detected
[2m[wl-pprint-annotated] [m    in the instance declaration for ‘Monoid (Doc a)’.
[2m[wl-pprint-annotated] [m    ‘mappend’ will eventually be removed in favour of ‘(<>)’
[2m[wl-pprint-annotated] [m    Suggested fix:
[2m[wl-pprint-annotated] [m      Either remove definition for ‘mappend’ (recommended) or define as ‘mappend = (<>)’
[2m[wl-pprint-annotated] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m345 |[0m[0m   [;1m[35mmappend = Cat[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m   ^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:1062:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    In the use of ‘head’
[2m[wl-pprint-annotated] [m    (imported from Prelude, but defined in GHC.List):
[2m[wl-pprint-annotated] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m1062 |[0m[0m simpleDocScanAnn f r0 = simpleDocMapAnn merge pop (SPushAnn . [;1m[35mhead[0m[0m) (SPopAnn . head) [r0]
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m[;1m[35m                                                               ^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:1062:80: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    In the use of ‘head’
[2m[wl-pprint-annotated] [m    (imported from Prelude, but defined in GHC.List):
[2m[wl-pprint-annotated] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m1062 |[0m[0m simpleDocScanAnn f r0 = simpleDocMapAnn merge pop (SPushAnn . head) (SPopAnn . [;1m[35mhead[0m[0m) [r0]
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m[;1m[35m                                                                                ^^^^[0m[0m
[2m[wherefrom-compat] [mPreprocessing library for wherefrom-compat-0.1.1.1..
[2m[wherefrom-compat] [mRunning Haddock on library for wherefrom-compat-0.1.1.1..
[2m[syb] [m[ 8 of 16] Compiling Data.Generics    ( src/Data/Generics.hs, dist/build/Data/Generics.p_o )
[2m[wherefrom-compat] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[wherefrom-compat] [m[1 of 1] Compiling GHC.InfoProv.Compat ( src/GHC/InfoProv/Compat.hs, nothing )
[2m[syb] [m[ 9 of 16] Compiling Generics.SYB     ( src/Generics/SYB.hs, dist/build/Generics/SYB.p_o )
[2m[wherefrom-compat] [mHaddock coverage:
[2m[wherefrom-compat] [m  66% (  2 /  3) in 'GHC.InfoProv.Compat'
[2m[wherefrom-compat] [m  Missing documentation for:
[2m[wherefrom-compat] [m    InfoProv
[2m[tasty-quickcheck] [mPreprocessing test suite 'test' for tasty-quickcheck-0.11..
[2m[tasty-quickcheck] [mBuilding test suite 'test' for tasty-quickcheck-0.11..
[2m[syb] [m[10 of 16] Compiling Generics.SYB.Aliases ( src/Generics/SYB/Aliases.hs, dist/build/Generics/SYB/Aliases.p_o )
[2m[syb] [m[11 of 16] Compiling Generics.SYB.Basics ( src/Generics/SYB/Basics.hs, dist/build/Generics/SYB/Basics.p_o )
[2m[syb] [m[12 of 16] Compiling Generics.SYB.Builders ( src/Generics/SYB/Builders.hs, dist/build/Generics/SYB/Builders.p_o )
[2m[syb] [m[13 of 16] Compiling Generics.SYB.Instances ( src/Generics/SYB/Instances.hs, dist/build/Generics/SYB/Instances.p_o )
[2m[syb] [m[14 of 16] Compiling Generics.SYB.Schemes ( src/Generics/SYB/Schemes.hs, dist/build/Generics/SYB/Schemes.p_o )
[2m[syb] [m[15 of 16] Compiling Generics.SYB.Text ( src/Generics/SYB/Text.hs, dist/build/Generics/SYB/Text.p_o )
[2m[syb] [m[16 of 16] Compiling Generics.SYB.Twins ( src/Generics/SYB/Twins.hs, dist/build/Generics/SYB/Twins.p_o )
[2m[tasty-quickcheck] [m[1 of 1] Compiling Main             ( tests/test.hs, dist/build/test/test-tmp/Main.o )
[2m[tasty-quickcheck] [m
[2m[tasty-quickcheck] [m[;1mtests/test.hs:83:18: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63397[0m[0m[;1m] [[;1m[35m-Wname-shadowing[0m[0m[;1m][0m[0m[;1m
[2m[tasty-quickcheck] [m    This binding for ‘resultDetailsPrinter’ shadows the existing binding
[2m[tasty-quickcheck] [m      bound at tests/test.hs:74:18[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m83 |[0m[0m           Result{[;1m[35m..[0m[0m} <- runReplayWithSeed seedSz $ \x -> x /= (2 :: Int)
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m[;1m[35m                  ^^[0m[0m
[2m[tasty-quickcheck] [m
[2m[tasty-quickcheck] [m[;1mtests/test.hs:83:18: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63397[0m[0m[;1m] [[;1m[35m-Wname-shadowing[0m[0m[;1m][0m[0m[;1m
[2m[tasty-quickcheck] [m    This binding for ‘resultTime’ shadows the existing binding
[2m[tasty-quickcheck] [m      bound at tests/test.hs:74:18[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m83 |[0m[0m           Result{[;1m[35m..[0m[0m} <- runReplayWithSeed seedSz $ \x -> x /= (2 :: Int)
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m[;1m[35m                  ^^[0m[0m
[2m[tasty-quickcheck] [m
[2m[tasty-quickcheck] [m[;1mtests/test.hs:83:18: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63397[0m[0m[;1m] [[;1m[35m-Wname-shadowing[0m[0m[;1m][0m[0m[;1m
[2m[tasty-quickcheck] [m    This binding for ‘resultShortDescription’ shadows the existing binding
[2m[tasty-quickcheck] [m      bound at tests/test.hs:74:18[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m83 |[0m[0m           Result{[;1m[35m..[0m[0m} <- runReplayWithSeed seedSz $ \x -> x /= (2 :: Int)
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m[;1m[35m                  ^^[0m[0m
[2m[tasty-quickcheck] [m
[2m[tasty-quickcheck] [m[;1mtests/test.hs:83:18: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63397[0m[0m[;1m] [[;1m[35m-Wname-shadowing[0m[0m[;1m][0m[0m[;1m
[2m[tasty-quickcheck] [m    This binding for ‘resultDescription’ shadows the existing binding
[2m[tasty-quickcheck] [m      bound at tests/test.hs:74:18[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m83 |[0m[0m           Result{[;1m[35m..[0m[0m} <- runReplayWithSeed seedSz $ \x -> x /= (2 :: Int)
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m[;1m[35m                  ^^[0m[0m
[2m[tasty-quickcheck] [m
[2m[tasty-quickcheck] [m[;1mtests/test.hs:83:18: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63397[0m[0m[;1m] [[;1m[35m-Wname-shadowing[0m[0m[;1m][0m[0m[;1m
[2m[tasty-quickcheck] [m    This binding for ‘resultOutcome’ shadows the existing binding
[2m[tasty-quickcheck] [m      bound at tests/test.hs:74:18[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m
[2m[tasty-quickcheck] [m[;1m[34m83 |[0m[0m           Result{[;1m[35m..[0m[0m} <- runReplayWithSeed seedSz $ \x -> x /= (2 :: Int)
[2m[tasty-quickcheck] [m[;1m[34m   |[0m[0m[;1m[35m                  ^^[0m[0m
[2m[tasty-quickcheck] [m[2 of 2] Linking dist/build/test/test
[2m[syb] [mPreprocessing test suite 'unit-tests' for syb-0.7.2.4..
[2m[syb] [mBuilding test suite 'unit-tests' for syb-0.7.2.4..
[2m[syb] [m[ 1 of 37] Compiling Builders         ( tests/Builders.hs, dist/build/unit-tests/unit-tests-tmp/Builders.o )
[2m[wherefrom-compat] [mDocumentation created: dist/doc/html/wherefrom-compat/,
[2m[wherefrom-compat] [mdist/doc/html/wherefrom-compat/wherefrom-compat.txt
[2m[wherefrom-compat] [mPreprocessing test suite 'test' for wherefrom-compat-0.1.1.1..
[2m[wherefrom-compat] [m[1;36mPhase: installPhase[m
[2m[syb] [m[ 2 of 37] Compiling CompanyDatatypes ( tests/CompanyDatatypes.hs, dist/build/unit-tests/unit-tests-tmp/CompanyDatatypes.o )
[2m[wherefrom-compat] [mInstalling library in /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[tasty-quickcheck] [m[1;36mPhase: checkPhase[m
[2m[tasty-quickcheck] [mRunning 1 test suites...
[2m[tasty-quickcheck] [mTest suite test: RUNNING...
[2m[tasty-quickcheck] [mUnit tests for Test.Tasty.QuickCheck
[2m[tasty-quickcheck] [m  Success:                   OK
[2m[tasty-quickcheck] [m  Success, replay requested: OK
[2m[tasty-quickcheck] [m  Unexpected failure:        OK
[2m[tasty-quickcheck] [m  Replay unexpected failure: OK
[2m[tasty-quickcheck] [m  Gave up:                   OK
[2m[tasty-quickcheck] [m  No expected failure:       OK
[2m[wherefrom-compat] [m[1;36mPhase: fixupPhase[m
[2m[wherefrom-compat] [mshrinking RPATHs of ELF executables and libraries in /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1
[2m[wherefrom-compat] [mshrinking /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSwherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn-ghc9.8.1.so
[2m[wherefrom-compat] [mchecking for references to /build/ in /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1...
[2m[wherefrom-compat] [mpatching script interpreter paths in /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1
[2m[wherefrom-compat] [mstripping (with command strip and flags -S -p) in  /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1/lib
[2m[wherefrom-compat] [mshrinking RPATHs of ELF executables and libraries in /nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc
[2m[wherefrom-compat] [mchecking for references to /build/ in /nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc...
[2m[wherefrom-compat] [mpatching script interpreter paths in /nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc
[2m[wherefrom-compat:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1[m
[2m[wherefrom-compat:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[wherefrom-compat:post-build] [m[2m[m
[2m[wherefrom-compat:post-build] [m[2mPushing /nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc (146.77 KiB)[m
[2m[wherefrom-compat:post-build] [m[2mPushing /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1 (31.36 KiB)[m
[2m[wherefrom-compat:post-build] [m[2m[m
[2m[wherefrom-compat:post-build] [m[2mAll done.[m
[2m[wherefrom-compat:post-build] [m[2mUploading to the NixCI cache: /nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc /nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1[m
[2m[wherefrom-compat:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[wherefrom-compat:post-build] [m[2mcopying 2 paths...[m
[2m[wherefrom-compat:post-build] [m[2mcopying path '/nix/store/5ixpdamlmwa2rzql9syhgsvhmgs781fj-wherefrom-compat-0.1.1.1-doc' to 'https://cache.nix-ci.com'...[m
[2m[wherefrom-compat:post-build] [m[2mcopying path '/nix/store/w5mhasms0slaxxxvw9wgb34lfkqc6wmr-wherefrom-compat-0.1.1.1' to 'https://cache.nix-ci.com'...[m
[2m[wherefrom-compat:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[wherefrom-compat:post-build] [m[2mcopying 1 paths...[m
[2m[wherefrom-compat:post-build] [m[2mcopying path '/nix/store/31gabxsazmdi2qprqh914g394xpzcj5z-wherefrom-compat-0.1.1.1.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 19 of 63 built (3 building)[m
[2m[syb] [m[ 3 of 37] Compiling Bits             ( tests/Bits.hs, dist/build/unit-tests/unit-tests-tmp/Bits.o )
[2m[syb] [m[ 4 of 37] Compiling Datatype         ( tests/Datatype.hs, dist/build/unit-tests/unit-tests-tmp/Datatype.o )
[2m[syb] [m[ 5 of 37] Compiling Encode           ( tests/Encode.hs, dist/build/unit-tests/unit-tests-tmp/Encode.o )
[2m[syb] [m[ 6 of 37] Compiling Ext              ( tests/Ext.hs, dist/build/unit-tests/unit-tests-tmp/Ext.o )
[2m[syb] [m[ 7 of 37] Compiling Ext1             ( tests/Ext1.hs, dist/build/unit-tests/unit-tests-tmp/Ext1.o )
[2m[syb] [m[ 8 of 37] Compiling Ext2             ( tests/Ext2.hs, dist/build/unit-tests/unit-tests-tmp/Ext2.o )
[2m[syb] [m[ 9 of 37] Compiling FoldTree         ( tests/FoldTree.hs, dist/build/unit-tests/unit-tests-tmp/FoldTree.o )
[2m[syb] [m[10 of 37] Compiling FreeNames        ( tests/FreeNames.hs, dist/build/unit-tests/unit-tests-tmp/FreeNames.o )
[2m[syb] [m[11 of 37] Compiling GEq              ( tests/GEq.hs, dist/build/unit-tests/unit-tests-tmp/GEq.o )
[2m[syb] [m[12 of 37] Compiling GMapQAssoc       ( tests/GMapQAssoc.hs, dist/build/unit-tests/unit-tests-tmp/GMapQAssoc.o )
[2m[syb] [m[13 of 37] Compiling GRead            ( tests/GRead.hs, dist/build/unit-tests/unit-tests-tmp/GRead.o )
[2m[syb] [m[14 of 37] Compiling GRead2           ( tests/GRead2.hs, dist/build/unit-tests/unit-tests-tmp/GRead2.o )
[2m[syb] [m[15 of 37] Compiling GShow            ( tests/GShow.hs, dist/build/unit-tests/unit-tests-tmp/GShow.o )
[2m[syb] [m[16 of 37] Compiling GShow2           ( tests/GShow2.hs, dist/build/unit-tests/unit-tests-tmp/GShow2.o )
[2m[syb] [m[17 of 37] Compiling GZip             ( tests/GZip.hs, dist/build/unit-tests/unit-tests-tmp/GZip.o )
[2m[syb] [m[18 of 37] Compiling GenUpTo          ( tests/GenUpTo.hs, dist/build/unit-tests/unit-tests-tmp/GenUpTo.o )
[2m[syb] [m
[2m[syb] [m[;1mtests/GenUpTo.hs:61:42: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m61 |[0m[0m      cons = dataTypeConstrs (dataTypeOf ([;1m[35mhead[0m[0m result))
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m                                          ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1mtests/GenUpTo.hs:78:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m78 |[0m[0m         ty = dataTypeOf ([;1m[35mhead[0m[0m result)
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m                          ^^^^[0m[0m
[2m[syb] [m[19 of 37] Compiling GetC             ( tests/GetC.hs, dist/build/unit-tests/unit-tests-tmp/GetC.o )
[2m[syb] [m[20 of 37] Compiling HList            ( tests/HList.hs, dist/build/unit-tests/unit-tests-tmp/HList.o )
[2m[syb] [m
[2m[syb] [m[;1mtests/HList.hs:40:13: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m40 |[0m[0m tailHList = [;1m[35mtail[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m             ^^^^[0m[0m
[2m[syb] [m[21 of 37] Compiling HOPat            ( tests/HOPat.hs, dist/build/unit-tests/unit-tests-tmp/HOPat.o )
[2m[syb] [m[22 of 37] Compiling Labels           ( tests/Labels.hs, dist/build/unit-tests/unit-tests-tmp/Labels.o )
[2m[syb] [m[23 of 37] Compiling LocalQuantors    ( tests/LocalQuantors.hs, dist/build/unit-tests/unit-tests-tmp/LocalQuantors.o )
[2m[syb] [m[24 of 37] Compiling NestedDatatypes  ( tests/NestedDatatypes.hs, dist/build/unit-tests/unit-tests-tmp/NestedDatatypes.o )
[2m[wl-pprint-annotated] [mPreprocessing test suite 'wl-pprint' for wl-pprint-annotated-0.1.0.1..
[2m[wl-pprint-annotated] [mBuilding test suite 'wl-pprint' for wl-pprint-annotated-0.1.0.1..
[2m[wl-pprint-annotated] [m[1 of 2] Compiling Main             ( test/WLPPrintTests.hs, dist/build/wl-pprint/wl-pprint-tmp/Main.o )
[2m[wl-pprint-annotated] [m[2 of 2] Compiling Paths_wl_pprint_annotated ( dist/build/wl-pprint/autogen/Paths_wl_pprint_annotated.hs, dist/build/wl-pprint/wl-pprint-tmp/Paths_wl_pprint_annotated.o )
[2m[wl-pprint-annotated] [m[3 of 3] Linking dist/build/wl-pprint/wl-pprint
[2m[wl-pprint-annotated] [m[1;36mPhase: checkPhase[m
[2m[wl-pprint-annotated] [mRunning 1 test suites...
[2m[wl-pprint-annotated] [mTest suite wl-pprint: RUNNING...
[2m[wl-pprint-annotated] [mTests
[2m[wl-pprint-annotated] [m  Tests for each data constructor
[2m[wl-pprint-annotated] [m    Empty tests:         OK
[2m[wl-pprint-annotated] [m    Char tests:          OK
[2m[wl-pprint-annotated] [m    Text tests:          OK
[2m[wl-pprint-annotated] [m    Line tests:          OK
[2m[wl-pprint-annotated] [m    FlatAlt tests:       OK
[2m[wl-pprint-annotated] [m    Cat tests:           OK
[2m[wl-pprint-annotated] [m    Nest tests:          OK
[2m[wl-pprint-annotated] [m    Union tests:         OK
[2m[wl-pprint-annotated] [m    Column tests:        OK
[2m[wl-pprint-annotated] [m    Nesting tests:       OK
[2m[wl-pprint-annotated] [m    Columns tests:       OK
[2m[wl-pprint-annotated] [m    Ribbon tests:        OK
[2m[wl-pprint-annotated] [m  Tests for some combinators
[2m[wl-pprint-annotated] [m    @list@ tests:        OK
[2m[wl-pprint-annotated] [m    @tupled@ tests:      OK
[2m[wl-pprint-annotated] [m  Tests for the formatting algorithms
[2m[wl-pprint-annotated] [m    @renderPretty@ test: OK
[2m[wl-pprint-annotated] [m    @renderSmart@ test:  OK
[2m[wl-pprint-annotated] [m  Tests for the code examples in the documentation
[2m[wl-pprint-annotated] [m    @fill@ test:         OK
[2m[wl-pprint-annotated] [m    @fillBreak@ test:    OK
[2m[wl-pprint-annotated] [m    @hang@ test:         OK
[2m[wl-pprint-annotated] [m    @align@ test:        OK
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [mAll 20 tests passed (0.01s)
[2m[wl-pprint-annotated] [mTest suite wl-pprint: PASS
[2m[wl-pprint-annotated] [mTest suite logged to: dist/test/wl-pprint-annotated-0.1.0.1-wl-pprint.log
[2m[wl-pprint-annotated] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[wl-pprint-annotated] [m[1;36mPhase: haddockPhase[m
[2m[wl-pprint-annotated] [mPreprocessing library for wl-pprint-annotated-0.1.0.1..
[2m[wl-pprint-annotated] [mRunning Haddock on library for wl-pprint-annotated-0.1.0.1..
[2m[wl-pprint-annotated] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[wl-pprint-annotated] [m[1 of 2] Compiling Paths_wl_pprint_annotated ( dist/build/autogen/Paths_wl_pprint_annotated.hs, nothing )
[2m[wl-pprint-annotated] [m[2 of 2] Compiling Text.PrettyPrint.Annotated.WL ( src/Text/PrettyPrint/Annotated/WL.hs, nothing )
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:141:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    The import of ‘Control.Applicative’ is redundant
[2m[wl-pprint-annotated] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[wl-pprint-annotated] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m141 |[0m[0m [;1m[35mimport Control.Applicative[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:143:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    The import of ‘Data.Semigroup’ is redundant
[2m[wl-pprint-annotated] [m      except perhaps to import instances from ‘Data.Semigroup’
[2m[wl-pprint-annotated] [m    To import instances alone, use: import Data.Semigroup()[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m143 |[0m[0m [;1m[35mimport Data.Semigroup[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:345:3: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-50928[0m[0m[;1m] [[;1m[35m-Wnoncanonical-monoid-instances[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    Noncanonical ‘mappend’ definition detected
[2m[wl-pprint-annotated] [m    in the instance declaration for ‘Monoid (Doc a)’.
[2m[wl-pprint-annotated] [m    ‘mappend’ will eventually be removed in favour of ‘(<>)’
[2m[wl-pprint-annotated] [m    Suggested fix:
[2m[wl-pprint-annotated] [m      Either remove definition for ‘mappend’ (recommended) or define as ‘mappend = (<>)’
[2m[wl-pprint-annotated] [m      See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m345 |[0m[0m   [;1m[35mmappend = Cat[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m    |[0m[0m[;1m[35m   ^^^^^^^^^^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:1062:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    In the use of ‘head’
[2m[wl-pprint-annotated] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m[25 of 37] Compiling Newtype          ( tests/Newtype.hs, dist/build/unit-tests/unit-tests-tmp/Newtype.o )
[2m[syb] [m[26 of 37] Compiling Paradise         ( tests/Paradise.hs, dist/build/unit-tests/unit-tests-tmp/Paradise.o )
[2m[syb] [m[27 of 37] Compiling Perm             ( tests/Perm.hs, dist/build/unit-tests/unit-tests-tmp/Perm.o )
[2m[syb] [m
[2m[syb] [m[;1mtests/Perm.hs:47:36: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m47 |[0m[0m                         else Just ([;1m[35mtail[0m[0m x, head x)
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m                                    ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1mtests/Perm.hs:47:44: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m47 |[0m[0m                         else Just (tail x, [;1m[35mhead[0m[0m x)
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m                                            ^^^^[0m[0m
[2m[syb] [m[28 of 37] Compiling Polymatch        ( tests/Polymatch.hs, dist/build/unit-tests/unit-tests-tmp/Polymatch.o )
[2m[syb] [m[29 of 37] Compiling Reify            ( tests/Reify.hs, dist/build/unit-tests/unit-tests-tmp/Reify.o )
[2m[syb] [m[30 of 37] Compiling Strings          ( tests/Strings.hs, dist/build/unit-tests/unit-tests-tmp/Strings.o )
[2m[syb] [m[31 of 37] Compiling Tree             ( tests/Tree.hs, dist/build/unit-tests/unit-tests-tmp/Tree.o )
[2m[syb] [m
[2m[syb] [m[;1mtests/Tree.hs:49:28: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m49 |[0m[0m         perkid ts = const ([;1m[35mtail[0m[0m ts, tree2data (head ts))
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m                            ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1mtests/Tree.hs:49:48: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m   |[0m[0m
[2m[syb] [m[;1m[34m49 |[0m[0m         perkid ts = const (tail ts, tree2data ([;1m[35mhead[0m[0m ts))
[2m[syb] [m[;1m[34m   |[0m[0m[;1m[35m                                                ^^^^[0m[0m
[2m[syb] [m[32 of 37] Compiling Twin             ( tests/Twin.hs, dist/build/unit-tests/unit-tests-tmp/Twin.o )
[2m[syb] [m[33 of 37] Compiling Typecase1        ( tests/Typecase1.hs, dist/build/unit-tests/unit-tests-tmp/Typecase1.o )
[2m[syb] [m[34 of 37] Compiling Typecase2        ( tests/Typecase2.hs, dist/build/unit-tests/unit-tests-tmp/Typecase2.o )
[2m[syb] [m[35 of 37] Compiling Where            ( tests/Where.hs, dist/build/unit-tests/unit-tests-tmp/Where.o )
[2m[syb] [m[36 of 37] Compiling XML              ( tests/XML.hs, dist/build/unit-tests/unit-tests-tmp/XML.o )
[2m[syb] [m
[2m[syb] [m[;1mtests/XML.hs:159:36: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[wl-pprint-annotated] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m1062 |[0m[0m simpleDocScanAnn f r0 = simpleDocMapAnn merge pop (SPushAnn . [;1m[35mhead[0m[0m) (SPopAnn . head) [r0]
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m[;1m[35m                                                               ^^^^[0m[0m
[2m[wl-pprint-annotated] [m
[2m[wl-pprint-annotated] [m[;1msrc/Text/PrettyPrint/Annotated/WL.hs:1062:80: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[wl-pprint-annotated] [m    In the use of ‘head’
[2m[wl-pprint-annotated] [m    (imported from Prelude, but defined in GHC.List):
[2m[wl-pprint-annotated] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m
[2m[wl-pprint-annotated] [m[;1m[34m1062 |[0m[0m simpleDocScanAnn f r0 = simpleDocMapAnn merge pop (SPushAnn . head) (SPopAnn . [;1m[35mhead[0m[0m) [r0]
[2m[wl-pprint-annotated] [m[;1m[34m     |[0m[0m[;1m[35m                                                                                ^^^^[0m[0m
[2m[wl-pprint-annotated] [mHaddock coverage:
[2m[wl-pprint-annotated] [mWarning: 'empty' is ambiguous. It is defined
[2m[wl-pprint-annotated] [m    * in ‘GHC.Base’
[2m[wl-pprint-annotated] [m    * in ‘Data.Text.Internal’
[2m[wl-pprint-annotated] [m    * in ‘Data.Text.Internal.Lazy’
[2m[wl-pprint-annotated] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[wl-pprint-annotated] [m    by specifying the type/value namespace explicitly.
[2m[wl-pprint-annotated] [m    Defaulting to the one defined in ‘Data.Text.Internal.Lazy’
[2m[wl-pprint-annotated] [mWarning: 'group' is ambiguous. It is defined
[2m[wl-pprint-annotated] [m    * in ‘Data.Text’
[2m[wl-pprint-annotated] [m    * in ‘Data.Text.Lazy’
[2m[wl-pprint-annotated] [m    * at src/Text/PrettyPrint/Annotated/WL.hs:831:1
[2m[wl-pprint-annotated] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[wl-pprint-annotated] [m    by specifying the type/value namespace explicitly.
[2m[wl-pprint-annotated] [m    Defaulting to the one defined at src/Text/PrettyPrint/Annotated/WL.hs:831:1
[2m[wl-pprint-annotated] [mWarning: 'Text' is ambiguous. It is defined
[2m[wl-pprint-annotated] [m    * in ‘Data.Text.Internal’
[2m[wl-pprint-annotated] [m    * in ‘Data.Text.Internal.Lazy’
[2m[wl-pprint-annotated] [m    * at src/Text/PrettyPrint/Annotated/WL.hs:725:5
[2m[wl-pprint-annotated] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[wl-pprint-annotated] [m    by specifying the type/value namespace explicitly.
[2m[wl-pprint-annotated] [m    Defaulting to the one defined at src/Text/PrettyPrint/Annotated/WL.hs:725:5
[2m[wl-pprint-annotated] [m  90% ( 91 /101) in 'Text.PrettyPrint.Annotated.WL'
[2m[wl-pprint-annotated] [m  Missing documentation for:
[2m[wl-pprint-annotated] [m    flatten (src/Text/PrettyPrint/Annotated/WL.hs:840)
[2m[wl-pprint-annotated] [m    docMapAnn (src/Text/PrettyPrint/Annotated/WL.hs:494)
[2m[wl-pprint-annotated] [m    simpleDocMapAnn (src/Text/PrettyPrint/Annotated/WL.hs:1049)
[2m[wl-pprint-annotated] [m    simpleDocScanAnn (src/Text/PrettyPrint/Annotated/WL.hs:1062)
[2m[wl-pprint-annotated] [m    <+> (src/Text/PrettyPrint/Annotated/WL.hs:172)
[2m[wl-pprint-annotated] [m    column (src/Text/PrettyPrint/Annotated/WL.hs:816)
[2m[wl-pprint-annotated] [m    nesting (src/Text/PrettyPrint/Annotated/WL.hs:817)
[2m[wl-pprint-annotated] [m    width (src/Text/PrettyPrint/Annotated/WL.hs:638)
[2m[wl-pprint-annotated] [m    columns (src/Text/PrettyPrint/Annotated/WL.hs:820)
[2m[wl-pprint-annotated] [m    ribbon (src/Text/PrettyPrint/Annotated/WL.hs:823)
[2m[wl-pprint-annotated] [mWarning: Text.PrettyPrint.Annotated.WL: could not find link destinations for: 
[2m[wl-pprint-annotated] [m	- Text.PrettyPrint.Annotated.WL.Rep_SimpleDoc
[2m[wl-pprint-annotated] [m	- Text.PrettyPrint.Annotated.WL.Rep_Doc
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m159 |[0m[0m                         else Just ([;1m[35mtail[0m[0m x, head x)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                                    ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1mtests/XML.hs:159:44: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m159 |[0m[0m                         else Just (tail x, [;1m[35mhead[0m[0m x)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                                            ^^^^[0m[0m
[2m[syb] [m[37 of 37] Compiling Main             ( tests/Main.hs, dist/build/unit-tests/unit-tests-tmp/Main.o )
[2m[syb] [m[38 of 38] Linking dist/build/unit-tests/unit-tests
[2m[syb] [m[1;36mPhase: checkPhase[m
[2m[syb] [mRunning 1 test suites...
[2m[syb] [mTest suite unit-tests: RUNNING...
[2m[syb] [mAll
[2m[syb] [m  Datatype:   OK
[2m[syb] [m  FoldTree:   OK
[2m[syb] [m  GetC:       OK
[2m[syb] [m  GMapQAssoc: OK
[2m[syb] [m  GRead:      OK
[2m[syb] [m  GShow:      OK
[2m[syb] [m  GShow2:     OK
[2m[syb] [m  HList:      OK
[2m[syb] [m  HOPat:      OK
[2m[syb] [m  Labels:     OK
[2m[syb] [m  Newtype:    OK
[2m[syb] [m  Perm:       OK
[2m[syb] [m  Twin:       OK
[2m[syb] [m  Typecase1:  OK
[2m[syb] [m  Typecase2:  OK
[2m[syb] [m  Where:      OK
[2m[syb] [m  XML:        OK
[2m[syb] [m  Tree:       OK
[2m[syb] [m  Strings:    OK
[2m[syb] [m  Reify:      OK
[2m[syb] [m  Paradise:   OK
[2m[syb] [m  GZip:       OK
[2m[syb] [m  GEq:        OK
[2m[syb] [m  GenUpTo:    OK
[2m[syb] [m  FreeNames:  OK
[2m[syb] [m  Ext1:       OK
[2m[syb] [m  Ext2:       OK
[2m[syb] [m  Bits:       OK (0.04s)
[2m[syb] [m  Builders:   OK
[2m[syb] [m
[2m[syb] [mAll 29 tests passed (0.04s)
[2m[syb] [mTest suite unit-tests: PASS
[2m[syb] [mTest suite logged to: dist/test/syb-0.7.2.4-unit-tests.log
[2m[syb] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[syb] [m[1;36mPhase: haddockPhase[m
[2m[syb] [mPreprocessing library for syb-0.7.2.4..
[2m[syb] [mRunning Haddock on library for syb-0.7.2.4..
[2m[syb] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[syb] [m[ 1 of 16] Compiling Data.Generics.Aliases ( src/Data/Generics/Aliases.hs, nothing )
[2m[syb] [m[ 2 of 16] Compiling Data.Generics.Basics ( src/Data/Generics/Basics.hs, nothing )
[2m[syb] [m[ 3 of 16] Compiling Data.Generics.Builders ( src/Data/Generics/Builders.hs, nothing )
[2m[syb] [m[ 4 of 16] Compiling Data.Generics.Instances ( src/Data/Generics/Instances.hs, nothing )
[2m[syb] [m[ 5 of 16] Compiling Data.Generics.Schemes ( src/Data/Generics/Schemes.hs, nothing )
[2m[syb] [m[ 6 of 16] Compiling Data.Generics.Text ( src/Data/Generics/Text.hs, nothing )
[2m[syb] [m[ 7 of 16] Compiling Data.Generics.Twins ( src/Data/Generics/Twins.hs, nothing )
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:224:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m224 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGT (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:224:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m224 |[0m[0m   perkid a d = (tail a, unGT ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:237:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m237 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGM (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:237:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m237 |[0m[0m   perkid a d = (tail a, unGM ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:249:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘tail’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m249 |[0m[0m   perkid a d = ([;1m[35mtail[0m[0m a, unGQ (head a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[syb] [m
[2m[syb] [m[;1msrc/Data/Generics/Twins.hs:249:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[syb] [m    In the use of ‘head’
[2m[syb] [m    (imported from Prelude, but defined in GHC.List):
[2m[syb] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[syb] [m[;1m[34m    |[0m[0m
[2m[syb] [m[;1m[34m249 |[0m[0m   perkid a d = (tail a, unGQ ([;1m[35mhead[0m[0m a) d)
[2m[syb] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[syb] [m[ 8 of 16] Compiling Data.Generics    ( src/Data/Generics.hs, nothing )
[2m[syb] [m[ 9 of 16] Compiling Generics.SYB     ( src/Generics/SYB.hs, nothing )
[2m[syb] [m[10 of 16] Compiling Generics.SYB.Aliases ( src/Generics/SYB/Aliases.hs, nothing )
[2m[syb] [m[11 of 16] Compiling Generics.SYB.Basics ( src/Generics/SYB/Basics.hs, nothing )
[2m[syb] [m[12 of 16] Compiling Generics.SYB.Builders ( src/Generics/SYB/Builders.hs, nothing )
[2m[syb] [m[13 of 16] Compiling Generics.SYB.Instances ( src/Generics/SYB/Instances.hs, nothing )
[2m[syb] [m[14 of 16] Compiling Generics.SYB.Schemes ( src/Generics/SYB/Schemes.hs, nothing )
[2m[syb] [m[15 of 16] Compiling Generics.SYB.Text ( src/Generics/SYB/Text.hs, nothing )
[2m[syb] [m[16 of 16] Compiling Generics.SYB.Twins ( src/Generics/SYB/Twins.hs, nothing )
[2m[syb] [mHaddock coverage:
[2m[syb] [mWarning: 'Generic'' is ambiguous. It is defined
[2m[syb] [m    * at src/Data/Generics/Aliases.hs:510:19
[2m[syb] [m    * at src/Data/Generics/Aliases.hs:510:1
[2m[syb] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[syb] [m    by specifying the type/value namespace explicitly.
[2m[syb] [m    Defaulting to the one defined at src/Data/Generics/Aliases.hs:510:1
[2m[syb] [m 100% ( 60 / 60) in 'Data.Generics.Aliases'
[2m[syb] [m 100% (  2 /  2) in 'Data.Generics.Basics'
[2m[syb] [m 100% (  3 /  3) in 'Data.Generics.Builders'
[2m[syb] [m 100% (  1 /  1) in 'Data.Generics.Instances'
[2m[syb] [m 100% ( 19 / 19) in 'Data.Generics.Schemes'
[2m[syb] [m 100% (  6 /  6) in 'Data.Generics.Text'
[2m[syb] [m 100% ( 17 / 17) in 'Data.Generics.Twins'
[2m[syb] [m 100% (  8 /  8) in 'Data.Generics'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB.Aliases'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB.Basics'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB.Builders'
[2m[syb] [m 100% (  1 /  1) in 'Generics.SYB.Instances'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB.Schemes'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB.Text'
[2m[syb] [m 100% (  2 /  2) in 'Generics.SYB.Twins'
[2m[wl-pprint-annotated] [mDocumentation created: dist/doc/html/wl-pprint-annotated/,
[2m[wl-pprint-annotated] [mdist/doc/html/wl-pprint-annotated/wl-pprint-annotated.txt
[2m[wl-pprint-annotated] [mPreprocessing test suite 'wl-pprint' for wl-pprint-annotated-0.1.0.1..
[2m[wl-pprint-annotated] [m[1;36mPhase: installPhase[m
[2m[wl-pprint-annotated] [mInstalling library in /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[syb] [mDocumentation created: dist/doc/html/syb/, dist/doc/html/syb/syb.txt
[2m[syb] [mPreprocessing test suite 'unit-tests' for syb-0.7.2.4..
[2m[syb] [m[1;36mPhase: installPhase[m
[2m[wl-pprint-annotated] [m[1;36mPhase: fixupPhase[m
[2m[wl-pprint-annotated] [mshrinking RPATHs of ELF executables and libraries in /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1
[2m[wl-pprint-annotated] [mshrinking /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSwl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3-ghc9.8.1.so
[2m[syb] [mInstalling library in /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
[2m[wl-pprint-annotated] [mchecking for references to /build/ in /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1...
[2m[wl-pprint-annotated] [mpatching script interpreter paths in /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1
[2m[wl-pprint-annotated] [mstripping (with command strip and flags -S -p) in  /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/lib
[2m[wl-pprint-annotated] [mshrinking RPATHs of ELF executables and libraries in /nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc
[2m[wl-pprint-annotated] [mchecking for references to /build/ in /nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc...
[2m[wl-pprint-annotated] [mpatching script interpreter paths in /nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc
[2m[wl-pprint-annotated:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1 /nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc[m
[2m[wl-pprint-annotated:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[wl-pprint-annotated:post-build] [m[2m[m
[2m[wl-pprint-annotated:post-build] [m[2mPushing /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1 (3.23 MiB)[m
[2m[wl-pprint-annotated:post-build] [m[2mPushing /nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc (1.16 MiB)[m
[2m[wl-pprint-annotated:post-build] [m[2m[m
[2m[wl-pprint-annotated:post-build] [m[2mAll done.[m
[2m[wl-pprint-annotated:post-build] [m[2mUploading to the NixCI cache: /nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1 /nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc[m
[2m[wl-pprint-annotated:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[wl-pprint-annotated:post-build] [m[2mcopying 2 paths...[m
[2m[wl-pprint-annotated:post-build] [m[2mcopying path '/nix/store/prxn3n9mq7w9x3kam290zzwk2f0ir8jj-wl-pprint-annotated-0.1.0.1-doc' to 'https://cache.nix-ci.com'...[m
[2m[wl-pprint-annotated:post-build] [m[2mcopying path '/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1' to 'https://cache.nix-ci.com'...[m
[2m[wl-pprint-annotated:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[wl-pprint-annotated:post-build] [m[2mcopying 1 paths...[m
[2m[wl-pprint-annotated:post-build] [m[2mcopying path '/nix/store/mi7f2j158zasc25kavjp2v10q5ipw78z-wl-pprint-annotated-0.1.0.1.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 20 of 63 built (2 building)[m
[2m[syb] [m[1;36mPhase: fixupPhase[m
[2m[syb] [mshrinking RPATHs of ELF executables and libraries in /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4
[2m[syb] [mshrinking /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSsyb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI-ghc9.8.1.so
[2m[syb] [mchecking for references to /build/ in /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4...
[2m[syb] [mpatching script interpreter paths in /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4
[2m[syb] [mstripping (with command strip and flags -S -p) in  /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4/lib
[2m[syb] [mshrinking RPATHs of ELF executables and libraries in /nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc
[2m[syb] [mchecking for references to /build/ in /nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc...
[2m[syb] [mpatching script interpreter paths in /nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc
[2m[tasty-quickcheck] [m  Percent Complete:          OK (10.87s)
[2m[tasty-quickcheck] [m    +++ OK, passed 1000 tests.
[2m[tasty-quickcheck] [m
[2m[tasty-quickcheck] [mAll 7 tests passed (10.87s)
[2m[tasty-quickcheck] [mTest suite test: PASS
[2m[tasty-quickcheck] [mTest suite logged to: dist/test/tasty-quickcheck-0.11-test.log
[2m[tasty-quickcheck] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[tasty-quickcheck] [m[1;36mPhase: haddockPhase[m
[2m[tasty-quickcheck] [mPreprocessing library for tasty-quickcheck-0.11..
[2m[tasty-quickcheck] [mRunning Haddock on library for tasty-quickcheck-0.11..
[2m[tasty-quickcheck] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[tasty-quickcheck] [m[1 of 1] Compiling Test.Tasty.QuickCheck ( Test/Tasty/QuickCheck.hs, nothing )
[2m[tasty-quickcheck] [mHaddock coverage:
[2m[tasty-quickcheck] [m  96% (185 /191) in 'Test.Tasty.QuickCheck'
[2m[tasty-quickcheck] [m  Missing documentation for:
[2m[tasty-quickcheck] [m    arbitrary1
[2m[tasty-quickcheck] [m    shrink1
[2m[tasty-quickcheck] [m    arbitrary2
[2m[tasty-quickcheck] [m    shrink2
[2m[tasty-quickcheck] [m    ShrinkState
[2m[tasty-quickcheck] [m    QC (Test/Tasty/QuickCheck.hs:63)
[2m[tasty-quickcheck] [mWarning: Test.Tasty.QuickCheck: could not find link destinations for: 
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Exception.AnException
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Random.QCGen
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Property.Result
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Property.Prop
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Arbitrary.GCoArbitrary
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Function.GFunction
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Function.Shrunk
[2m[tasty-quickcheck] [m	- Test.QuickCheck.Modifiers.InfiniteListInternalData
[2m[tasty-quickcheck] [mDocumentation created: dist/doc/html/tasty-quickcheck/,
[2m[tasty-quickcheck] [mdist/doc/html/tasty-quickcheck/tasty-quickcheck.txt
[2m[tasty-quickcheck] [mPreprocessing test suite 'test' for tasty-quickcheck-0.11..
[2m[tasty-quickcheck] [m[1;36mPhase: installPhase[m
[2m[tasty-quickcheck] [mInstalling library in /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[tasty-quickcheck] [m[1;36mPhase: fixupPhase[m
[2m[tasty-quickcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11
[2m[tasty-quickcheck] [mshrinking /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2-ghc9.8.1.so
[2m[tasty-quickcheck] [mchecking for references to /build/ in /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11...
[2m[tasty-quickcheck] [mpatching script interpreter paths in /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11
[2m[tasty-quickcheck] [mstripping (with command strip and flags -S -p) in  /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11/lib
[2m[tasty-quickcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc
[2m[tasty-quickcheck] [mchecking for references to /build/ in /nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc...
[2m[tasty-quickcheck] [mpatching script interpreter paths in /nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc
[2m[syb:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4[m
[2m[syb:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[syb:post-build] [m[2m[m
[2m[syb:post-build] [m[2mPushing /nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc (1.19 MiB)[m
[2m[syb:post-build] [m[2mPushing /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4 (2.81 MiB)[m
[2m[syb:post-build] [m[2m[m
[2m[syb:post-build] [m[2mAll done.[m
[2m[syb:post-build] [m[2mUploading to the NixCI cache: /nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc /nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4[m
[2m[syb:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[syb:post-build] [m[2mcopying 2 paths...[m
[2m[syb:post-build] [m[2mcopying path '/nix/store/146ikcyrmsan1ghi97s77bl83772rvfj-syb-0.7.2.4-doc' to 'https://cache.nix-ci.com'...[m
[2m[syb:post-build] [m[2mcopying path '/nix/store/i9hrsqwq8nwv4qdxbjcsh4a88n6r1a31-syb-0.7.2.4' to 'https://cache.nix-ci.com'...[m
[2m[syb:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[syb:post-build] [m[2mcopying 1 paths...[m
[2m[syb:post-build] [m[2mcopying path '/nix/store/cd1ry03s337cjw2hw21l3b85nyab4nrn-syb-0.7.2.4.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 21 of 63 built (1 building)[m
[2m[tasty-quickcheck:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11 /nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc[m
[2m[tasty-quickcheck:post-build] [m[2mPushing 2 paths (91 are already present) using zstd to cache sellout ⏳[m
[2m[tasty-quickcheck:post-build] [m[2m[m
[2m[tasty-quickcheck:post-build] [m[2mPushing /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11 (734.43 KiB)[m
[2m[tasty-quickcheck:post-build] [m[2mPushing /nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc (1.79 MiB)[m
[2m[tasty-quickcheck:post-build] [m[2m[m
[2m[tasty-quickcheck:post-build] [m[2mAll done.[m
[2m[tasty-quickcheck:post-build] [m[2mUploading to the NixCI cache: /nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11 /nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc[m
[2m[tasty-quickcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[tasty-quickcheck:post-build] [m[2mcopying 2 paths...[m
[2m[tasty-quickcheck:post-build] [m[2mcopying path '/nix/store/jiwyi99f94k73qa5c5xgwl6lkgjhhl3g-tasty-quickcheck-0.11-doc' to 'https://cache.nix-ci.com'...[m
[2m[tasty-quickcheck:post-build] [m[2mcopying path '/nix/store/5pkm6f5iihpn028h17asdfh6p43d7z45-tasty-quickcheck-0.11' to 'https://cache.nix-ci.com'...[m
[2m[tasty-quickcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[tasty-quickcheck:post-build] [m[2mcopying 1 paths...[m
[2m[tasty-quickcheck:post-build] [m[2mcopying path '/nix/store/5x143i0gr2cgah8vi0vpd3imk23hiiq1-tasty-quickcheck-0.11.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 22 of 64 built[m
[33mWaiting for lock on ChasingBottoms-1.3.1.15-doc[m
[33mWaiting for lock on doctest[m
[1;34mBuilding /nix/store/ajja3vaacdpw7sc22j3clxv3pwqksff1-barbies-2.1.1.0.drv[m
[2m[barbies] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[barbies] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[barbies] [m[1;36mPhase: unpackPhase[m
[2m[barbies] [munpacking source archive /nix/store/h95z7v6r0ic5fspf4rjlk5g8am9n3wi9-barbies-2.1.1.0.tar.gz
[2m[barbies] [msource root is barbies-2.1.1.0
[2m[barbies] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "barbies-2.1.1.0/test/TestBiBarbies.hs"
[2m[barbies] [m[1;36mPhase: patchPhase[m
[2m[barbies] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[barbies] [msetupCompileFlags: -package-db=/build/tmp.Ejnn8xivLX/setup-package.conf.d -threaded
[2m[barbies] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.Ejnn8xivLX/Main.o )
[2m[barbies] [m[2 of 2] Linking Setup
[2m[barbies] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[barbies] [m[1;36mPhase: configurePhase[m
[2m[barbies] [mconfigureFlags: --verbose --prefix=/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc/share/doc/barbies-2.1.1.0 --with-gcc=gcc --package-db=/build/tmp.Ejnn8xivLX/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[barbies] [mUsing Parsec parser
[2m[barbies] [mConfiguring barbies-2.1.1.0...
[2m[barbies] [mDependency base >=4.11 && <5: using base-4.19.0.0
[2m[barbies] [mDependency distributive: using distributive-0.6.2.1
[2m[barbies] [mDependency transformers: using transformers-0.6.1.0
[2m[barbies] [mDependency QuickCheck: using QuickCheck-2.14.3
[2m[barbies] [mDependency barbies: using barbies-2.1.1.0
[2m[barbies] [mDependency base >=4.7 && <5: using base-4.19.0.0
[2m[barbies] [mDependency distributive: using distributive-0.6.2.1
[2m[barbies] [mDependency tasty: using tasty-1.5.3
[2m[barbies] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[barbies] [mDependency tasty-quickcheck: using tasty-quickcheck-0.11
[2m[barbies] [mSource component graph:
[2m[barbies] [m    component lib
[2m[barbies] [m    component test:barbies-test dependency lib
[2m[barbies] [mConfigured component graph:
[2m[barbies] [m    component barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m        include base-4.19.0.0-b960
[2m[barbies] [m        include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[barbies] [m        include transformers-0.6.1.0-c3ec
[2m[barbies] [m    component barbies-2.1.1.0-FssYoEdg3sS9b6U8jXMhIA-barbies-test
[2m[barbies] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[barbies] [m        include barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m        include base-4.19.0.0-b960
[2m[barbies] [m        include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[barbies] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[barbies] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[barbies] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[barbies] [mLinked component graph:
[2m[barbies] [m    unit barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m        include base-4.19.0.0-b960
[2m[barbies] [m        include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[barbies] [m        include transformers-0.6.1.0-c3ec
[2m[barbies] [m        Barbies=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Barbies,Barbies.Bare=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Barbies.Bare,Barbies.Bi=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Barbies.Bi,Barbies.Constraints=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Barbies.Constraints,Barbies.Internal=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Barbies.Internal,Data.Functor.Barbie=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Data.Functor.Barbie,Data.Functor.Transformer=barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1:Data.Functor.Transformer
[2m[barbies] [m    unit barbies-2.1.1.0-FssYoEdg3sS9b6U8jXMhIA-barbies-test
[2m[barbies] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[barbies] [m        include barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m        include base-4.19.0.0-b960
[2m[barbies] [m        include distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[barbies] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[barbies] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[barbies] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[barbies] [mReady component graph:
[2m[barbies] [m    definite barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m        depends base-4.19.0.0-b960
[2m[barbies] [m        depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[barbies] [m        depends transformers-0.6.1.0-c3ec
[2m[barbies] [m    definite barbies-2.1.1.0-FssYoEdg3sS9b6U8jXMhIA-barbies-test
[2m[barbies] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[barbies] [m        depends barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m        depends base-4.19.0.0-b960
[2m[barbies] [m        depends distributive-0.6.2.1-Bqfb3YLruMhEWQ5REpvzf4
[2m[barbies] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[barbies] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[barbies] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[barbies] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[barbies] [mUsing compiler: ghc-9.8.1
[2m[barbies] [mUsing install prefix:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0
[2m[barbies] [mExecutables installed in:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/bin
[2m[barbies] [mLibraries installed in:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [mDynamic Libraries installed in:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[barbies] [mPrivate executables installed in:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/libexec/x86_64-linux-ghc-9.8.1/barbies-2.1.1.0
[2m[barbies] [mData files installed in:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/share/x86_64-linux-ghc-9.8.1/barbies-2.1.1.0
[2m[barbies] [mDocumentation installed in:
[2m[barbies] [m/nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc/share/doc/barbies-2.1.1.0
[2m[barbies] [mConfiguration files installed in:
[2m[barbies] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/etc
[2m[barbies] [mNo alex found
[2m[barbies] [mUsing ar found on system at:
[2m[barbies] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[barbies] [mNo c2hs found
[2m[barbies] [mNo cpphs found
[2m[barbies] [mNo doctest found
[2m[barbies] [mUsing gcc version 14.3.0 given by user at:
[2m[barbies] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[barbies] [mUsing ghc version 9.8.1 found on system at:
[2m[barbies] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[barbies] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[barbies] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[barbies] [mNo ghcjs found
[2m[barbies] [mNo ghcjs-pkg found
[2m[barbies] [mNo greencard found
[2m[barbies] [mUsing haddock version 2.30.0 found on system at:
[2m[barbies] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[barbies] [mNo happy found
[2m[barbies] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[barbies] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[barbies] [mNo hmake found
[2m[barbies] [mUsing hpc version 0.69 found on system at:
[2m[barbies] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[barbies] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[barbies] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[barbies] [mUsing hscolour version 1.25 found on system at:
[2m[barbies] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[barbies] [mNo jhc found
[2m[barbies] [mUsing ld found on system at:
[2m[barbies] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[barbies] [mNo pkg-config found
[2m[barbies] [mUsing runghc version 9.8.1 found on system at:
[2m[barbies] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[barbies] [mUsing strip version 2.44 found on system at:
[2m[barbies] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[barbies] [mUsing tar found on system at:
[2m[barbies] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[barbies] [mNo uhc found
[2m[barbies] [m[1;36mPhase: buildPhase[m
[2m[barbies] [mPreprocessing library for barbies-2.1.1.0..
[2m[barbies] [mBuilding library for barbies-2.1.1.0..
[2m[barbies] [m[ 1 of 32] Compiling Barbies.Internal.Dicts ( src/Barbies/Internal/Dicts.hs, dist/build/Barbies/Internal/Dicts.o, dist/build/Barbies/Internal/Dicts.dyn_o )
[2m[barbies] [m[ 2 of 32] Compiling Barbies.Internal.Writer ( src/Barbies/Internal/Writer.hs, dist/build/Barbies/Internal/Writer.o, dist/build/Barbies/Internal/Writer.dyn_o )
[2m[barbies] [m[ 3 of 32] Compiling Data.Generics.GenericN ( src/Data/Generics/GenericN.hs, dist/build/Data/Generics/GenericN.o, dist/build/Data/Generics/GenericN.dyn_o )
[2m[barbies] [m[ 4 of 32] Compiling Barbies.Internal.Wear ( src/Barbies/Internal/Wear.hs, dist/build/Barbies/Internal/Wear.o, dist/build/Barbies/Internal/Wear.dyn_o )
[2m[barbies] [m[ 5 of 32] Compiling Barbies.Generics.Traversable ( src/Barbies/Generics/Traversable.hs, dist/build/Barbies/Generics/Traversable.o, dist/build/Barbies/Generics/Traversable.dyn_o )
[2m[barbies] [m[ 6 of 32] Compiling Barbies.Generics.Functor ( src/Barbies/Generics/Functor.hs, dist/build/Barbies/Generics/Functor.o, dist/build/Barbies/Generics/Functor.dyn_o )
[2m[barbies] [m[ 7 of 32] Compiling Barbies.Internal.FunctorT ( src/Barbies/Internal/FunctorT.hs, dist/build/Barbies/Internal/FunctorT.o, dist/build/Barbies/Internal/FunctorT.dyn_o )
[2m[barbies] [m[ 8 of 32] Compiling Barbies.Internal.TraversableT ( src/Barbies/Internal/TraversableT.hs, dist/build/Barbies/Internal/TraversableT.o, dist/build/Barbies/Internal/TraversableT.dyn_o )
[2m[barbies] [m[ 9 of 32] Compiling Barbies.Internal.MonadT ( src/Barbies/Internal/MonadT.hs, dist/build/Barbies/Internal/MonadT.o, dist/build/Barbies/Internal/MonadT.dyn_o )
[2m[barbies] [m[10 of 32] Compiling Barbies.Internal.FunctorB ( src/Barbies/Internal/FunctorB.hs, dist/build/Barbies/Internal/FunctorB.o, dist/build/Barbies/Internal/FunctorB.dyn_o )
[2m[barbies] [m[11 of 32] Compiling Barbies.Internal.TraversableB ( src/Barbies/Internal/TraversableB.hs, dist/build/Barbies/Internal/TraversableB.o, dist/build/Barbies/Internal/TraversableB.dyn_o )
[2m[barbies] [m[12 of 32] Compiling Barbies.Generics.Distributive ( src/Barbies/Generics/Distributive.hs, dist/build/Barbies/Generics/Distributive.o, dist/build/Barbies/Generics/Distributive.dyn_o )
[2m[barbies] [m[13 of 32] Compiling Barbies.Internal.DistributiveT ( src/Barbies/Internal/DistributiveT.hs, dist/build/Barbies/Internal/DistributiveT.o, dist/build/Barbies/Internal/DistributiveT.dyn_o )
[2m[barbies] [m[14 of 32] Compiling Barbies.Internal.DistributiveB ( src/Barbies/Internal/DistributiveB.hs, dist/build/Barbies/Internal/DistributiveB.o, dist/build/Barbies/Internal/DistributiveB.dyn_o )
[2m[barbies] [m[15 of 32] Compiling Barbies.Generics.Constraints ( src/Barbies/Generics/Constraints.hs, dist/build/Barbies/Generics/Constraints.o, dist/build/Barbies/Generics/Constraints.dyn_o )
[2m[barbies] [m[16 of 32] Compiling Barbies.Generics.Bare ( src/Barbies/Generics/Bare.hs, dist/build/Barbies/Generics/Bare.o, dist/build/Barbies/Generics/Bare.dyn_o )
[2m[barbies] [m[17 of 32] Compiling Barbies.Internal.BareB ( src/Barbies/Internal/BareB.hs, dist/build/Barbies/Internal/BareB.o, dist/build/Barbies/Internal/BareB.dyn_o )
[2m[barbies] [m[18 of 32] Compiling Barbies.Bare     ( src/Barbies/Bare.hs, dist/build/Barbies/Bare.o, dist/build/Barbies/Bare.dyn_o )
[2m[barbies] [m[19 of 32] Compiling Barbies.Generics.Applicative ( src/Barbies/Generics/Applicative.hs, dist/build/Barbies/Generics/Applicative.o, dist/build/Barbies/Generics/Applicative.dyn_o )
[2m[barbies] [m[20 of 32] Compiling Barbies.Internal.ApplicativeT ( src/Barbies/Internal/ApplicativeT.hs, dist/build/Barbies/Internal/ApplicativeT.o, dist/build/Barbies/Internal/ApplicativeT.dyn_o )
[2m[barbies] [m[21 of 32] Compiling Barbies.Internal.ConstraintsT ( src/Barbies/Internal/ConstraintsT.hs, dist/build/Barbies/Internal/ConstraintsT.o, dist/build/Barbies/Internal/ConstraintsT.dyn_o )
[2m[barbies] [m[22 of 32] Compiling Data.Functor.Transformer ( src/Data/Functor/Transformer.hs, dist/build/Data/Functor/Transformer.o, dist/build/Data/Functor/Transformer.dyn_o )
[2m[barbies] [m[23 of 32] Compiling Barbies.Internal.ApplicativeB ( src/Barbies/Internal/ApplicativeB.hs, dist/build/Barbies/Internal/ApplicativeB.o, dist/build/Barbies/Internal/ApplicativeB.dyn_o )
[2m[barbies] [m[24 of 32] Compiling Barbies.Internal.ConstraintsB ( src/Barbies/Internal/ConstraintsB.hs, dist/build/Barbies/Internal/ConstraintsB.o, dist/build/Barbies/Internal/ConstraintsB.dyn_o )
[2m[barbies] [m[25 of 32] Compiling Data.Functor.Barbie ( src/Data/Functor/Barbie.hs, dist/build/Data/Functor/Barbie.o, dist/build/Data/Functor/Barbie.dyn_o )
[2m[barbies] [m[26 of 32] Compiling Barbies.Internal.Containers ( src/Barbies/Internal/Containers.hs, dist/build/Barbies/Internal/Containers.o, dist/build/Barbies/Internal/Containers.dyn_o )
[2m[barbies] [m[27 of 32] Compiling Barbies.Internal.Wrappers ( src/Barbies/Internal/Wrappers.hs, dist/build/Barbies/Internal/Wrappers.o, dist/build/Barbies/Internal/Wrappers.dyn_o )
[2m[barbies] [m[28 of 32] Compiling Barbies.Internal.Trivial ( src/Barbies/Internal/Trivial.hs, dist/build/Barbies/Internal/Trivial.o, dist/build/Barbies/Internal/Trivial.dyn_o )
[2m[barbies] [m[29 of 32] Compiling Barbies.Bi       ( src/Barbies/Bi.hs, dist/build/Barbies/Bi.o, dist/build/Barbies/Bi.dyn_o )
[2m[barbies] [m[30 of 32] Compiling Barbies          ( src/Barbies.hs, dist/build/Barbies.o, dist/build/Barbies.dyn_o )
[2m[barbies] [m[31 of 32] Compiling Barbies.Constraints ( src/Barbies/Constraints.hs, dist/build/Barbies/Constraints.o, dist/build/Barbies/Constraints.dyn_o )
[2m[barbies] [m[32 of 32] Compiling Barbies.Internal ( src/Barbies/Internal.hs, dist/build/Barbies/Internal.o, dist/build/Barbies/Internal.dyn_o )
[2m[barbies] [m[ 1 of 32] Compiling Barbies.Internal.Dicts ( src/Barbies/Internal/Dicts.hs, dist/build/Barbies/Internal/Dicts.p_o )
[2m[barbies] [m[ 2 of 32] Compiling Barbies.Internal.Writer ( src/Barbies/Internal/Writer.hs, dist/build/Barbies/Internal/Writer.p_o )
[2m[barbies] [m[ 3 of 32] Compiling Data.Generics.GenericN ( src/Data/Generics/GenericN.hs, dist/build/Data/Generics/GenericN.p_o )
[2m[barbies] [m[ 4 of 32] Compiling Barbies.Internal.Wear ( src/Barbies/Internal/Wear.hs, dist/build/Barbies/Internal/Wear.p_o )
[2m[barbies] [m[ 5 of 32] Compiling Barbies.Generics.Traversable ( src/Barbies/Generics/Traversable.hs, dist/build/Barbies/Generics/Traversable.p_o )
[2m[barbies] [m[ 6 of 32] Compiling Barbies.Generics.Functor ( src/Barbies/Generics/Functor.hs, dist/build/Barbies/Generics/Functor.p_o )
[2m[barbies] [m[ 7 of 32] Compiling Barbies.Internal.FunctorT ( src/Barbies/Internal/FunctorT.hs, dist/build/Barbies/Internal/FunctorT.p_o )
[2m[barbies] [m[ 8 of 32] Compiling Barbies.Internal.TraversableT ( src/Barbies/Internal/TraversableT.hs, dist/build/Barbies/Internal/TraversableT.p_o )
[2m[barbies] [m[ 9 of 32] Compiling Barbies.Internal.MonadT ( src/Barbies/Internal/MonadT.hs, dist/build/Barbies/Internal/MonadT.p_o )
[2m[barbies] [m[10 of 32] Compiling Barbies.Internal.FunctorB ( src/Barbies/Internal/FunctorB.hs, dist/build/Barbies/Internal/FunctorB.p_o )
[2m[barbies] [m[11 of 32] Compiling Barbies.Internal.TraversableB ( src/Barbies/Internal/TraversableB.hs, dist/build/Barbies/Internal/TraversableB.p_o )
[2m[barbies] [m[12 of 32] Compiling Barbies.Generics.Distributive ( src/Barbies/Generics/Distributive.hs, dist/build/Barbies/Generics/Distributive.p_o )
[2m[barbies] [m[13 of 32] Compiling Barbies.Internal.DistributiveT ( src/Barbies/Internal/DistributiveT.hs, dist/build/Barbies/Internal/DistributiveT.p_o )
[2m[barbies] [m[14 of 32] Compiling Barbies.Internal.DistributiveB ( src/Barbies/Internal/DistributiveB.hs, dist/build/Barbies/Internal/DistributiveB.p_o )
[2m[barbies] [m[15 of 32] Compiling Barbies.Generics.Constraints ( src/Barbies/Generics/Constraints.hs, dist/build/Barbies/Generics/Constraints.p_o )
[2m[barbies] [m[16 of 32] Compiling Barbies.Generics.Bare ( src/Barbies/Generics/Bare.hs, dist/build/Barbies/Generics/Bare.p_o )
[2m[barbies] [m[17 of 32] Compiling Barbies.Internal.BareB ( src/Barbies/Internal/BareB.hs, dist/build/Barbies/Internal/BareB.p_o )
[2m[barbies] [m[18 of 32] Compiling Barbies.Bare     ( src/Barbies/Bare.hs, dist/build/Barbies/Bare.p_o )
[2m[barbies] [m[19 of 32] Compiling Barbies.Generics.Applicative ( src/Barbies/Generics/Applicative.hs, dist/build/Barbies/Generics/Applicative.p_o )
[2m[barbies] [m[20 of 32] Compiling Barbies.Internal.ApplicativeT ( src/Barbies/Internal/ApplicativeT.hs, dist/build/Barbies/Internal/ApplicativeT.p_o )
[2m[barbies] [m[21 of 32] Compiling Barbies.Internal.ConstraintsT ( src/Barbies/Internal/ConstraintsT.hs, dist/build/Barbies/Internal/ConstraintsT.p_o )
[2m[barbies] [m[22 of 32] Compiling Data.Functor.Transformer ( src/Data/Functor/Transformer.hs, dist/build/Data/Functor/Transformer.p_o )
[2m[barbies] [m[23 of 32] Compiling Barbies.Internal.ApplicativeB ( src/Barbies/Internal/ApplicativeB.hs, dist/build/Barbies/Internal/ApplicativeB.p_o )
[2m[barbies] [m[24 of 32] Compiling Barbies.Internal.ConstraintsB ( src/Barbies/Internal/ConstraintsB.hs, dist/build/Barbies/Internal/ConstraintsB.p_o )
[2m[barbies] [m[25 of 32] Compiling Data.Functor.Barbie ( src/Data/Functor/Barbie.hs, dist/build/Data/Functor/Barbie.p_o )
[2m[barbies] [m[26 of 32] Compiling Barbies.Internal.Containers ( src/Barbies/Internal/Containers.hs, dist/build/Barbies/Internal/Containers.p_o )
[2m[barbies] [m[27 of 32] Compiling Barbies.Internal.Wrappers ( src/Barbies/Internal/Wrappers.hs, dist/build/Barbies/Internal/Wrappers.p_o )
[2m[barbies] [m[28 of 32] Compiling Barbies.Internal.Trivial ( src/Barbies/Internal/Trivial.hs, dist/build/Barbies/Internal/Trivial.p_o )
[2m[barbies] [m[29 of 32] Compiling Barbies.Bi       ( src/Barbies/Bi.hs, dist/build/Barbies/Bi.p_o )
[2m[barbies] [m[30 of 32] Compiling Barbies          ( src/Barbies.hs, dist/build/Barbies.p_o )
[2m[barbies] [m[31 of 32] Compiling Barbies.Constraints ( src/Barbies/Constraints.hs, dist/build/Barbies/Constraints.p_o )
[2m[barbies] [m[32 of 32] Compiling Barbies.Internal ( src/Barbies/Internal.hs, dist/build/Barbies/Internal.p_o )
[2m[barbies] [mPreprocessing test suite 'barbies-test' for barbies-2.1.1.0..
[2m[barbies] [mBuilding test suite 'barbies-test' for barbies-2.1.1.0..
[2m[barbies] [m[ 1 of 12] Compiling Clothes          ( test/Clothes.hs, dist/build/barbies-test/barbies-test-tmp/Clothes.o )
[2m[barbies] [m[ 2 of 12] Compiling Spec.Applicative ( test/Spec/Applicative.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Applicative.o )
[2m[barbies] [m[ 3 of 12] Compiling Spec.Bare        ( test/Spec/Bare.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Bare.o )
[2m[barbies] [m[ 4 of 12] Compiling Spec.Constraints ( test/Spec/Constraints.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Constraints.o )
[2m[barbies] [m[ 5 of 12] Compiling Spec.Distributive ( test/Spec/Distributive.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Distributive.o )
[2m[barbies] [m[ 6 of 12] Compiling Spec.Functor     ( test/Spec/Functor.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Functor.o )
[2m[barbies] [m[ 7 of 12] Compiling Spec.Traversable ( test/Spec/Traversable.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Traversable.o )
[2m[barbies] [m[ 8 of 12] Compiling Spec.Wrapper     ( test/Spec/Wrapper.hs, dist/build/barbies-test/barbies-test-tmp/Spec/Wrapper.o )
[2m[barbies] [m[ 9 of 12] Compiling TestBarbies      ( test/TestBarbies.hs, dist/build/barbies-test/barbies-test-tmp/TestBarbies.o )
[2m[barbies] [m[10 of 12] Compiling TestBarbiesW     ( test/TestBarbiesW.hs, dist/build/barbies-test/barbies-test-tmp/TestBarbiesW.o )
[2m[barbies] [m[11 of 12] Compiling TestBiBarbies    ( test/TestBiBarbies.hs, dist/build/barbies-test/barbies-test-tmp/TestBiBarbies.o )
[2m[barbies] [m[12 of 12] Compiling Main             ( test/Spec.hs, dist/build/barbies-test/barbies-test-tmp/Main.o )
[2m[barbies] [m
[2m[barbies] [m[;1mtest/Spec.hs:18:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[barbies] [m    The import of ‘Control.Applicative’ is redundant
[2m[barbies] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[barbies] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[barbies] [m[;1m[34m   |[0m[0m
[2m[barbies] [m[;1m[34m18 |[0m[0m [;1m[35mimport Control.Applicative ( liftA2 )[0m[0m
[2m[barbies] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[barbies] [m[13 of 13] Linking dist/build/barbies-test/barbies-test
[2m[barbies] [mbuildPhase completed in 37 seconds
[2m[barbies] [m[1;36mPhase: checkPhase[m
[2m[barbies] [mRunning 1 test suites...
[2m[barbies] [mTest suite barbies-test: RUNNING...
[2m[barbies] [mTests
[2m[barbies] [m  Functor Laws
[2m[barbies] [m    Record0
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1
[2m[barbies] [m      bmap id = id:                    OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1S
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3S
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1W Covered
[2m[barbies] [m      bmap id = id:                    OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3W Covered
[2m[barbies] [m      bmap id = id:                    OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1WS Covered
[2m[barbies] [m      bmap id = id:                    OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3WS Covered
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Ignore1
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    SumRec
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3W Covered
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    SumRecW Covered
[2m[barbies] [m      bmap id = id:                    OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecord
[2m[barbies] [m      bmap id = id:                    OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedF
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Nested2F
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecordW Covered
[2m[barbies] [m      bmap id = id:                    OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedFW Covered
[2m[barbies] [m      bmap id = id:                    OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Nested2FW Covered
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    ParF Maybe
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record0 * *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1 *) ()
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3 *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1S *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3S *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Ignore1 *) ()
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Sum3 *) ()
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (CompositeRecord *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (SumRec *) ()
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (NestedF *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Nested2F *) ()
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) (* -> *) NestedB Maybe
[2m[barbies] [m      bmap id = id:                    OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    MixedBT Maybe
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) (* -> *) MixedBT Maybe
[2m[barbies] [m      bmap id = id:                    OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      bmap (f . g) = bmap f . bmap g): OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m  Distributive Laws
[2m[barbies] [m    Record0
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1S
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3S
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.18s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1W Covered
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3W Covered
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.10s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecord
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.22s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1WS Covered
[2m[barbies] [m      naturality:                      OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3WS Covered
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.16s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecordW Covered
[2m[barbies] [m      naturality:                      OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.31s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record0 * *) ()
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1 *) ()
[2m[barbies] [m      naturality:                      OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1S *) ()
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3S *) ()
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.13s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m  Traversable Laws
[2m[barbies] [m    Record0
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1
[2m[barbies] [m      naturality:                      OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3
[2m[barbies] [m      naturality:                      OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1S
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3S
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1W Covered
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3W Covered
[2m[barbies] [m      naturality:                      OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1WS Covered
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3WS Covered
[2m[barbies] [m      naturality:                      OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Ignore1
[2m[barbies] [m      naturality:                      OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    SumRec
[2m[barbies] [m      naturality:                      OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3W Covered
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    SumRecW Covered
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecord
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedF
[2m[barbies] [m      naturality:                      OK (0.13s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.10s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Nested2F
[2m[barbies] [m      naturality:                      OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.12s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecordW Covered
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedFW Covered
[2m[barbies] [m      naturality:                      OK (0.16s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.08s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Nested2FW Covered
[2m[barbies] [m      naturality:                      OK (0.12s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.19s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    ParF Maybe
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record0 * *) ()
[2m[barbies] [m      naturality:                      OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1 *) ()
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3 *) ()
[2m[barbies] [m      naturality:                      OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1S *) ()
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3S *) ()
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Ignore1 *) ()
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Sum3 *) ()
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (CompositeRecord *) ()
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (SumRec *) ()
[2m[barbies] [m      naturality:                      OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (NestedF *) ()
[2m[barbies] [m      naturality:                      OK (0.10s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.18s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Nested2F *) ()
[2m[barbies] [m      naturality:                      OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.15s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) (* -> *) NestedB Maybe
[2m[barbies] [m      naturality:                      OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    MixedBT Maybe
[2m[barbies] [m      naturality:                      OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) (* -> *) MixedBT Maybe
[2m[barbies] [m      naturality:                      OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      identity:                        OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      composition:                     OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m  Applicative laws
[2m[barbies] [m    Record0
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecord
[2m[barbies] [m      naturality of bprod:             OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.16s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedF
[2m[barbies] [m      naturality of bprod:             OK (0.39s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (1.82s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Nested2F
[2m[barbies] [m      naturality of bprod:             OK (0.51s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (2.31s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1S
[2m[barbies] [m      naturality of bprod:             OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3S
[2m[barbies] [m      naturality of bprod:             OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.08s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1W Covered
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3W Covered
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecordW Covered
[2m[barbies] [m      naturality of bprod:             OK (0.08s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedFW Covered
[2m[barbies] [m      naturality of bprod:             OK (0.33s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (1.29s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Nested2FW Covered
[2m[barbies] [m      naturality of bprod:             OK (0.60s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (2.26s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1WS Covered
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3WS Covered
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    ParX (Maybe ())
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.23s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    ParF Sum
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record0 * *) ()
[2m[barbies] [m      naturality of bprod:             OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1 *) ()
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3 *) ()
[2m[barbies] [m      naturality of bprod:             OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record1S *) ()
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Record3S *) ()
[2m[barbies] [m      naturality of bprod:             OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.09s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.14s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (CompositeRecord *) ()
[2m[barbies] [m      naturality of bprod:             OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (NestedF *) ()
[2m[barbies] [m      naturality of bprod:             OK (0.35s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.13s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.17s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (1.55s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (Nested2F *) ()
[2m[barbies] [m      naturality of bprod:             OK (0.32s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.02s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.08s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (2.04s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Flip (* -> *) * (ParX * (Maybe ())) ()
[2m[barbies] [m      naturality of bprod:             OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    MixedBT []
[2m[barbies] [m      naturality of bprod:             OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      left identity:                   OK (0.08s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.13s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m  addDict projection
[2m[barbies] [m    Record0:                           OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record1:                           OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record3:                           OK (0.02s)
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record1S:                          OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record3S:                          OK (0.04s)
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record1W Covered:                  OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record3W Covered:                  OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record1WS Covered:                 OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Record3WS Covered:                 OK (0.04s)
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Ignore1:                           OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3:                              OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    SumRec:                            OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3W Covered:                     OK (0.03s)
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    SumRecW Covered:                   OK (0.04s)
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecord:                   OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    CompositeRecordW Covered:          OK (0.02s)
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m    MixedBT Maybe:                     OK
[2m[barbies] [m      +++ OK, passed 100 tests.
[2m[barbies] [m  Bare laws
[2m[barbies] [m    Record1W
[2m[barbies] [m      bcover . bstrip = id:            OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3W
[2m[barbies] [m      bcover . bstrip = id:            OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record1WS
[2m[barbies] [m      bcover . bstrip = id:            OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Record3WS
[2m[barbies] [m      bcover . bstrip = id:            OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Sum3W
[2m[barbies] [m      bcover . bstrip = id:            OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    SumRecW
[2m[barbies] [m      bcover . bstrip = id:            OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    NestedFW
[2m[barbies] [m      bcover . bstrip = id:            OK (0.07s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m  Generic wrapper
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.06s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK (0.01s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.09s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.17s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.13s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK (0.03s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.14s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m    Monoid laws
[2m[barbies] [m      neutral element:                 OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m      associativity:                   OK (0.05s)
[2m[barbies] [m        +++ OK, passed 100 tests.
[2m[barbies] [m  bfoldMap
[2m[barbies] [m    Record3:                           OK
[2m[barbies] [m  bmapC
[2m[barbies] [m    Record1:                           OK
[2m[barbies] [m  btraverseC
[2m[barbies] [m    Record1:                           OK
[2m[barbies] [m  bpureC
[2m[barbies] [m    Record1:                           OK
[2m[barbies] [m  bfoldMapC
[2m[barbies] [m    Record3S:                          OK
[2m[barbies] [m  bzipWithC
[2m[barbies] [m    Record1S:                          OK
[2m[barbies] [m  bzipWith3C
[2m[barbies] [m    Record1S:                          OK
[2m[barbies] [m  bzipWith4C
[2m[barbies] [m    Record1S:                          OK
[2m[barbies] [m
[2m[barbies] [mAll 373 tests passed (2.78s)
[2m[barbies] [mTest suite barbies-test: PASS
[2m[barbies] [mTest suite logged to: dist/test/barbies-2.1.1.0-barbies-test.log
[2m[barbies] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[barbies] [m[1;36mPhase: haddockPhase[m
[2m[barbies] [mPreprocessing library for barbies-2.1.1.0..
[2m[barbies] [mRunning Haddock on library for barbies-2.1.1.0..
[2m[barbies] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[barbies] [m[ 1 of 32] Compiling Barbies.Internal.Dicts ( src/Barbies/Internal/Dicts.hs, nothing )
[2m[barbies] [m[ 2 of 32] Compiling Barbies.Internal.Writer ( src/Barbies/Internal/Writer.hs, nothing )
[2m[barbies] [m[ 3 of 32] Compiling Data.Generics.GenericN ( src/Data/Generics/GenericN.hs, nothing )
[2m[barbies] [m[ 4 of 32] Compiling Barbies.Internal.Wear ( src/Barbies/Internal/Wear.hs, nothing )
[2m[barbies] [m[ 5 of 32] Compiling Barbies.Generics.Traversable ( src/Barbies/Generics/Traversable.hs, nothing )
[2m[barbies] [m[ 6 of 32] Compiling Barbies.Generics.Functor ( src/Barbies/Generics/Functor.hs, nothing )
[2m[barbies] [m[ 7 of 32] Compiling Barbies.Internal.FunctorT ( src/Barbies/Internal/FunctorT.hs, nothing )
[2m[barbies] [m[ 8 of 32] Compiling Barbies.Internal.TraversableT ( src/Barbies/Internal/TraversableT.hs, nothing )
[2m[barbies] [m[ 9 of 32] Compiling Barbies.Internal.MonadT ( src/Barbies/Internal/MonadT.hs, nothing )
[2m[barbies] [m[10 of 32] Compiling Barbies.Internal.FunctorB ( src/Barbies/Internal/FunctorB.hs, nothing )
[2m[barbies] [m[11 of 32] Compiling Barbies.Internal.TraversableB ( src/Barbies/Internal/TraversableB.hs, nothing )
[2m[barbies] [m[12 of 32] Compiling Barbies.Generics.Distributive ( src/Barbies/Generics/Distributive.hs, nothing )
[2m[barbies] [m[13 of 32] Compiling Barbies.Internal.DistributiveT ( src/Barbies/Internal/DistributiveT.hs, nothing )
[2m[barbies] [m[14 of 32] Compiling Barbies.Internal.DistributiveB ( src/Barbies/Internal/DistributiveB.hs, nothing )
[2m[barbies] [m[15 of 32] Compiling Barbies.Generics.Constraints ( src/Barbies/Generics/Constraints.hs, nothing )
[2m[barbies] [m[16 of 32] Compiling Barbies.Generics.Bare ( src/Barbies/Generics/Bare.hs, nothing )
[2m[barbies] [m[17 of 32] Compiling Barbies.Internal.BareB ( src/Barbies/Internal/BareB.hs, nothing )
[2m[barbies] [m[18 of 32] Compiling Barbies.Bare     ( src/Barbies/Bare.hs, nothing )
[2m[barbies] [m[19 of 32] Compiling Barbies.Generics.Applicative ( src/Barbies/Generics/Applicative.hs, nothing )
[2m[barbies] [m[20 of 32] Compiling Barbies.Internal.ApplicativeT ( src/Barbies/Internal/ApplicativeT.hs, nothing )
[2m[barbies] [m[21 of 32] Compiling Barbies.Internal.ConstraintsT ( src/Barbies/Internal/ConstraintsT.hs, nothing )
[2m[barbies] [m[22 of 32] Compiling Data.Functor.Transformer ( src/Data/Functor/Transformer.hs, nothing )
[2m[barbies] [m[23 of 32] Compiling Barbies.Internal.ApplicativeB ( src/Barbies/Internal/ApplicativeB.hs, nothing )
[2m[barbies] [m[24 of 32] Compiling Barbies.Internal.ConstraintsB ( src/Barbies/Internal/ConstraintsB.hs, nothing )
[2m[barbies] [m[25 of 32] Compiling Data.Functor.Barbie ( src/Data/Functor/Barbie.hs, nothing )
[2m[barbies] [m[26 of 32] Compiling Barbies.Internal.Containers ( src/Barbies/Internal/Containers.hs, nothing )
[2m[barbies] [m[27 of 32] Compiling Barbies.Internal.Wrappers ( src/Barbies/Internal/Wrappers.hs, nothing )
[2m[barbies] [m[28 of 32] Compiling Barbies.Internal.Trivial ( src/Barbies/Internal/Trivial.hs, nothing )
[2m[barbies] [m[29 of 32] Compiling Barbies.Bi       ( src/Barbies/Bi.hs, nothing )
[2m[barbies] [m[30 of 32] Compiling Barbies          ( src/Barbies.hs, nothing )
[2m[barbies] [m[31 of 32] Compiling Barbies.Constraints ( src/Barbies/Constraints.hs, nothing )
[2m[barbies] [m[32 of 32] Compiling Barbies.Internal ( src/Barbies/Internal.hs, nothing )
[2m[barbies] [mHaddock coverage:
[2m[barbies] [mWarning: 'Dict' is ambiguous. It is defined
[2m[barbies] [m    * at src/Barbies/Internal/Dicts.hs:25:3
[2m[barbies] [m    * at src/Barbies/Internal/Dicts.hs:24:1
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined at src/Barbies/Internal/Dicts.hs:24:1
[2m[barbies] [mWarning: 'Compose' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Compose’
[2m[barbies] [mWarning: 'Identity' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Identity’
[2m[barbies] [mWarning: 'Compose' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Compose’
[2m[barbies] [mWarning: 'ReaderT' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Control.Monad.Trans.Reader’
[2m[barbies] [m    * in ‘Control.Monad.Trans.Reader’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Reader’
[2m[barbies] [mWarning: 'Compose' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Compose’
[2m[barbies] [mWarning: 'Identity' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Identity’
[2m[barbies] [mWarning: 'f' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [mWarning: 'Compose' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Compose’
[2m[barbies] [mWarning: 'Identity' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Identity’
[2m[barbies] [mWarning: 'f' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [mWarning: 'Compose' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    * in ‘Data.Functor.Compose’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Compose’
[2m[barbies] [mWarning: 'Identity' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    * in ‘Data.Functor.Identity’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Identity’
[2m[barbies] [mWarning: 'Identity' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [m  80% (  8 / 10) in 'Barbies.Bare'
[2m[barbies] [m  Missing documentation for:
[2m[barbies] [m    Bare (src/Barbies/Internal/Wear.hs:12)
[2m[barbies] [m    Covered (src/Barbies/Internal/Wear.hs:13)
[2m[barbies] [mWarning: 'tprod'' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [mWarning: 'Dict' is ambiguous. It is defined
[2m[barbies] [m    * at src/Barbies/Internal/Dicts.hs:25:3
[2m[barbies] [m    * at src/Barbies/Internal/Dicts.hs:24:1
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined at src/Barbies/Internal/Dicts.hs:24:1
[2m[barbies] [mWarning: 'Product'' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [m  97% ( 36 / 37) in 'Data.Functor.Transformer'
[2m[barbies] [m  Missing documentation for:
[2m[barbies] [m    Rec (src/Data/Generics/GenericN.hs:51)
[2m[barbies] [mWarning: 'bprod'' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [mWarning: 'Dict' is ambiguous. It is defined
[2m[barbies] [m    * at src/Barbies/Internal/Dicts.hs:25:3
[2m[barbies] [m    * at src/Barbies/Internal/Dicts.hs:24:1
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined at src/Barbies/Internal/Dicts.hs:24:1
[2m[barbies] [mWarning: 'Product'' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [mWarning: 'Const' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Const’
[2m[barbies] [m    * in ‘Data.Functor.Const’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Const’
[2m[barbies] [mWarning: '(&)' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [m  95% ( 41 / 43) in 'Data.Functor.Barbie'
[2m[barbies] [m  Missing documentation for:
[2m[barbies] [m    bfoldMapC (src/Barbies/Internal/ConstraintsB.hs:173)
[2m[barbies] [m    Rec (src/Data/Generics/GenericN.hs:51)
[2m[barbies] [mWarning: 'Const' is ambiguous. It is defined
[2m[barbies] [m    * in ‘Data.Functor.Const’
[2m[barbies] [m    * in ‘Data.Functor.Const’
[2m[barbies] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[barbies] [m    by specifying the type/value namespace explicitly.
[2m[barbies] [m    Defaulting to the one defined in ‘Data.Functor.Const’
[2m[barbies] [mWarning: 'bpure' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [m  94% ( 18 / 19) in 'Barbies.Bi'
[2m[barbies] [m  Missing documentation for:
[2m[barbies] [m    Module header
[2m[barbies] [mWarning: 'Dependants' is out of scope.
[2m[barbies] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[barbies] [m 100% ( 20 / 20) in 'Barbies'
[2m[barbies] [m  90% (  9 / 10) in 'Barbies.Constraints'
[2m[barbies] [m  Missing documentation for:
[2m[barbies] [m    & (src/Barbies/Internal/ConstraintsB.hs:112)
[2m[barbies] [m  73% ( 70 / 95) in 'Barbies.Internal'
[2m[barbies] [m  Missing documentation for:
[2m[barbies] [m    Module header
[2m[barbies] [m    GFunctor (src/Barbies/Generics/Functor.hs:14)
[2m[barbies] [m    GTraversable (src/Barbies/Generics/Traversable.hs:11)
[2m[barbies] [m    GDistributive (src/Barbies/Generics/Distributive.hs:17)
[2m[barbies] [m    gbpureDefault (src/Barbies/Internal/ApplicativeB.hs:179)
[2m[barbies] [m    GApplicative (src/Barbies/Generics/Applicative.hs:17)
[2m[barbies] [m    GConstraints (src/Barbies/Generics/Constraints.hs:21)
[2m[barbies] [m    GAll (src/Barbies/Generics/Constraints.hs:24)
[2m[barbies] [m    X (src/Barbies/Generics/Constraints.hs:26)
[2m[barbies] [m    Y (src/Barbies/Generics/Constraints.hs:27)
[2m[barbies] [m    Self (src/Barbies/Generics/Constraints.hs:141)
[2m[barbies] [m    Other (src/Barbies/Generics/Constraints.hs:142)
[2m[barbies] [m    SelfOrOther (src/Barbies/Generics/Constraints.hs:144)
[2m[barbies] [m    TagSelf0' (src/Barbies/Internal/ConstraintsB.hs:389)
[2m[barbies] [m    TagSelf1' (src/Barbies/Internal/ConstraintsT.hs:324)
[2m[barbies] [m    GBare (src/Barbies/Generics/Bare.hs:17)
[2m[barbies] [m    GenericN (src/Data/Generics/GenericN.hs:68)
[2m[barbies] [m    Rec (src/Data/Generics/GenericN.hs:51)
[2m[barbies] [m    Param (src/Data/Generics/GenericN.hs:40)
[2m[barbies] [m    Indexed (src/Data/Generics/GenericN.hs:42)
[2m[barbies] [m    FilterIndex (src/Data/Generics/GenericN.hs:46)
[2m[barbies] [m    Zip (src/Data/Generics/GenericN.hs:53)
[2m[barbies] [m    GenericP (src/Data/Generics/GenericN.hs:89)
[2m[barbies] [m    RepN (src/Data/Generics/GenericN.hs:72)
[2m[barbies] [m    RepP (src/Data/Generics/GenericN.hs:93)
[2m[barbies] [mWarning: Barbies: could not find link destinations for: 
[2m[barbies] [m	- Barbies.Internal.Containers.Rep_ErrorContainer
[2m[barbies] [m	- Barbies.Internal.Containers.Rep_Container
[2m[barbies] [m	- Barbies.Internal.Trivial.Rep_Unit
[2m[barbies] [m	- Barbies.Internal.Trivial.Rep_Void
[2m[barbies] [mWarning: Barbies.Internal: could not find link destinations for: 
[2m[barbies] [m	- GHC.Generics.SingKind
[2m[barbies] [m	- GHC.Generics.DemoteRep
[2m[barbies] [m	- GHC.Generics.fromSing
[2m[barbies] [m	- GHC.Generics.SingI
[2m[barbies] [m	- GHC.Generics.sing
[2m[barbies] [m	- GHC.Generics.Sing
[2m[barbies] [m	- GHC.Generics.D:R:UReckWordp0
[2m[barbies] [m	- GHC.Generics.D:R:UReckIntp0
[2m[barbies] [m	- GHC.Generics.D:R:UReckFloatp0
[2m[barbies] [m	- GHC.Generics.D:R:UReckDoublep0
[2m[barbies] [m	- GHC.Generics.D:R:UReckCharp0
[2m[barbies] [m	- GHC.Generics.D:R:UReckPtrp0
[2m[barbies] [m	- GHC.Generics.Rep1_Down
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple15
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple14
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple13
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple12
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple11
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple10
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple9
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple8
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple7
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple6
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple5
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple4
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple3
[2m[barbies] [m	- GHC.Generics.Rep1_Tuple2
[2m[barbies] [m	- GHC.Generics.Rep1_Solo
[2m[barbies] [m	- GHC.Generics.Rep1_Proxy
[2m[barbies] [m	- GHC.Generics.Rep1_Either
[2m[barbies] [m	- GHC.Generics.Rep1_Maybe
[2m[barbies] [m	- GHC.Generics.Rep1_NonEmpty
[2m[barbies] [m	- GHC.Generics.Rep1_List
[2m[barbies] [m	- GHC.Generics.Rep_Fingerprint
[2m[barbies] [m	- GHC.Generics.Rep_GeneralCategory
[2m[barbies] [m	- GHC.Generics.Rep_SrcLoc
[2m[barbies] [m	- GHC.Generics.Rep_Down
[2m[barbies] [m	- GHC.Generics.Rep_Tuple15
[2m[barbies] [m	- GHC.Generics.Rep_Tuple14
[2m[barbies] [m	- GHC.Generics.Rep_Tuple13
[2m[barbies] [m	- GHC.Generics.Rep_Tuple12
[2m[barbies] [m	- GHC.Generics.Rep_Tuple11
[2m[barbies] [m	- GHC.Generics.Rep_Tuple10
[2m[barbies] [m	- GHC.Generics.Rep_Tuple9
[2m[barbies] [m	- GHC.Generics.Rep_Tuple8
[2m[barbies] [m	- GHC.Generics.Rep_Tuple7
[2m[barbies] [m	- GHC.Generics.Rep_Tuple6
[2m[barbies] [m	- GHC.Generics.Rep_Tuple5
[2m[barbies] [m	- GHC.Generics.Rep_Tuple4
[2m[barbies] [m	- GHC.Generics.Rep_Tuple3
[2m[barbies] [m	- GHC.Generics.Rep_Tuple2
[2m[barbies] [m	- GHC.Generics.Rep_Solo
[2m[barbies] [m	- GHC.Generics.Rep_Unit
[2m[barbies] [m	- GHC.Generics.Rep_Proxy
[2m[barbies] [m	- GHC.Generics.Rep_Ordering
[2m[barbies] [m	- GHC.Generics.Rep_Bool
[2m[barbies] [m	- GHC.Generics.Rep_Either
[2m[barbies] [m	- GHC.Generics.Rep_Maybe
[2m[barbies] [m	- GHC.Generics.Rep_NonEmpty
[2m[barbies] [m	- GHC.Generics.Rep_List
[2m[barbies] [m	- GHC.Generics.Rep_Void
[2m[barbies] [m	- GHC.Generics.Rep_M1
[2m[barbies] [m	- GHC.Generics.Rep1_M1
[2m[barbies] [m	- GHC.Generics.Rep_V1
[2m[barbies] [m	- GHC.Generics.Rep1_V1
[2m[barbies] [m	- GHC.Generics.Rep_U1
[2m[barbies] [m	- GHC.Generics.Rep1_U1
[2m[barbies] [m	- GHC.Generics.Rep_Par1
[2m[barbies] [m	- GHC.Generics.Rep1_Par1
[2m[barbies] [m	- GHC.Generics.Rep_Rec1
[2m[barbies] [m	- GHC.Generics.Rep1_Rec1
[2m[barbies] [m	- GHC.Generics.Rep_K1
[2m[barbies] [m	- GHC.Generics.Rep1_K1
[2m[barbies] [m	- GHC.Generics.Rep_:+:
[2m[barbies] [m	- GHC.Generics.Rep1_:+:
[2m[barbies] [m	- GHC.Generics.Rep_:*:
[2m[barbies] [m	- GHC.Generics.Rep1_:*:
[2m[barbies] [m	- GHC.Generics.Rep_:.:
[2m[barbies] [m	- GHC.Generics.Rep1_:.:
[2m[barbies] [m	- GHC.Generics.Rep_R:UReckWordp
[2m[barbies] [m	- GHC.Generics.Rep1_R:UReckWordp
[2m[barbies] [m	- GHC.Generics.Rep_R:UReckIntp
[2m[barbies] [m	- GHC.Generics.Rep1_R:UReckIntp
[2m[barbies] [m	- GHC.Generics.Rep1_R:UReckFloatp
[2m[barbies] [m	- GHC.Generics.Rep_R:UReckDoublep
[2m[barbies] [m	- GHC.Generics.Rep1_R:UReckDoublep
[2m[barbies] [m	- GHC.Generics.Rep_R:UReckCharp
[2m[barbies] [m	- GHC.Generics.Rep1_R:UReckCharp
[2m[barbies] [m	- GHC.Generics.Rep_R:UReckPtrp
[2m[barbies] [m	- GHC.Generics.Rep1_R:UReckPtrp
[2m[barbies] [m	- GHC.Generics.Rep_Fixity
[2m[barbies] [m	- GHC.Generics.Rep_Associativity
[2m[barbies] [m	- GHC.Generics.Rep_SourceUnpackedness
[2m[barbies] [m	- GHC.Generics.Rep_SourceStrictness
[2m[barbies] [m	- GHC.Generics.Rep_DecidedStrictness
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_Alt
[2m[barbies] [m	- Data.Semigroup.Internal.Rep1_Alt
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_Product
[2m[barbies] [m	- Data.Semigroup.Internal.Rep1_Product
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_Sum
[2m[barbies] [m	- Data.Semigroup.Internal.Rep1_Sum
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_Any
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_All
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_Endo
[2m[barbies] [m	- Data.Semigroup.Internal.Rep_Dual
[2m[barbies] [m	- Data.Semigroup.Internal.Rep1_Dual
[2m[barbies] [m	- Data.Monoid.Rep_Ap
[2m[barbies] [m	- Data.Monoid.Rep1_Ap
[2m[barbies] [m	- Data.Monoid.Rep_Last
[2m[barbies] [m	- Data.Monoid.Rep1_Last
[2m[barbies] [m	- Data.Monoid.Rep_First
[2m[barbies] [m	- Data.Monoid.Rep1_First
[2m[barbies] [m	- Data.Functor.Const.Rep_Const
[2m[barbies] [m	- Data.Functor.Const.Rep1_Const
[2m[barbies] [m	- GHC.RTS.Flags.Rep_RTSFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_ParFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_TickyFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_TraceFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_DoTrace
[2m[barbies] [m	- GHC.RTS.Flags.Rep_ProfFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_DoHeapProfile
[2m[barbies] [m	- GHC.RTS.Flags.Rep_CCFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_DoCostCentres
[2m[barbies] [m	- GHC.RTS.Flags.Rep_DebugFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_MiscFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_ConcFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_GCFlags
[2m[barbies] [m	- GHC.RTS.Flags.Rep_GiveGCStats
[2m[barbies] [m	- Data.Functor.Identity.Rep_Identity
[2m[barbies] [m	- Data.Functor.Identity.Rep1_Identity
[2m[barbies] [m	- Control.Arrow.Rep1_Kleisli
[2m[barbies] [m	- Control.Arrow.Rep_Kleisli
[2m[barbies] [m	- Control.Applicative.Rep_ZipList
[2m[barbies] [m	- Control.Applicative.Rep1_ZipList
[2m[barbies] [m	- Control.Applicative.Rep_WrappedArrow
[2m[barbies] [m	- Control.Applicative.Rep1_WrappedArrow
[2m[barbies] [m	- Control.Applicative.Rep_WrappedMonad
[2m[barbies] [m	- Control.Applicative.Rep1_WrappedMonad
[2m[barbies] [m	- Data.Version.Rep_Version
[2m[barbies] [m	- GHC.ByteOrder.Rep_ByteOrder
[2m[barbies] [m	- GHC.Stats.Rep_RTSStats
[2m[barbies] [m	- GHC.Stats.Rep_GCDetails
[2m[barbies] [m	- Data.Semigroup.Rep_WrappedMonoid
[2m[barbies] [m	- Data.Semigroup.Rep1_WrappedMonoid
[2m[barbies] [m	- Data.Semigroup.Rep_Last
[2m[barbies] [m	- Data.Semigroup.Rep1_Last
[2m[barbies] [m	- Data.Semigroup.Rep_First
[2m[barbies] [m	- Data.Semigroup.Rep1_First
[2m[barbies] [m	- Data.Semigroup.Rep_Arg
[2m[barbies] [m	- Data.Semigroup.Rep1_Arg
[2m[barbies] [m	- Data.Semigroup.Rep_Max
[2m[barbies] [m	- Data.Semigroup.Rep1_Max
[2m[barbies] [m	- Data.Semigroup.Rep_Min
[2m[barbies] [m	- Data.Semigroup.Rep1_Min
[2m[barbies] [m	- Data.Complex.Rep_Complex
[2m[barbies] [m	- Data.Complex.Rep1_Complex
[2m[barbies] [m	- Data.Functor.Sum.Rep_Sum
[2m[barbies] [m	- Data.Functor.Sum.Rep1_Sum
[2m[barbies] [m	- Data.Functor.Product.Rep_Product
[2m[barbies] [m	- Data.Functor.Product.Rep1_Product
[2m[barbies] [m	- Data.Functor.Compose.Rep_Compose
[2m[barbies] [m	- Data.Functor.Compose.Rep1_Compose
[2m[barbies] [m	- Control.DeepSeq.GNFData
[2m[barbies] [m	- GHC.Generics.D:R:DemoteRepFixityI
[2m[barbies] [m	- GHC.Generics.D:R:SingFixityIa0
[2m[barbies] [m	- GHC.Generics.SPrefix
[2m[barbies] [m	- GHC.Generics.SInfix
[2m[barbies] [m	- GHC.Generics.D:R:DemoteRepAssociativity
[2m[barbies] [m	- GHC.Generics.D:R:SingAssociativitya0
[2m[barbies] [m	- GHC.Generics.SLeftAssociative
[2m[barbies] [m	- GHC.Generics.SRightAssociative
[2m[barbies] [m	- GHC.Generics.SNotAssociative
[2m[barbies] [m	- GHC.Generics.Rep_R:UReckFloatp
[2m[barbies] [m	- GHC.Generics.D:R:SingSourceUnpackednessa0
[2m[barbies] [m	- GHC.Generics.SNoSourceUnpackedness
[2m[barbies] [m	- GHC.Generics.D:R:DemoteRepSourceUnpackedness
[2m[barbies] [m	- GHC.Generics.SSourceNoUnpack
[2m[barbies] [m	- GHC.Generics.SSourceUnpack
[2m[barbies] [m	- GHC.Generics.D:R:SingSourceStrictnessa0
[2m[barbies] [m	- GHC.Generics.SNoSourceStrictness
[2m[barbies] [m	- GHC.Generics.D:R:DemoteRepSourceStrictness
[2m[barbies] [m	- GHC.Generics.SSourceLazy
[2m[barbies] [m	- GHC.Generics.SSourceStrict
[2m[barbies] [m	- GHC.Generics.D:R:SingDecidedStrictnessa0
[2m[barbies] [m	- GHC.Generics.SDecidedLazy
[2m[barbies] [m	- GHC.Generics.D:R:DemoteRepDecidedStrictness
[2m[barbies] [m	- GHC.Generics.SDecidedStrict
[2m[barbies] [m	- GHC.Generics.SDecidedUnpack
[2m[barbies] [m	- Data.Generics.GenericN.R:RepNa
[2m[barbies] [m	- Data.Generics.GenericN.R:RepPna
[2m[barbies] [m	- Control.Applicative.Backwards.Rep1_Backwards
[2m[barbies] [m	- Control.Applicative.Backwards.Rep_Backwards
[2m[barbies] [m	- Control.Applicative.Lift.Rep1_Lift
[2m[barbies] [m	- Control.Applicative.Lift.Rep_Lift
[2m[barbies] [m	- Control.Monad.Trans.Accum.Rep_AccumT
[2m[barbies] [m	- Control.Monad.Trans.Except.Rep1_ExceptT
[2m[barbies] [m	- Control.Monad.Trans.Except.Rep_ExceptT
[2m[barbies] [m	- Control.Monad.Trans.Identity.Rep1_IdentityT
[2m[barbies] [m	- Control.Monad.Trans.Identity.Rep_IdentityT
[2m[barbies] [m	- Control.Monad.Trans.Maybe.Rep1_MaybeT
[2m[barbies] [m	- Control.Monad.Trans.Maybe.Rep_MaybeT
[2m[barbies] [m	- Control.Monad.Trans.RWS.Lazy.Rep_RWST
[2m[barbies] [m	- Control.Monad.Trans.RWS.Strict.Rep_RWST
[2m[barbies] [m	- Control.Monad.Trans.Reader.Rep1_ReaderT
[2m[barbies] [m	- Control.Monad.Trans.Reader.Rep_ReaderT
[2m[barbies] [m	- Control.Monad.Trans.State.Lazy.Rep_StateT
[2m[barbies] [m	- Control.Monad.Trans.State.Strict.Rep_StateT
[2m[barbies] [m	- Control.Monad.Trans.Writer.Lazy.Rep_WriterT
[2m[barbies] [m	- Control.Monad.Trans.Writer.Strict.Rep_WriterT
[2m[barbies] [m	- Data.Functor.Reverse.Rep1_Reverse
[2m[barbies] [m	- Data.Functor.Reverse.Rep_Reverse
[2m[barbies] [m	- Data.Functor.Constant.Rep1_Constant
[2m[barbies] [m	- Data.Functor.Constant.Rep_Constant
[2m[barbies] [m	- Control.DeepSeq.One
[2m[barbies] [m	- Control.DeepSeq.RnfArgs
[2m[barbies] [m	- Control.DeepSeq.grnf
[2m[barbies] [m	- Data.Tagged.Rep1_Tagged
[2m[barbies] [m	- Data.Tagged.Rep_Tagged
[2m[barbies] [m	- Barbies.Internal.Containers.Rep_ErrorContainer
[2m[barbies] [m	- Barbies.Internal.Containers.Rep_Container
[2m[barbies] [m	- GHC.IO.Exception.Rep_ExitCode
[2m[barbies] [m	- Barbies.Internal.Trivial.Rep_Unit
[2m[barbies] [m	- Barbies.Internal.Trivial.Rep_Void
[2m[barbies] [m	- Control.Monad.Trans.Cont.Rep_ContT
[2m[barbies] [m	- Control.Monad.Trans.RWS.CPS.Rep_RWST
[2m[barbies] [m	- Control.Monad.Trans.Select.Rep_SelectT
[2m[barbies] [m	- Control.Monad.Trans.Writer.CPS.Rep_WriterT
[2m[barbies] [mDocumentation created: dist/doc/html/barbies/,
[2m[barbies] [mdist/doc/html/barbies/barbies.txt
[2m[barbies] [mPreprocessing test suite 'barbies-test' for barbies-2.1.1.0..
[2m[barbies] [m[1;36mPhase: installPhase[m
[2m[barbies] [mInstalling library in /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[barbies] [m[1;36mPhase: fixupPhase[m
[2m[barbies] [mshrinking RPATHs of ELF executables and libraries in /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0
[2m[barbies] [mshrinking /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSbarbies-2.1.1.0-B6UYCcN21if5vG2GztECG1-ghc9.8.1.so
[2m[barbies] [mchecking for references to /build/ in /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0...
[2m[barbies] [mpatching script interpreter paths in /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0
[2m[barbies] [mstripping (with command strip and flags -S -p) in  /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/lib
[2m[barbies] [mshrinking RPATHs of ELF executables and libraries in /nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc
[2m[barbies] [mchecking for references to /build/ in /nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc...
[2m[barbies] [mpatching script interpreter paths in /nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc
[2m[barbies:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0[m
[2m[barbies:post-build] [m[2mPushing 2 paths (72 are already present) using zstd to cache sellout ⏳[m
[2m[barbies:post-build] [m[2m[m
[2m[barbies:post-build] [m[2mPushing /nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc (7.35 MiB)[m
[2m[barbies:post-build] [m[2mPushing /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0 (8.27 MiB)[m
[2m[barbies:post-build] [m[2m[m
[2m[barbies:post-build] [m[2mAll done.[m
[2m[barbies:post-build] [m[2mUploading to the NixCI cache: /nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc /nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0[m
[2m[barbies:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[barbies:post-build] [m[2mcopying 2 paths...[m
[2m[barbies:post-build] [m[2mcopying path '/nix/store/8dwkwradai55rl77widyxa5wsykww556-barbies-2.1.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[barbies:post-build] [m[2mcopying path '/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0' to 'https://cache.nix-ci.com'...[m
[2m[barbies:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[barbies:post-build] [m[2mcopying 1 paths...[m
[2m[barbies:post-build] [m[2mcopying path '/nix/store/ajja3vaacdpw7sc22j3clxv3pwqksff1-barbies-2.1.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 23 of 62 built[m
[1;34mBuilding /nix/store/n0nmnk9am8nlkbd0l14rlxip2rcx4w5g-duoids-0.0.1.0.drv[m
[1;34mBuilding /nix/store/z5i7y0hxmdcp07w36h4nfxc77vf4c7xf-vector-0.13.2.0.drv[m
[2m[duoids] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[duoids] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[vector] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[vector] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[duoids] [m[1;36mPhase: unpackPhase[m
[2m[duoids] [munpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./core
[2m[duoids] [msource root is core
[2m[duoids] [m[1;36mPhase: patchPhase[m
[2m[duoids] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[duoids] [msetupCompileFlags: -package-db=/build/tmp.TnaYfluo2b/setup-package.conf.d -threaded
[2m[duoids] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.TnaYfluo2b/Main.o )
[2m[vector] [m[1;36mPhase: unpackPhase[m
[2m[vector] [munpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
[2m[vector] [msource root is vector-0.13.2.0
[2m[vector] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
[2m[vector] [m[1;36mPhase: patchPhase[m
[2m[vector] [mReplace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
[2m[duoids] [m[2 of 2] Linking Setup
[2m[vector] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[vector] [msetupCompileFlags: -package-db=/build/tmp.jmocsFCm3c/setup-package.conf.d -threaded
[2m[vector] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.jmocsFCm3c/Main.o )
[2m[vector] [m[2 of 2] Linking Setup
[2m[duoids] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[duoids] [m[1;36mPhase: configurePhase[m
[2m[duoids] [mconfigureFlags: --verbose --prefix=/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.TnaYfluo2b/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 --ghc-options=-Werror --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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
[2m[duoids] [mUsing Parsec parser
[2m[duoids] [mConfiguring duoids-0.0.1.0...
[2m[vector] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[vector] [m[1;36mPhase: configurePhase[m
[2m[vector] [mconfigureFlags: --verbose --prefix=/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.jmocsFCm3c/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
[2m[vector] [mUsing Parsec parser
[2m[vector] [mConfiguring vector-0.13.2.0...
[2m[duoids] [mFlags chosen: noisy-deprecations=True, verify-no-recursion=False
[2m[vector] [mFlags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
[2m[vector] [mwall=False
[2m[vector] [mDependency base >=4.9 && <4.22: using base-4.19.0.0
[2m[vector] [mDependency deepseq >=1.1 && <1.6: using deepseq-1.5.0.0
[2m[vector] [mDependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
[2m[vector] [mDependency vector-stream >=0.1 && <0.2: using vector-stream-0.1.0.1
[2m[vector] [mDependency base: using base-4.19.0.0
[2m[vector] [mDependency random >=1.2: using random-1.2.1.3
[2m[vector] [mDependency tasty: using tasty-1.5.3
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
[2m[vector] [mDependency base >=4.5 && <5: using base-4.19.0.0
[2m[vector] [mDependency base-orphans >=0.6: using base-orphans-0.9.3
[2m[vector] [mDependency primitive: using primitive-0.9.1.0
[2m[vector] [mDependency random: using random-1.2.1.3
[2m[vector] [mDependency tasty: using tasty-1.5.3
[2m[vector] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[vector] [mDependency tasty-quickcheck: using tasty-quickcheck-0.11
[2m[vector] [mDependency template-haskell: using template-haskell-2.21.0.0
[2m[vector] [mDependency transformers >=0.2.0.0: using transformers-0.6.1.0
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
[2m[vector] [mDependency base >=4.5 && <5: using base-4.19.0.0
[2m[vector] [mDependency base-orphans >=0.6: using base-orphans-0.9.3
[2m[vector] [mDependency primitive: using primitive-0.9.1.0
[2m[vector] [mDependency random: using random-1.2.1.3
[2m[vector] [mDependency tasty: using tasty-1.5.3
[2m[vector] [mDependency tasty-hunit: using tasty-hunit-0.10.2
[2m[vector] [mDependency tasty-quickcheck: using tasty-quickcheck-0.11
[2m[vector] [mDependency template-haskell: using template-haskell-2.21.0.0
[2m[vector] [mDependency transformers >=0.2.0.0: using transformers-0.6.1.0
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency base: using base-4.19.0.0
[2m[vector] [mDependency doctest >=0.15 && <0.24: using doctest-0.22.6
[2m[vector] [mDependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency base: using base-4.19.0.0
[2m[vector] [mDependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
[2m[vector] [mDependency tasty: using tasty-1.5.3
[2m[vector] [mDependency tasty-inspection-testing >=0.1: using
[2m[vector] [mtasty-inspection-testing-0.2.1
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[duoids] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoids] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoids] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoids] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoids] [mDependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
[2m[duoids] [m<0.25: using doctest-0.22.6
[2m[duoids] [mDependency duoids: using duoids-0.0.1.0
[2m[duoids] [mSource component graph:
[2m[duoids] [m    component lib
[2m[duoids] [m    component test:doctests dependency lib
[2m[duoids] [mConfigured component graph:
[2m[duoids] [m    component duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [m        include base-4.19.0.0-b960
[2m[duoids] [m    component duoids-0.0.1.0-2vUxWGoDGDTCgyJ9X3qhaT-doctests
[2m[duoids] [m        include base-4.19.0.0-b960
[2m[duoids] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoids] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [mLinked component graph:
[2m[duoids] [m    unit duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [m        include base-4.19.0.0-b960
[2m[duoids] [m        Control.Duoidal=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Control.Duoidal,Control.Duoidal.Do=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Control.Duoidal.Do,Control.Duoidal.Either=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Control.Duoidal.Either,Control.Duoidal.Fail=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Control.Duoidal.Fail,Control.Duoidal.Fix=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Control.Duoidal.Fix,Control.Duoidal.Laws=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA:Data.Duoid.Laws
[2m[duoids] [m    unit duoids-0.0.1.0-2vUxWGoDGDTCgyJ9X3qhaT-doctests
[2m[duoids] [m        include base-4.19.0.0-b960
[2m[duoids] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoids] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [mReady component graph:
[2m[duoids] [m    definite duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [m        depends base-4.19.0.0-b960
[2m[duoids] [m    definite duoids-0.0.1.0-2vUxWGoDGDTCgyJ9X3qhaT-doctests
[2m[duoids] [m        depends base-4.19.0.0-b960
[2m[duoids] [m        depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoids] [m        depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [mUsing Cabal-3.12.1.0 compiled by ghc-9.8
[2m[duoids] [mUsing compiler: ghc-9.8.1
[2m[duoids] [mUsing install prefix:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0
[2m[duoids] [mExecutables installed in:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/bin
[2m[duoids] [mLibraries installed in:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [mDynamic Libraries installed in:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
[2m[duoids] [mPrivate executables installed in:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/duoids-0.0.1.0
[2m[duoids] [mData files installed in:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/duoids-0.0.1.0
[2m[duoids] [mDocumentation installed in:
[2m[duoids] [m/nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
[2m[duoids] [mConfiguration files installed in:
[2m[duoids] [m/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/etc
[2m[duoids] [mNo alex found
[2m[duoids] [mUsing ar found on system at:
[2m[duoids] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[duoids] [mNo c2hs found
[2m[duoids] [mNo cpphs found
[2m[duoids] [mUsing doctest version 0.22.6 found on system at:
[2m[duoids] [m/nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
[2m[duoids] [mUsing gcc version 14.3.0 given by user at:
[2m[duoids] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[duoids] [mUsing ghc version 9.8.1 found on system at:
[2m[duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[duoids] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[duoids] [mNo ghcjs found
[2m[duoids] [mNo ghcjs-pkg found
[2m[duoids] [mNo greencard found
[2m[duoids] [mUsing haddock version 2.30.0 found on system at:
[2m[duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[duoids] [mNo happy found
[2m[duoids] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[duoids] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[duoids] [mNo hmake found
[2m[duoids] [mUsing hpc version 0.69 found on system at:
[2m[duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[duoids] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[duoids] [mUsing hscolour version 1.25 found on system at:
[2m[duoids] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[duoids] [mNo jhc found
[2m[duoids] [mUsing ld found on system at:
[2m[duoids] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[duoids] [mNo pkg-config found
[2m[duoids] [mUsing runghc version 9.8.1 found on system at:
[2m[duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[duoids] [mUsing strip version 2.44 found on system at:
[2m[duoids] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[duoids] [mUsing tar found on system at:
[2m[duoids] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[duoids] [mNo uhc found
[2m[vector] [mSource component graph:
[2m[vector] [m    component lib
[2m[vector] [m    component lib:benchmarks-O2 dependency lib
[2m[vector] [m    component test:vector-doctest dependency lib
[2m[vector] [m    component test:vector-inspection dependency lib
[2m[vector] [m    component test:vector-tests-O0 dependency lib
[2m[vector] [m    component test:vector-tests-O2 dependency lib
[2m[vector] [mConfigured component graph:
[2m[vector] [m    component vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include deepseq-1.5.0.0-412f
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include vector-stream-0.1.0.1-1ROR3WR6vG9AVjHlNJubVk
[2m[vector] [m    component vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    component vector-0.13.2.0-1eGaHRODX4tFEt6A190OpQ-vector-doctest
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    component vector-0.13.2.0-2ebrAZXEXXi853buqytQYY-vector-inspection
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include tasty-inspection-testing-0.2.1-8C8dNDpjl7p97LTsz7awMh
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    component vector-0.13.2.0-DkOOETKrqPI8zkryteKkPv-vector-tests-O0
[2m[vector] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[vector] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[vector] [m        include template-haskell-2.21.0.0-8831
[2m[vector] [m        include transformers-0.6.1.0-c3ec
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    component vector-0.13.2.0-Cy29OZFnKYM7djuPVsYPEp-vector-tests-O2
[2m[vector] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[vector] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[vector] [m        include template-haskell-2.21.0.0-8831
[2m[vector] [m        include transformers-0.6.1.0-c3ec
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [mLinked component graph:
[2m[vector] [m    unit vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include deepseq-1.5.0.0-412f
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include vector-stream-0.1.0.1-1ROR3WR6vG9AVjHlNJubVk
[2m[vector] [m        Data.Vector=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Unboxed.Mutable
[2m[vector] [m    unit vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m        Bench.Vector.Algo.AwShCC=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.TestData.ParenTree
[2m[vector] [m    unit vector-0.13.2.0-1eGaHRODX4tFEt6A190OpQ-vector-doctest
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    unit vector-0.13.2.0-2ebrAZXEXXi853buqytQYY-vector-inspection
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include tasty-inspection-testing-0.2.1-8C8dNDpjl7p97LTsz7awMh
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    unit vector-0.13.2.0-DkOOETKrqPI8zkryteKkPv-vector-tests-O0
[2m[vector] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[vector] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[vector] [m        include template-haskell-2.21.0.0-8831
[2m[vector] [m        include transformers-0.6.1.0-c3ec
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    unit vector-0.13.2.0-Cy29OZFnKYM7djuPVsYPEp-vector-tests-O2
[2m[vector] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[vector] [m        include base-4.19.0.0-b960
[2m[vector] [m        include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[vector] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[vector] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[vector] [m        include template-haskell-2.21.0.0-8831
[2m[vector] [m        include transformers-0.6.1.0-c3ec
[2m[vector] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [mReady component graph:
[2m[vector] [m    definite vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m        depends base-4.19.0.0-b960
[2m[vector] [m        depends deepseq-1.5.0.0-412f
[2m[vector] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        depends vector-stream-0.1.0.1-1ROR3WR6vG9AVjHlNJubVk
[2m[vector] [m    definite vector-0.13.2.0-DkOOETKrqPI8zkryteKkPv-vector-tests-O0
[2m[vector] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[vector] [m        depends base-4.19.0.0-b960
[2m[vector] [m        depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[vector] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[vector] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[vector] [m        depends template-haskell-2.21.0.0-8831
[2m[vector] [m        depends transformers-0.6.1.0-c3ec
[2m[vector] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    definite vector-0.13.2.0-Cy29OZFnKYM7djuPVsYPEp-vector-tests-O2
[2m[vector] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[vector] [m        depends base-4.19.0.0-b960
[2m[vector] [m        depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
[2m[vector] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[vector] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[vector] [m        depends template-haskell-2.21.0.0-8831
[2m[vector] [m        depends transformers-0.6.1.0-c3ec
[2m[vector] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    definite vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
[2m[vector] [m        depends base-4.19.0.0-b960
[2m[vector] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[vector] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    definite vector-0.13.2.0-2ebrAZXEXXi853buqytQYY-vector-inspection
[2m[vector] [m        depends base-4.19.0.0-b960
[2m[vector] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[vector] [m        depends tasty-inspection-testing-0.2.1-8C8dNDpjl7p97LTsz7awMh
[2m[vector] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [m    definite vector-0.13.2.0-1eGaHRODX4tFEt6A190OpQ-vector-doctest
[2m[vector] [m        depends base-4.19.0.0-b960
[2m[vector] [m        depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[vector] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[vector] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[vector] [mUsing compiler: ghc-9.8.1
[2m[vector] [mUsing install prefix:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
[2m[vector] [mExecutables installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/bin
[2m[vector] [mLibraries installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[vector] [mDynamic Libraries installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[vector] [mPrivate executables installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.8.1/vector-0.13.2.0
[2m[vector] [mData files installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/share/x86_64-linux-ghc-9.8.1/vector-0.13.2.0
[2m[vector] [mDocumentation installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.8.1/vector-0.13.2.0
[2m[vector] [mConfiguration files installed in:
[2m[vector] [m/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/etc
[2m[vector] [mNo alex found
[2m[vector] [mUsing ar found on system at:
[2m[vector] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[vector] [mNo c2hs found
[2m[vector] [mNo cpphs found
[2m[vector] [mUsing doctest version 0.22.6 found on system at:
[2m[vector] [m/nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
[2m[vector] [mUsing gcc version 14.3.0 given by user at:
[2m[vector] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[vector] [mUsing ghc version 9.8.1 found on system at:
[2m[vector] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[vector] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[vector] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[vector] [mNo ghcjs found
[2m[vector] [mNo ghcjs-pkg found
[2m[vector] [mNo greencard found
[2m[vector] [mUsing haddock version 2.30.0 found on system at:
[2m[vector] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[vector] [mNo happy found
[2m[vector] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[vector] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[vector] [mNo hmake found
[2m[vector] [mUsing hpc version 0.69 found on system at:
[2m[vector] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[vector] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[vector] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[vector] [mUsing hscolour version 1.25 found on system at:
[2m[vector] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[vector] [mNo jhc found
[2m[vector] [mUsing ld found on system at:
[2m[vector] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[vector] [mNo pkg-config found
[2m[vector] [mUsing runghc version 9.8.1 found on system at:
[2m[vector] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[vector] [mUsing strip version 2.44 found on system at:
[2m[vector] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[vector] [mUsing tar found on system at:
[2m[vector] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[vector] [mNo uhc found
[2m[duoids] [m[1;36mPhase: buildPhase[m
[2m[duoids] [mPreprocessing library for duoids-0.0.1.0...
[2m[duoids] [mBuilding library for duoids-0.0.1.0...
[2m[vector] [m[1;36mPhase: buildPhase[m
[2m[duoids] [m[1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
[2m[vector] [mPreprocessing library for vector-0.13.2.0..
[2m[vector] [mBuilding library for vector-0.13.2.0..
[2m[duoids] [m[2 of 9] Compiling Data.Duoid       ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[duoids] [m[3 of 9] Compiling Control.Duoidal  ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
[2m[duoids] [m[4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.o, dist/build/Control/Duoidal/Fix.dyn_o )
[2m[duoids] [m[5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.o, dist/build/Control/Duoidal/Fail.dyn_o )
[2m[duoids] [m[6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
[2m[duoids] [m[7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.o, dist/build/Control/Duoidal/Do.dyn_o )
[2m[duoids] [m[8 of 9] Compiling Data.Duoid.Laws  ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
[2m[duoids] [m[9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
[2m[duoids] [m[1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
[2m[duoids] [m[2 of 9] Compiling Data.Duoid       ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
[2m[duoids] [m[3 of 9] Compiling Control.Duoidal  ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
[2m[vector] [m[ 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 )
[2m[duoids] [m[4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.p_o )
[2m[duoids] [m[5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.p_o )
[2m[duoids] [m[6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
[2m[duoids] [m[7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.p_o )
[2m[duoids] [m[8 of 9] Compiling Data.Duoid.Laws  ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
[2m[duoids] [m[9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
[2m[duoids] [mPreprocessing test suite 'doctests' for duoids-0.0.1.0...
[2m[duoids] [mBuilding test suite 'doctests' for duoids-0.0.1.0...
[2m[duoids] [m[1 of 2] Compiling Build_doctests   ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
[2m[duoids] [m[2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
[2m[duoids] [m[3 of 3] Linking dist/build/doctests/doctests
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[duoids] [m[1;36mPhase: checkPhase[m
[2m[vector] [m[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 )
[2m[duoids] [mRunning 1 test suites...
[2m[duoids] [mTest suite doctests: RUNNING...
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [m
[2m[duoids] [mon the commandline: warning: [GHC-98887]
[2m[duoids] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoids] [mExamples: 5  Tried: 5  Errors: 0  Failures: 0
[2m[duoids] [mTest suite doctests: PASS
[2m[duoids] [mTest suite logged to: dist/test/duoids-0.0.1.0-doctests.log
[2m[duoids] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[duoids] [m[1;36mPhase: haddockPhase[m
[2m[duoids] [mPreprocessing library for duoids-0.0.1.0...
[2m[duoids] [mRunning Haddock on library for duoids-0.0.1.0...
[2m[duoids] [m[1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
[2m[duoids] [m[2 of 9] Compiling Data.Duoid       ( src/Data/Duoid.hs, nothing )
[2m[duoids] [m[3 of 9] Compiling Control.Duoidal  ( src/Control/Duoidal.hs, nothing )
[2m[duoids] [m[4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, nothing )
[2m[duoids] [m[5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, nothing )
[2m[duoids] [m[6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
[2m[duoids] [m[7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, nothing )
[2m[duoids] [m[8 of 9] Compiling Data.Duoid.Laws  ( src/Data/Duoid/Laws.hs, nothing )
[2m[duoids] [m[9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
[2m[duoids] [mHaddock coverage:
[2m[duoids] [mWarning: 'cancel' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Par' is ambiguous. It is defined
[2m[duoids] [m    * at src/Data/Duoid.hs:53:17
[2m[duoids] [m    * at src/Data/Duoid.hs:53:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Data/Duoid.hs:53:1
[2m[duoids] [mWarning: 'Seq' is ambiguous. It is defined
[2m[duoids] [m    * at src/Data/Duoid.hs:59:17
[2m[duoids] [m    * at src/Data/Duoid.hs:59:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Data/Duoid.hs:59:1
[2m[duoids] [m 100% ( 10 / 10) in 'Data.Duoid'
[2m[duoids] [mWarning: 'ExceptT' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Parallel' is ambiguous. It is defined
[2m[duoids] [m    * at src/Control/Duoidal.hs:228:24
[2m[duoids] [m    * at src/Control/Duoidal.hs:228:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal.hs:228:1
[2m[duoids] [mWarning: 'Sequential' is ambiguous. It is defined
[2m[duoids] [m    * at src/Control/Duoidal.hs:243:26
[2m[duoids] [m    * at src/Control/Duoidal.hs:243:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal.hs:243:1
[2m[duoids] [mWarning: 'pure' is ambiguous. It is defined
[2m[duoids] [m    * in ‘GHC.Base’
[2m[duoids] [m    * at src/Control/Duoidal.hs:287:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal.hs:287:1
[2m[duoids] [mWarning: '<*' is ambiguous. It is defined
[2m[duoids] [m    * in ‘GHC.Base’
[2m[duoids] [m    * at src/Control/Duoidal.hs:345:3
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal.hs:345:3
[2m[duoids] [mWarning: 'return' is ambiguous. It is defined
[2m[duoids] [m    * in ‘GHC.Base’
[2m[duoids] [m    * at src/Control/Duoidal.hs:290:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal.hs:290:1
[2m[duoids] [mWarning: 'NoDefaultPrelude' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Validation' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'fail' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'MonadFail' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Commutative' is ambiguous. It is defined
[2m[duoids] [m    * at src/Control/Duoidal.hs:529:27
[2m[duoids] [m    * at src/Control/Duoidal.hs:529:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal.hs:529:1
[2m[duoids] [mWarning: 'Writer' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Set' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Char' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Normal' is ambiguous. It is defined
[2m[duoids] [m    * at src/Control/Duoidal.hs:279:1
[2m[duoids] [m    * at src/Data/Duoid.hs:74:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Data/Duoid.hs:74:1
[2m[duoids] [mWarning: 'empty' is ambiguous. It is defined
[2m[duoids] [m    * in ‘GHC.Base’
[2m[duoids] [m    * at src/Control/Duoidal/Async.hs:148:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal/Async.hs:148:1
[2m[duoids] [mWarning: 'Const' is ambiguous. It is defined
[2m[duoids] [m    * in ‘Data.Functor.Const’
[2m[duoids] [m    * in ‘Data.Functor.Const’
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined in ‘Data.Functor.Const’
[2m[duoids] [m  46% ( 28 / 60) in 'Control.Duoidal'
[2m[duoids] [m  Missing documentation for:
[2m[duoids] [m    DuoidalIO (src/Control/Duoidal.hs:470)
[2m[duoids] [m    Parallel (src/Control/Duoidal.hs:228)
[2m[duoids] [m    traverse_ (src/Control/Duoidal.hs:395)
[2m[duoids] [m    for (src/Control/Duoidal.hs:401)
[2m[duoids] [m    for_ (src/Control/Duoidal.hs:407)
[2m[duoids] [m    forever (src/Control/Duoidal.hs:427)
[2m[duoids] [m    Sequential (src/Control/Duoidal.hs:243)
[2m[duoids] [m    >> (src/Control/Duoidal.hs:339)
[2m[duoids] [m    >>= (src/Control/Duoidal.hs:450)
[2m[duoids] [m    >=> (src/Control/Duoidal.hs:460)
[2m[duoids] [m    =<< (src/Control/Duoidal.hs:455)
[2m[duoids] [m    <=< (src/Control/Duoidal.hs:465)
[2m[duoids] [m    join (src/Control/Duoidal.hs:447)
[2m[duoids] [m    ap (src/Control/Duoidal.hs:314)
[2m[duoids] [m    return (src/Control/Duoidal.hs:290)
[2m[duoids] [m    liftM2 (src/Control/Duoidal.hs:297)
[2m[duoids] [m    liftM3 (src/Control/Duoidal.hs:304)
[2m[duoids] [m    mapM (src/Control/Duoidal.hs:392)
[2m[duoids] [m    mapM_ (src/Control/Duoidal.hs:398)
[2m[duoids] [m    forM (src/Control/Duoidal.hs:404)
[2m[duoids] [m    forM_ (src/Control/Duoidal.hs:410)
[2m[duoids] [m    sequence (src/Control/Duoidal.hs:417)
[2m[duoids] [m    sequence_ (src/Control/Duoidal.hs:424)
[2m[duoids] [m    forever' (src/Control/Duoidal.hs:430)
[2m[duoids] [m    unless' (src/Control/Duoidal.hs:437)
[2m[duoids] [m    when' (src/Control/Duoidal.hs:444)
[2m[duoids] [m    normalPure (src/Control/Duoidal.hs:474)
[2m[duoids] [m    sequentialAp (src/Control/Duoidal.hs:490)
[2m[duoids] [m    sequentialBind (src/Control/Duoidal.hs:494)
[2m[duoids] [m    sequentialLiftA2 (src/Control/Duoidal.hs:485)
[2m[duoids] [m    sequentialPure (src/Control/Duoidal.hs:477)
[2m[duoids] [m    commutativeAp (src/Control/Duoidal.hs:544)
[2m[duoids] [mWarning: 'mfix' is ambiguous. It is defined
[2m[duoids] [m    * in ‘Control.Monad.Fix’
[2m[duoids] [m    * at src/Control/Duoidal/Fix.hs:30:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal/Fix.hs:30:1
[2m[duoids] [m 100% (  3 /  3) in 'Control.Duoidal.Fix'
[2m[duoids] [mWarning: 'fail' is ambiguous. It is defined
[2m[duoids] [m    * in ‘Control.Monad.Fail’
[2m[duoids] [m    * at src/Control/Duoidal/Fail.hs:33:1
[2m[duoids] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[duoids] [m    by specifying the type/value namespace explicitly.
[2m[duoids] [m    Defaulting to the one defined at src/Control/Duoidal/Fail.hs:33:1
[2m[duoids] [m 100% (  3 /  3) in 'Control.Duoidal.Fail'
[2m[duoids] [m 100% (  2 /  2) in 'Control.Duoidal.Either'
[2m[duoids] [m  55% (  5 /  9) in 'Control.Duoidal.Do'
[2m[duoids] [m  Missing documentation for:
[2m[duoids] [m    join (src/Control/Duoidal.hs:447)
[2m[duoids] [m    return (src/Control/Duoidal.hs:290)
[2m[duoids] [m    >> (src/Control/Duoidal.hs:339)
[2m[duoids] [m    >>= (src/Control/Duoidal.hs:450)
[2m[duoids] [m  16% (  2 / 12) in 'Data.Duoid.Laws'
[2m[duoids] [m  Missing documentation for:
[2m[duoids] [m    Law (src/Data/Duoid/Laws.hs:27)
[2m[duoids] [m    Laws (src/Data/Duoid/Laws.hs:49)
[2m[duoids] [m    getLaws (src/Data/Duoid/Laws.hs:57)
[2m[duoids] [m    NormalLaws (src/Data/Duoid/Laws.hs:70)
[2m[duoids] [m    getNormalLaws (src/Data/Duoid/Laws.hs:76)
[2m[duoids] [m    checkLaw (src/Data/Duoid/Laws.hs:30)
[2m[duoids] [m    interchangeLaw (src/Data/Duoid/Laws.hs:33)
[2m[duoids] [m    joinUnitLaw (src/Data/Duoid/Laws.hs:43)
[2m[duoids] [m    splitUnitLaw (src/Data/Duoid/Laws.hs:40)
[2m[duoids] [m    swapUnitLaw (src/Data/Duoid/Laws.hs:46)
[2m[duoids] [m  50% (  3 /  6) in 'Control.Duoidal.Laws'
[2m[duoids] [m  Missing documentation for:
[2m[duoids] [m    joinUnit (src/Control/Duoidal/Laws.hs:67)
[2m[duoids] [m    splitUnit (src/Control/Duoidal/Laws.hs:63)
[2m[duoids] [m    swapUnit (src/Control/Duoidal/Laws.hs:74)
[2m[duoids] [mWarning: Control.Duoidal: could not find link destinations for: 
[2m[duoids] [m	- Control.Duoidal.Async.empty
[2m[duoids] [mDocumentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
[2m[duoids] [mPreprocessing test suite 'doctests' for duoids-0.0.1.0...
[2m[duoids] [m[1;36mPhase: installPhase[m
[2m[duoids] [mInstalling library in /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids] [m[1;36mPhase: fixupPhase[m
[2m[duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0
[2m[duoids] [mshrinking /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSduoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA-ghc9.8.1.so
[2m[duoids] [mchecking for references to /build/ in /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0...
[2m[duoids] [mpatching script interpreter paths in /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0
[2m[duoids] [mstripping (with command strip and flags -S -p) in  /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0/lib
[2m[duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc
[2m[duoids] [mchecking for references to /build/ in /nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc...
[2m[duoids] [mpatching script interpreter paths in /nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc
[2m[duoids:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0[m
[2m[duoids:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[duoids:post-build] [m[2m[m
[2m[duoids:post-build] [m[2mPushing /nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc (2.08 MiB)[m
[2m[duoids:post-build] [m[2mPushing /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0 (7.86 MiB)[m
[2m[duoids:post-build] [m[2m[m
[2m[duoids:post-build] [m[2mAll done.[m
[2m[duoids:post-build] [m[2mUploading to the NixCI cache: /nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc /nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0[m
[2m[duoids:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[duoids:post-build] [m[2mcopying 2 paths...[m
[2m[duoids:post-build] [m[2mcopying path '/nix/store/98vjsdn8y4p58l1kzy2k1zh8ibrjf3wb-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[duoids:post-build] [m[2mcopying path '/nix/store/nrliqczs0707vpm7yw270pxw0wp66n0c-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[duoids:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[duoids:post-build] [m[2mcopying 2 paths...[m
[2m[duoids:post-build] [m[2mcopying path '/nix/store/y08wg26sv32vrri8xb57rx76fnc989l7-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...[m
[2m[duoids:post-build] [m[2mcopying path '/nix/store/n0nmnk9am8nlkbd0l14rlxip2rcx4w5g-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 24 of 61 built (1 building)[m
[1;34mBuilding /nix/store/03k13pdr86fy2qlbgg46181bj0nzp2k0-duoidal-transformers-0.0.1.0.drv[m
[2m[vector] [m[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 )
[2m[vector] [m[13 of 23] Compiling Data.Vector      ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
[2m[duoidal-transformers] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[duoidal-transformers] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[duoidal-transformers] [m[1;36mPhase: unpackPhase[m
[2m[duoidal-transformers] [munpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./transformers
[2m[duoidal-transformers] [msource root is transformers
[2m[duoidal-transformers] [m[1;36mPhase: patchPhase[m
[2m[duoidal-transformers] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[duoidal-transformers] [msetupCompileFlags: -package-db=/build/tmp.VR5KMKmdrE/setup-package.conf.d -threaded
[2m[duoidal-transformers] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.VR5KMKmdrE/Main.o )
[2m[duoidal-transformers] [m[2 of 2] Linking Setup
[2m[duoidal-transformers] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[duoidal-transformers] [m[1;36mPhase: configurePhase[m
[2m[duoidal-transformers] [mconfigureFlags: --verbose --prefix=/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.VR5KMKmdrE/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 --ghc-options=-Werror --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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
[2m[duoidal-transformers] [mUsing Parsec parser
[2m[duoidal-transformers] [mConfiguring duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [mFlags chosen: noisy-deprecations=True, verify-no-recursion=False
[2m[duoidal-transformers] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoidal-transformers] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoidal-transformers] [mDependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
[2m[duoidal-transformers] [mDependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.0
[2m[duoidal-transformers] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoidal-transformers] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoidal-transformers] [mDependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
[2m[duoidal-transformers] [m<0.25: using doctest-0.22.6
[2m[duoidal-transformers] [mDependency duoidal-transformers: using duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mSource component graph:
[2m[duoidal-transformers] [m    component lib
[2m[duoidal-transformers] [m    component test:doctests dependency lib
[2m[duoidal-transformers] [mConfigured component graph:
[2m[duoidal-transformers] [m    component duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [m        include base-4.19.0.0-b960
[2m[duoidal-transformers] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoidal-transformers] [m        include transformers-0.6.1.0-c3ec
[2m[duoidal-transformers] [m    component duoidal-transformers-0.0.1.0-4IAzFpuBvKsE91xrRBuatJ-doctests
[2m[duoidal-transformers] [m        include base-4.19.0.0-b960
[2m[duoidal-transformers] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoidal-transformers] [m        include duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [mLinked component graph:
[2m[duoidal-transformers] [m    unit duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [m        include base-4.19.0.0-b960
[2m[duoidal-transformers] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoidal-transformers] [m        include transformers-0.6.1.0-c3ec
[2m[duoidal-transformers] [m        Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE:Control.Duoidal.Trans.Orphans
[2m[duoidal-transformers] [m    unit duoidal-transformers-0.0.1.0-4IAzFpuBvKsE91xrRBuatJ-doctests
[2m[duoidal-transformers] [m        include base-4.19.0.0-b960
[2m[duoidal-transformers] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoidal-transformers] [m        include duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [mReady component graph:
[2m[duoidal-transformers] [m    definite duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [m        depends base-4.19.0.0-b960
[2m[duoidal-transformers] [m        depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoidal-transformers] [m        depends transformers-0.6.1.0-c3ec
[2m[duoidal-transformers] [m    definite duoidal-transformers-0.0.1.0-4IAzFpuBvKsE91xrRBuatJ-doctests
[2m[duoidal-transformers] [m        depends base-4.19.0.0-b960
[2m[duoidal-transformers] [m        depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoidal-transformers] [m        depends duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [mUsing Cabal-3.12.1.0 compiled by ghc-9.8
[2m[duoidal-transformers] [mUsing compiler: ghc-9.8.1
[2m[duoidal-transformers] [mUsing install prefix:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mExecutables installed in:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/bin
[2m[duoidal-transformers] [mLibraries installed in:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [mDynamic Libraries installed in:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
[2m[duoidal-transformers] [mPrivate executables installed in:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mData files installed in:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mDocumentation installed in:
[2m[duoidal-transformers] [m/nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mConfiguration files installed in:
[2m[duoidal-transformers] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/etc
[2m[duoidal-transformers] [mNo alex found
[2m[duoidal-transformers] [mUsing ar found on system at:
[2m[duoidal-transformers] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[duoidal-transformers] [mNo c2hs found
[2m[duoidal-transformers] [mNo cpphs found
[2m[duoidal-transformers] [mUsing doctest version 0.22.6 found on system at:
[2m[duoidal-transformers] [m/nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
[2m[duoidal-transformers] [mUsing gcc version 14.3.0 given by user at:
[2m[duoidal-transformers] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[duoidal-transformers] [mUsing ghc version 9.8.1 found on system at:
[2m[duoidal-transformers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[duoidal-transformers] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[duoidal-transformers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[duoidal-transformers] [mNo ghcjs found
[2m[duoidal-transformers] [mNo ghcjs-pkg found
[2m[duoidal-transformers] [mNo greencard found
[2m[duoidal-transformers] [mUsing haddock version 2.30.0 found on system at:
[2m[duoidal-transformers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[duoidal-transformers] [mNo happy found
[2m[duoidal-transformers] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[duoidal-transformers] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[duoidal-transformers] [mNo hmake found
[2m[duoidal-transformers] [mUsing hpc version 0.69 found on system at:
[2m[duoidal-transformers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[duoidal-transformers] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[duoidal-transformers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[duoidal-transformers] [mUsing hscolour version 1.25 found on system at:
[2m[duoidal-transformers] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[duoidal-transformers] [mNo jhc found
[2m[duoidal-transformers] [mUsing ld found on system at:
[2m[duoidal-transformers] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[duoidal-transformers] [mNo pkg-config found
[2m[duoidal-transformers] [mUsing runghc version 9.8.1 found on system at:
[2m[duoidal-transformers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[duoidal-transformers] [mUsing strip version 2.44 found on system at:
[2m[duoidal-transformers] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[duoidal-transformers] [mUsing tar found on system at:
[2m[duoidal-transformers] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[duoidal-transformers] [mNo uhc found
[2m[duoidal-transformers] [m[1;36mPhase: buildPhase[m
[2m[duoidal-transformers] [mPreprocessing library for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [mBuilding library for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [m[1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.o, dist/build/Control/Duoidal/Trans/Class.dyn_o )
[2m[duoidal-transformers] [m[2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.o, dist/build/Control/Duoidal/Trans/Orphans.dyn_o )
[2m[duoidal-transformers] [m[1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.p_o )
[2m[duoidal-transformers] [m[2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.p_o )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[duoidal-transformers] [mPreprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [mBuilding test suite 'doctests' for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [m[1 of 2] Compiling Build_doctests   ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[duoidal-transformers] [m[2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
[2m[duoidal-transformers] [m[3 of 3] Linking dist/build/doctests/doctests
[2m[duoidal-transformers] [m[1;36mPhase: checkPhase[m
[2m[duoidal-transformers] [mRunning 1 test suites...
[2m[duoidal-transformers] [mTest suite doctests: RUNNING...
[2m[duoidal-transformers] [m
[2m[duoidal-transformers] [mon the commandline: warning: [GHC-98887]
[2m[duoidal-transformers] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoidal-transformers] [m
[2m[duoidal-transformers] [mon the commandline: warning: [GHC-98887]
[2m[duoidal-transformers] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoidal-transformers] [m
[2m[duoidal-transformers] [mon the commandline: warning: [GHC-98887]
[2m[duoidal-transformers] [m    -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
[2m[duoidal-transformers] [mExamples: 0  Tried: 0  Errors: 0  Failures: 0
[2m[duoidal-transformers] [mTest suite doctests: PASS
[2m[duoidal-transformers] [mTest suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
[2m[duoidal-transformers] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[duoidal-transformers] [m[1;36mPhase: haddockPhase[m
[2m[duoidal-transformers] [mPreprocessing library for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [mRunning Haddock on library for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [m[1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
[2m[duoidal-transformers] [m[2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
[2m[duoidal-transformers] [mHaddock coverage:
[2m[duoidal-transformers] [m  33% (  1 /  3) in 'Control.Duoidal.Trans.Class'
[2m[duoidal-transformers] [m  Missing documentation for:
[2m[duoidal-transformers] [m    DuoidalTrans (src/Control/Duoidal/Trans/Class.hs:18)
[2m[duoidal-transformers] [m    NormalTrans (src/Control/Duoidal/Trans/Class.hs:22)
[2m[duoidal-transformers] [m 100% (  1 /  1) in 'Control.Duoidal.Trans.Orphans'
[2m[duoidal-transformers] [mDocumentation created: dist/doc/html/duoidal-transformers/,
[2m[duoidal-transformers] [mdist/doc/html/duoidal-transformers/duoidal-transformers.txt
[2m[duoidal-transformers] [mPreprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [m[1;36mPhase: installPhase[m
[2m[vector] [m[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 )
[2m[duoidal-transformers] [mInstalling library in /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE
[2m[duoidal-transformers] [m[1;36mPhase: fixupPhase[m
[2m[duoidal-transformers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mshrinking /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSduoidal-transformers-0.0.1.0-LPsjtWshTNV8ZSM0ZdVhUE-ghc9.8.1.so
[2m[duoidal-transformers] [mchecking for references to /build/ in /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [mpatching script interpreter paths in /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mstripping (with command strip and flags -S -p) in  /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/lib
[2m[duoidal-transformers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc
[2m[duoidal-transformers] [mchecking for references to /build/ in /nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc...
[2m[duoidal-transformers] [mpatching script interpreter paths in /nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc
[2m[duoidal-transformers:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0 /nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc[m
[2m[duoidal-transformers:post-build] [m[2mPushing 2 paths (68 are already present) using zstd to cache sellout ⏳[m
[2m[duoidal-transformers:post-build] [m[2m[m
[2m[duoidal-transformers:post-build] [m[2mPushing /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0 (636.69 KiB)[m
[2m[duoidal-transformers:post-build] [m[2mPushing /nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc (343.95 KiB)[m
[2m[duoidal-transformers:post-build] [m[2m[m
[2m[duoidal-transformers:post-build] [m[2mAll done.[m
[2m[duoidal-transformers:post-build] [m[2mUploading to the NixCI cache: /nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0 /nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc[m
[2m[duoidal-transformers:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[duoidal-transformers:post-build] [m[2mcopying 2 paths...[m
[2m[duoidal-transformers:post-build] [m[2mcopying path '/nix/store/pyli22dy7cadr1zyymz2y1shakhsvr3w-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[duoidal-transformers:post-build] [m[2mcopying path '/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[duoidal-transformers:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[duoidal-transformers:post-build] [m[2mcopying 1 paths...[m
[2m[duoidal-transformers:post-build] [m[2mcopying path '/nix/store/03k13pdr86fy2qlbgg46181bj0nzp2k0-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 25 of 60 built (1 building)[m
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
[2m[vector] [m[ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
[2m[vector] [m[ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
[33mWaiting for lock on hashable-1.4.7.0-doc[m
[2m[vector] [m[10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
[2m[vector] [m[11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
[2m[vector] [m[12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
[2m[vector] [m[13 of 23] Compiling Data.Vector      ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
[2m[vector] [m[14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
[2m[vector] [m[15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
[2m[vector] [m[16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
[2m[vector] [m[17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
[2m[vector] [m[18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
[2m[vector] [m[19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
[2m[vector] [m[20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
[33mWaiting for lock on OneTuple[m
[33mWaiting for lock on async-2.2.5-doc[m
[33mWaiting for lock on case-insensitive[m
[33mWaiting for lock on constraints-0.14.2-doc[m
[33mWaiting for lock on data-fix-0.3.4-doc[m
[33mWaiting for lock on text-short-0.1.6-doc[m
[33mWaiting for lock on these-1.2.1-doc[m
[33mWaiting for lock on time-compat-1.9.7-doc[m
[33mWaiting for lock on uuid-types[m
[2m[vector] [m[21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
[2m[vector] [m[22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
[2m[vector] [m[23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
[2m[vector] [mPreprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-tests-O0' for vector-0.13.2.0..
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:244:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m244 |[0m[0m postscanl f z = [;1m[35mtail[0m[0m . scanl f z
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:245:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m245 |[0m[0m prescanr f z = [;1m[35mtail[0m[0m . scanr f z
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                ^^^^[0m[0m
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:243:68: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m243 |[0m[0m     prop_head      :: P (v a -> a) = not . V.null ===> V.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                                                                    ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:256:76: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m256 |[0m[0m     prop_unsafeHead  :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                                                                            ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:272:65: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m272 |[0m[0m     prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                                                                 ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:439:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m439 |[0m[0m       = V.uniq `eq` (map [;1m[35mhead[0m[0m . group)
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                          ^^^^[0m[0m
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:76:77: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m
[2m[vector] [m[;1m[34m76 |[0m[0m     prop_head      :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m[;1m[35m                                                                             ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:92:83: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m
[2m[vector] [m[;1m[34m92 |[0m[0m     prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m[;1m[35m                                                                                   ^^^^[0m[0m
[2m[vector] [m[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 )
[2m[vector] [m[13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
[2m[vector] [mPreprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-tests-O2' for vector-0.13.2.0..
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:244:17: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m244 |[0m[0m postscanl f z = [;1m[35mtail[0m[0m . scanl f z
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                 ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Utilities.hs:245:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m245 |[0m[0m prescanr f z = [;1m[35mtail[0m[0m . scanr f z
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                ^^^^[0m[0m
[2m[vector] [m[ 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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:243:68: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m243 |[0m[0m     prop_head      :: P (v a -> a) = not . V.null ===> V.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                                                                    ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:256:76: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m256 |[0m[0m     prop_unsafeHead  :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                                                                            ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:272:65: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m272 |[0m[0m     prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                                                                 ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Vector/Property.hs:439:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Data.List, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m    |[0m[0m
[2m[vector] [m[;1m[34m439 |[0m[0m       = V.uniq `eq` (map [;1m[35mhead[0m[0m . group)
[2m[vector] [m[;1m[34m    |[0m[0m[;1m[35m                          ^^^^[0m[0m
[2m[vector] [m[ 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 )
[33mWaiting for lock on strict-0.5.1-doc[m
[1;34mBuilding /nix/store/wxj321dsm5sck42k4ycslrx5yix7s50r-concurrent-output-1.10.21.drv[m
[1;34mBuilding /nix/store/cq1rl98xdxmq4arzik17y96vramz4l6y-logict-0.8.2.0.drv[m
[2m[concurrent-output] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[concurrent-output] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[logict] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[logict] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[concurrent-output] [m[1;36mPhase: unpackPhase[m
[2m[concurrent-output] [munpacking source archive /nix/store/pyf7k374ldp9mk2h62dn593zrkammpq9-concurrent-output-1.10.21.tar.gz
[2m[concurrent-output] [msource root is concurrent-output-1.10.21
[2m[concurrent-output] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "concurrent-output-1.10.21/Utility/Monad.hs"
[2m[concurrent-output] [m[1;36mPhase: patchPhase[m
[2m[concurrent-output] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[concurrent-output] [msetupCompileFlags: -package-db=/build/tmp.7LT1S4476Y/setup-package.conf.d -threaded
[2m[logict] [m[1;36mPhase: unpackPhase[m
[2m[logict] [munpacking source archive /nix/store/8bm3ahkqr8f35z3yrz2jbmxmmv77hvk5-logict-0.8.2.0.tar.gz
[2m[logict] [msource root is logict-0.8.2.0
[2m[logict] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "logict-0.8.2.0/test/Test.hs"
[2m[concurrent-output] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.7LT1S4476Y/Main.o )
[2m[logict] [m[1;36mPhase: patchPhase[m
[2m[logict] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[logict] [msetupCompileFlags: -package-db=/build/tmp.uWFGiKnwJN/setup-package.conf.d -threaded
[2m[logict] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.uWFGiKnwJN/Main.o )
[2m[concurrent-output] [m[2 of 2] Linking Setup
[2m[logict] [m[2 of 2] Linking Setup
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:76:77: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘head’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m
[2m[vector] [m[;1m[34m76 |[0m[0m     prop_head      :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` [;1m[35mhead[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m[;1m[35m                                                                             ^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:92:83: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    In the use of ‘tail’
[2m[vector] [m    (imported from Prelude, but defined in GHC.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m
[2m[vector] [m[;1m[34m92 |[0m[0m     prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` [;1m[35mtail[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m[;1m[35m                                                                                   ^^^^[0m[0m
[2m[vector] [m[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 )
[2m[vector] [m[13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
[2m[concurrent-output] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[concurrent-output] [m[1;36mPhase: configurePhase[m
[2m[concurrent-output] [mconfigureFlags: --verbose --prefix=/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc/share/doc/concurrent-output-1.10.21 --with-gcc=gcc --package-db=/build/tmp.7LT1S4476Y/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[concurrent-output] [mUsing Parsec parser
[2m[concurrent-output] [mConfiguring concurrent-output-1.10.21...
[2m[logict] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[logict] [m[1;36mPhase: configurePhase[m
[2m[logict] [mconfigureFlags: --verbose --prefix=/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc/share/doc/logict-0.8.2.0 --with-gcc=gcc --package-db=/build/tmp.uWFGiKnwJN/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[logict] [mUsing Parsec parser
[2m[logict] [mConfiguring logict-0.8.2.0...
[2m[concurrent-output] [mDependency ansi-terminal >=0.6.2 && <1.2.0: using ansi-terminal-1.1.2
[2m[concurrent-output] [mDependency async >=2.0 && <2.3: using async-2.2.5
[2m[concurrent-output] [mDependency base >=4.6 && <5: using base-4.19.0.0
[2m[concurrent-output] [mDependency directory >=1.2.0 && <1.4.0: using directory-1.3.8.1
[2m[concurrent-output] [mDependency exceptions >=0.6.0 && <0.11.0: using exceptions-0.10.7
[2m[concurrent-output] [mDependency process >=1.6.0 && <1.7.0: using process-1.6.18.0
[2m[concurrent-output] [mDependency stm >=2.0 && <2.6: using stm-2.5.2.1
[2m[concurrent-output] [mDependency terminal-size >=0.3.0 && <0.4.0: using terminal-size-0.3.4
[2m[concurrent-output] [mDependency text >=0.11.0 && <2.2: using text-2.1
[2m[concurrent-output] [mDependency transformers >=0.3.0 && <0.7.0: using transformers-0.6.1.0
[2m[concurrent-output] [mDependency unix >=2.7.0 && <2.9.0: using unix-2.8.3.0
[2m[logict] [mDependency base >=4.9 && <5: using base-4.19.0.0
[2m[logict] [mDependency exceptions <0.11: using exceptions-0.10.7
[2m[logict] [mDependency mtl >=2.0 && <2.4: using mtl-2.3.1
[2m[logict] [mDependency transformers <0.7: using transformers-0.6.1.0
[2m[logict] [mDependency async >=2.0 && <2.3: using async-2.2.5
[2m[logict] [mDependency base: using base-4.19.0.0
[2m[logict] [mDependency logict: using logict-0.8.2.0
[2m[logict] [mDependency mtl: using mtl-2.3.1
[2m[logict] [mDependency tasty <1.6: using tasty-1.5.3
[2m[logict] [mDependency tasty-hunit <0.11: using tasty-hunit-0.10.2
[2m[logict] [mDependency transformers: using transformers-0.6.1.0
[2m[vector] [mPreprocessing library 'benchmarks-O2' for vector-0.13.2.0..
[2m[vector] [mBuilding library 'benchmarks-O2' for vector-0.13.2.0..
[2m[vector] [m[ 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 )
[2m[concurrent-output] [mSource component graph: component lib
[2m[concurrent-output] [mConfigured component graph:
[2m[concurrent-output] [m    component concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[concurrent-output] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[concurrent-output] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[concurrent-output] [m        include base-4.19.0.0-b960
[2m[concurrent-output] [m        include directory-1.3.8.1-6a8e
[2m[concurrent-output] [m        include exceptions-0.10.7-d3e7
[2m[concurrent-output] [m        include process-1.6.18.0-26fa
[2m[concurrent-output] [m        include stm-2.5.2.1-83fa
[2m[concurrent-output] [m        include terminal-size-0.3.4-5hKeclKVOXd1xpPBCS8qCM
[2m[concurrent-output] [m        include text-2.1-c36a
[2m[concurrent-output] [m        include transformers-0.6.1.0-c3ec
[2m[concurrent-output] [m        include unix-2.8.3.0-8aa6
[2m[concurrent-output] [mLinked component graph:
[2m[concurrent-output] [m    unit concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[concurrent-output] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[concurrent-output] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[concurrent-output] [m        include base-4.19.0.0-b960
[2m[concurrent-output] [m        include directory-1.3.8.1-6a8e
[2m[concurrent-output] [m        include exceptions-0.10.7-d3e7
[2m[concurrent-output] [m        include process-1.6.18.0-26fa
[2m[concurrent-output] [m        include stm-2.5.2.1-83fa
[2m[concurrent-output] [m        include terminal-size-0.3.4-5hKeclKVOXd1xpPBCS8qCM
[2m[concurrent-output] [m        include text-2.1-c36a
[2m[concurrent-output] [m        include transformers-0.6.1.0-c3ec
[2m[concurrent-output] [m        include unix-2.8.3.0-8aa6
[2m[concurrent-output] [m        System.Console.Concurrent=concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK:System.Console.Concurrent,System.Console.Concurrent.Internal=concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK:System.Console.Concurrent.Internal,System.Console.Regions=concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK:System.Console.Regions,System.Process.Concurrent=concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK:System.Process.Concurrent
[2m[concurrent-output] [mReady component graph:
[2m[concurrent-output] [m    definite concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[concurrent-output] [m        depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[concurrent-output] [m        depends async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[concurrent-output] [m        depends base-4.19.0.0-b960
[2m[concurrent-output] [m        depends directory-1.3.8.1-6a8e
[2m[concurrent-output] [m        depends exceptions-0.10.7-d3e7
[2m[concurrent-output] [m        depends process-1.6.18.0-26fa
[2m[concurrent-output] [m        depends stm-2.5.2.1-83fa
[2m[concurrent-output] [m        depends terminal-size-0.3.4-5hKeclKVOXd1xpPBCS8qCM
[2m[concurrent-output] [m        depends text-2.1-c36a
[2m[concurrent-output] [m        depends transformers-0.6.1.0-c3ec
[2m[concurrent-output] [m        depends unix-2.8.3.0-8aa6
[2m[concurrent-output] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[concurrent-output] [mUsing compiler: ghc-9.8.1
[2m[concurrent-output] [mUsing install prefix:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21
[2m[concurrent-output] [mExecutables installed in:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/bin
[2m[concurrent-output] [mLibraries installed in:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[concurrent-output] [mDynamic Libraries installed in:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[concurrent-output] [mPrivate executables installed in:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/libexec/x86_64-linux-ghc-9.8.1/concurrent-output-1.10.21
[2m[concurrent-output] [mData files installed in:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/share/x86_64-linux-ghc-9.8.1/concurrent-output-1.10.21
[2m[concurrent-output] [mDocumentation installed in:
[2m[concurrent-output] [m/nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc/share/doc/concurrent-output-1.10.21
[2m[concurrent-output] [mConfiguration files installed in:
[2m[concurrent-output] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/etc
[2m[concurrent-output] [mNo alex found
[2m[concurrent-output] [mUsing ar found on system at:
[2m[concurrent-output] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[concurrent-output] [mNo c2hs found
[2m[concurrent-output] [mNo cpphs found
[2m[concurrent-output] [mNo doctest found
[2m[concurrent-output] [mUsing gcc version 14.3.0 given by user at:
[2m[concurrent-output] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[concurrent-output] [mUsing ghc version 9.8.1 found on system at:
[2m[concurrent-output] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[concurrent-output] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[concurrent-output] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[concurrent-output] [mNo ghcjs found
[2m[concurrent-output] [mNo ghcjs-pkg found
[2m[concurrent-output] [mNo greencard found
[2m[concurrent-output] [mUsing haddock version 2.30.0 found on system at:
[2m[concurrent-output] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[concurrent-output] [mNo happy found
[2m[concurrent-output] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[concurrent-output] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[concurrent-output] [mNo hmake found
[2m[concurrent-output] [mUsing hpc version 0.69 found on system at:
[2m[concurrent-output] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[concurrent-output] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[concurrent-output] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[concurrent-output] [mUsing hscolour version 1.25 found on system at:
[2m[concurrent-output] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[concurrent-output] [mNo jhc found
[2m[concurrent-output] [mUsing ld found on system at:
[2m[concurrent-output] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[concurrent-output] [mNo pkg-config found
[2m[concurrent-output] [mUsing runghc version 9.8.1 found on system at:
[2m[concurrent-output] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[concurrent-output] [mUsing strip version 2.44 found on system at:
[2m[concurrent-output] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[concurrent-output] [mUsing tar found on system at:
[2m[concurrent-output] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[concurrent-output] [mNo uhc found
[2m[logict] [mSource component graph:
[2m[logict] [m    component lib
[2m[logict] [m    component test:logict-tests dependency lib
[2m[logict] [mConfigured component graph:
[2m[logict] [m    component logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m        include base-4.19.0.0-b960
[2m[logict] [m        include exceptions-0.10.7-d3e7
[2m[logict] [m        include mtl-2.3.1-63a4
[2m[logict] [m        include transformers-0.6.1.0-c3ec
[2m[logict] [m    component logict-0.8.2.0-G6ln1PFngle8D68CxXFfLm-logict-tests
[2m[logict] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[logict] [m        include base-4.19.0.0-b960
[2m[logict] [m        include logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m        include mtl-2.3.1-63a4
[2m[logict] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[logict] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[logict] [m        include transformers-0.6.1.0-c3ec
[2m[logict] [mLinked component graph:
[2m[logict] [m    unit logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m        include base-4.19.0.0-b960
[2m[logict] [m        include exceptions-0.10.7-d3e7
[2m[logict] [m        include mtl-2.3.1-63a4
[2m[logict] [m        include transformers-0.6.1.0-c3ec
[2m[logict] [m        Control.Monad.Logic=logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt:Control.Monad.Logic,Control.Monad.Logic.Class=logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt:Control.Monad.Logic.Class
[2m[logict] [m    unit logict-0.8.2.0-G6ln1PFngle8D68CxXFfLm-logict-tests
[2m[logict] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[logict] [m        include base-4.19.0.0-b960
[2m[logict] [m        include logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m        include mtl-2.3.1-63a4
[2m[logict] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[logict] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[logict] [m        include transformers-0.6.1.0-c3ec
[2m[logict] [mReady component graph:
[2m[logict] [m    definite logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m        depends base-4.19.0.0-b960
[2m[logict] [m        depends exceptions-0.10.7-d3e7
[2m[logict] [m        depends mtl-2.3.1-63a4
[2m[logict] [m        depends transformers-0.6.1.0-c3ec
[2m[logict] [m    definite logict-0.8.2.0-G6ln1PFngle8D68CxXFfLm-logict-tests
[2m[logict] [m        depends async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[logict] [m        depends base-4.19.0.0-b960
[2m[logict] [m        depends logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m        depends mtl-2.3.1-63a4
[2m[logict] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[logict] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[logict] [m        depends transformers-0.6.1.0-c3ec
[2m[logict] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[logict] [mUsing compiler: ghc-9.8.1
[2m[logict] [mUsing install prefix:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0
[2m[logict] [mExecutables installed in:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/bin
[2m[logict] [mLibraries installed in:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [mDynamic Libraries installed in:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[logict] [mPrivate executables installed in:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/libexec/x86_64-linux-ghc-9.8.1/logict-0.8.2.0
[2m[logict] [mData files installed in:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/share/x86_64-linux-ghc-9.8.1/logict-0.8.2.0
[2m[logict] [mDocumentation installed in:
[2m[logict] [m/nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc/share/doc/logict-0.8.2.0
[2m[logict] [mConfiguration files installed in:
[2m[logict] [m/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/etc
[2m[logict] [mNo alex found
[2m[logict] [mUsing ar found on system at:
[2m[logict] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[logict] [mNo c2hs found
[2m[logict] [mNo cpphs found
[2m[logict] [mNo doctest found
[2m[logict] [mUsing gcc version 14.3.0 given by user at:
[2m[logict] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[logict] [mUsing ghc version 9.8.1 found on system at:
[2m[logict] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[logict] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[logict] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[logict] [mNo ghcjs found
[2m[logict] [mNo ghcjs-pkg found
[2m[logict] [mNo greencard found
[2m[logict] [mUsing haddock version 2.30.0 found on system at:
[2m[logict] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[logict] [mNo happy found
[2m[logict] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[logict] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[logict] [mNo hmake found
[2m[logict] [mUsing hpc version 0.69 found on system at:
[2m[logict] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[logict] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[logict] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[logict] [mUsing hscolour version 1.25 found on system at:
[2m[logict] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[logict] [mNo jhc found
[2m[logict] [mUsing ld found on system at:
[2m[logict] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[logict] [mNo pkg-config found
[2m[logict] [mUsing runghc version 9.8.1 found on system at:
[2m[logict] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[logict] [mUsing strip version 2.44 found on system at:
[2m[logict] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[logict] [mUsing tar found on system at:
[2m[logict] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[logict] [mNo uhc found
[2m[concurrent-output] [m[1;36mPhase: buildPhase[m
[2m[logict] [m[1;36mPhase: buildPhase[m
[2m[concurrent-output] [mPreprocessing library for concurrent-output-1.10.21..
[2m[concurrent-output] [mBuilding library for concurrent-output-1.10.21..
[2m[logict] [mPreprocessing library for logict-0.8.2.0..
[2m[logict] [mBuilding library for logict-0.8.2.0..
[2m[concurrent-output] [m[1 of 6] Compiling Utility.Exception ( Utility/Exception.hs, dist/build/Utility/Exception.o, dist/build/Utility/Exception.dyn_o )
[2m[logict] [m[1 of 2] Compiling Control.Monad.Logic.Class ( Control/Monad/Logic/Class.hs, dist/build/Control/Monad/Logic/Class.o, dist/build/Control/Monad/Logic/Class.dyn_o )
[2m[concurrent-output] [m[2 of 6] Compiling Utility.Monad    ( Utility/Monad.hs, dist/build/Utility/Monad.o, dist/build/Utility/Monad.dyn_o )
[2m[concurrent-output] [m[3 of 6] Compiling System.Console.Concurrent.Internal ( System/Console/Concurrent/Internal.hs, dist/build/System/Console/Concurrent/Internal.o, dist/build/System/Console/Concurrent/Internal.dyn_o )
[2m[logict] [m[2 of 2] Compiling Control.Monad.Logic ( Control/Monad/Logic.hs, dist/build/Control/Monad/Logic.o, dist/build/Control/Monad/Logic.dyn_o )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[concurrent-output] [m[4 of 6] Compiling System.Console.Concurrent ( System/Console/Concurrent.hs, dist/build/System/Console/Concurrent.o, dist/build/System/Console/Concurrent.dyn_o )
[2m[concurrent-output] [m[5 of 6] Compiling System.Process.Concurrent ( System/Process/Concurrent.hs, dist/build/System/Process/Concurrent.o, dist/build/System/Process/Concurrent.dyn_o )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[ 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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[vector] [m[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 )
[2m[concurrent-output] [m[6 of 6] Compiling System.Console.Regions ( System/Console/Regions.hs, dist/build/System/Console/Regions.o, dist/build/System/Console/Regions.dyn_o )
[2m[vector] [m[ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
[2m[logict] [m[1 of 2] Compiling Control.Monad.Logic.Class ( Control/Monad/Logic/Class.hs, dist/build/Control/Monad/Logic/Class.p_o )
[2m[logict] [m[2 of 2] Compiling Control.Monad.Logic ( Control/Monad/Logic.hs, dist/build/Control/Monad/Logic.p_o )
[2m[concurrent-output] [m[1 of 6] Compiling Utility.Exception ( Utility/Exception.hs, dist/build/Utility/Exception.p_o )
[2m[concurrent-output] [m[2 of 6] Compiling Utility.Monad    ( Utility/Monad.hs, dist/build/Utility/Monad.p_o )
[2m[concurrent-output] [m[3 of 6] Compiling System.Console.Concurrent.Internal ( System/Console/Concurrent/Internal.hs, dist/build/System/Console/Concurrent/Internal.p_o )
[2m[vector] [m[ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
[2m[vector] [m[ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
[2m[vector] [m[ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
[2m[vector] [m[ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
[2m[vector] [m[ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
[2m[vector] [m[ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
[2m[vector] [m[ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
[2m[vector] [m[ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
[2m[vector] [m[10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
[2m[vector] [m[11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
[2m[vector] [m[12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
[2m[vector] [m[13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
[2m[vector] [m[14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
[2m[concurrent-output] [m[4 of 6] Compiling System.Console.Concurrent ( System/Console/Concurrent.hs, dist/build/System/Console/Concurrent.p_o )
[2m[concurrent-output] [m[5 of 6] Compiling System.Process.Concurrent ( System/Process/Concurrent.hs, dist/build/System/Process/Concurrent.p_o )
[2m[concurrent-output] [m[6 of 6] Compiling System.Console.Regions ( System/Console/Regions.hs, dist/build/System/Console/Regions.p_o )
[2m[logict] [mPreprocessing test suite 'logict-tests' for logict-0.8.2.0..
[2m[logict] [mBuilding test suite 'logict-tests' for logict-0.8.2.0..
[1;34mBuilding /nix/store/p5rzb73nkl2zab8ci8idymi8niiwarsj-lifted-async-0.10.2.7.drv[m
[2m[logict] [m[1 of 1] Compiling Main             ( test/Test.hs, dist/build/logict-tests/logict-tests-tmp/Main.o )
[2m[lifted-async] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[lifted-async] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[lifted-async] [m[1;36mPhase: unpackPhase[m
[2m[lifted-async] [munpacking source archive /nix/store/w5ndm5lizzwsyhcb2rzsvjxx5ggxbyi8-lifted-async-0.10.2.7.tar.gz
[2m[vector] [mPreprocessing test suite 'vector-inspection' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-inspection' for vector-0.13.2.0..
[2m[lifted-async] [msource root is lifted-async-0.10.2.7
[2m[lifted-async] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "lifted-async-0.10.2.7/tests/TestSuite.hs"
[2m[lifted-async] [m[1;36mPhase: patchPhase[m
[2m[lifted-async] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[lifted-async] [msetupCompileFlags: -package-db=/build/tmp.07WLVTkc9V/setup-package.conf.d -threaded
[2m[lifted-async] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.07WLVTkc9V/Main.o )
[2m[vector] [m[1 of 4] Compiling Inspect          ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
[2m[lifted-async] [m[2 of 2] Linking Setup
[2m[vector] [m[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 )
[2m[vector] [m[3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
[2m[lifted-async] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[lifted-async] [m[1;36mPhase: configurePhase[m
[2m[lifted-async] [mconfigureFlags: --verbose --prefix=/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc/share/doc/lifted-async-0.10.2.7 --with-gcc=gcc --package-db=/build/tmp.07WLVTkc9V/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[lifted-async] [mUsing Parsec parser
[2m[lifted-async] [mConfiguring lifted-async-0.10.2.7...
[2m[logict] [m[2 of 2] Linking dist/build/logict-tests/logict-tests
[2m[lifted-async] [mDependency async >=2.2 && <2.3: using async-2.2.5
[2m[lifted-async] [mDependency base >=4.5 && <4.22: using base-4.19.0.0
[2m[lifted-async] [mDependency constraints >=0.2 && <0.15: using constraints-0.14.2
[2m[lifted-async] [mDependency lifted-base >=0.2 && <0.3: using lifted-base-0.2.3.12
[2m[lifted-async] [mDependency monad-control >=1.0 && <1.1: using monad-control-1.0.3.1
[2m[lifted-async] [mDependency transformers-base >=0.4 && <0.5: using transformers-base-0.4.6
[2m[vector] [m[4 of 4] Compiling Main             ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
[2m[lifted-async] [mSource component graph: component lib
[2m[lifted-async] [mConfigured component graph:
[2m[lifted-async] [m    component lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[lifted-async] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[lifted-async] [m        include base-4.19.0.0-b960
[2m[lifted-async] [m        include constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
[2m[lifted-async] [m        include lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-async] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-async] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-async] [mLinked component graph:
[2m[lifted-async] [m    unit lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[lifted-async] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[lifted-async] [m        include base-4.19.0.0-b960
[2m[lifted-async] [m        include constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
[2m[lifted-async] [m        include lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-async] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-async] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-async] [m        Control.Concurrent.Async.Lifted=lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb:Control.Concurrent.Async.Lifted,Control.Concurrent.Async.Lifted.Safe=lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb:Control.Concurrent.Async.Lifted.Safe
[2m[lifted-async] [mReady component graph:
[2m[lifted-async] [m    definite lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[lifted-async] [m        depends async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[lifted-async] [m        depends base-4.19.0.0-b960
[2m[lifted-async] [m        depends constraints-0.14.2-KUNuLo3MvfPCZVbsJ0eyhG
[2m[lifted-async] [m        depends lifted-base-0.2.3.12-1qHDcLVzTqz5JxmgLnAXSZ
[2m[lifted-async] [m        depends monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[lifted-async] [m        depends transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[lifted-async] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[lifted-async] [mUsing compiler: ghc-9.8.1
[2m[lifted-async] [mUsing install prefix:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7
[2m[lifted-async] [mExecutables installed in:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/bin
[2m[lifted-async] [mLibraries installed in:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[lifted-async] [mDynamic Libraries installed in:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[lifted-async] [mPrivate executables installed in:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/libexec/x86_64-linux-ghc-9.8.1/lifted-async-0.10.2.7
[2m[lifted-async] [mData files installed in:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/share/x86_64-linux-ghc-9.8.1/lifted-async-0.10.2.7
[2m[lifted-async] [mDocumentation installed in:
[2m[lifted-async] [m/nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc/share/doc/lifted-async-0.10.2.7
[2m[lifted-async] [mConfiguration files installed in:
[2m[lifted-async] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/etc
[2m[lifted-async] [mNo alex found
[2m[lifted-async] [mUsing ar found on system at:
[2m[lifted-async] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[lifted-async] [mNo c2hs found
[2m[lifted-async] [mNo cpphs found
[2m[lifted-async] [mNo doctest found
[2m[lifted-async] [mUsing gcc version 14.3.0 given by user at:
[2m[lifted-async] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[lifted-async] [mUsing ghc version 9.8.1 found on system at:
[2m[lifted-async] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[lifted-async] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[lifted-async] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[lifted-async] [mNo ghcjs found
[2m[lifted-async] [mNo ghcjs-pkg found
[2m[lifted-async] [mNo greencard found
[2m[lifted-async] [mUsing haddock version 2.30.0 found on system at:
[2m[lifted-async] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[lifted-async] [mNo happy found
[2m[lifted-async] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[lifted-async] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[lifted-async] [mNo hmake found
[2m[lifted-async] [mUsing hpc version 0.69 found on system at:
[2m[lifted-async] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[lifted-async] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[lifted-async] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[lifted-async] [mUsing hscolour version 1.25 found on system at:
[2m[lifted-async] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[lifted-async] [mNo jhc found
[2m[lifted-async] [mUsing ld found on system at:
[2m[lifted-async] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[lifted-async] [mNo pkg-config found
[2m[lifted-async] [mUsing runghc version 9.8.1 found on system at:
[2m[lifted-async] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[lifted-async] [mUsing strip version 2.44 found on system at:
[2m[lifted-async] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[lifted-async] [mUsing tar found on system at:
[2m[lifted-async] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[lifted-async] [mNo uhc found
[2m[lifted-async] [m[1;36mPhase: buildPhase[m
[2m[lifted-async] [mPreprocessing library for lifted-async-0.10.2.7..
[2m[lifted-async] [mBuilding library for lifted-async-0.10.2.7..
[2m[concurrent-output] [m[1;36mPhase: checkPhase[m
[2m[concurrent-output] [mPackage has no test suites.
[2m[concurrent-output] [m[1;36mPhase: haddockPhase[m
[2m[logict] [m[1;36mPhase: checkPhase[m
[2m[vector] [m[5 of 5] Linking dist/build/vector-inspection/vector-inspection
[2m[logict] [mRunning 1 test suites...
[2m[logict] [mTest suite logict-tests: RUNNING...
[2m[logict] [mAll
[2m[logict] [m  Monad Reader + env
[2m[logict] [m    Monad Reader 1:                         OK
[2m[logict] [m    Monad Reader 2:                         OK
[2m[logict] [m    Monad Reader 3:                         OK
[2m[logict] [m  Various monads
[2m[logict] [m    runIdentity all:                        OK
[2m[logict] [m    runIdentity many:                       OK
[2m[logict] [m    observeAll:                             OK
[2m[logict] [m    observeMany:                            OK
[2m[logict] [m    runReader is productive:                OK
[2m[logict] [m    observeManyT can be used with Either:   OK
[2m[logict] [m  Control.Monad.Logic tests
[2m[logict] [m    runLogicT multi:                        OK
[2m[logict] [m    runLogicT none:                         OK
[2m[logict] [m    runLogicT first:                        OK
[2m[logict] [m    runLogic multi:                         OK
[2m[logict] [m    runLogic none:                          OK
[2m[logict] [m    observe multi:                          OK
[2m[logict] [m    observe none:                           OK
[2m[logict] [m    observeAll multi:                       OK
[2m[logict] [m    observeAll none:                        OK
[2m[logict] [m    observeMany multi:                      OK
[2m[logict] [m    observeMany none:                       OK
[2m[logict] [m    (>>-) Logic:                            OK
[2m[logict] [m  Control.Monad.Logic.Class tests
[2m[logict] [m    msplit laws
[2m[logict] [m      msplit mzero == return Nothing
[2m[logict] [m        msplit mzero :: []:                 OK
[2m[logict] [m        msplit mzero :: ReaderT:            OK
[2m[logict] [m        msplit mzero :: CPS WriterT:        OK
[2m[logict] [m        msplit mzero :: LogicT:             OK
[2m[logict] [m        msplit mzero :: strict StateT:      OK
[2m[logict] [m        msplit mzero :: lazy StateT:        OK
[2m[logict] [m      msplit (return a `mplus` m) == return (Just a, m)
[2m[logict] [m        msplit []:                          OK
[2m[logict] [m        (>>-) []:                           OK
[2m[logict] [m        msplit ReaderT:                     OK
[2m[logict] [m        msplit CPS WriterT:                 OK
[2m[logict] [m        msplit LogicT:                      OK
[2m[logict] [m        msplit strict StateT:               OK
[2m[logict] [m        msplit lazy StateT:                 OK
[2m[logict] [m    fair disjunction
[2m[logict] [m      some odds:                            OK
[2m[logict] [m      unfair disjunction:                   OK
[2m[logict] [m      fair disjunction :: LogicT:           OK
[2m[logict] [m      fair production:                      OK
[2m[lifted-async] [m[1 of 2] Compiling Control.Concurrent.Async.Lifted ( src/Control/Concurrent/Async/Lifted.hs, dist/build/Control/Concurrent/Async/Lifted.o, dist/build/Control/Concurrent/Async/Lifted.dyn_o )
[2m[concurrent-output] [mPreprocessing library for concurrent-output-1.10.21..
[2m[concurrent-output] [mRunning Haddock on library for concurrent-output-1.10.21..
[2m[logict] [m      NONTERMINATION even when fair:        OK (0.11s)
[2m[logict] [m      fair disjunction :: []:               OK
[2m[logict] [m      fair disjunction :: ReaderT:          OK
[2m[logict] [m      fair disjunction :: CPS WriterT:      OK
[2m[logict] [m      fair disjunction :: strict StateT:    OK
[2m[logict] [m      fair disjunction :: lazy StateT:      OK
[2m[logict] [m    fair conjunction
[2m[logict] [m      fair conjunction :: LogicT:           OK
[2m[logict] [m      fair conjunction OK:                  OK
[2m[logict] [m      fair conjunction also OK:             OK
[2m[concurrent-output] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[logict] [m      fair conjunction NON-PRODUCTIVE:      OK (0.12s)
[2m[concurrent-output] [m[1 of 6] Compiling Utility.Exception ( Utility/Exception.hs, nothing )
[2m[logict] [m      fair conjunction also NON-PRODUCTIVE: OK (0.12s)
[2m[concurrent-output] [m[2 of 6] Compiling Utility.Monad    ( Utility/Monad.hs, nothing )
[2m[concurrent-output] [m[3 of 6] Compiling System.Console.Concurrent.Internal ( System/Console/Concurrent/Internal.hs, nothing )
[2m[logict] [m      unfair conjunction is NON-PRODUCTIVE: OK (0.12s)
[2m[logict] [m      fair conjunction :: []:               OK
[2m[logict] [m      fair conjunction :: ReaderT:          OK
[2m[logict] [m      fair conjunction :: CPS WriterT:      OK
[2m[logict] [m      fair conjunction :: strict StateT:    OK
[2m[logict] [m      fair conjunction :: lazy StateT:      OK
[2m[logict] [m    ifte logical conditional (soft-cut)
[2m[logict] [m      divisible odds:                       OK
[2m[logict] [m      indivisible odds, wrong:              OK
[2m[logict] [m      indivisible odds :: LogicT:           OK
[2m[logict] [m      indivisible odds :: []:               OK
[2m[logict] [m      indivisible odds :: ReaderT:          OK
[2m[logict] [m      indivisible odds :: CPS WriterT:      OK
[2m[logict] [m      indivisible odds :: strict StateT:    OK
[2m[logict] [m      indivisible odds :: strict StateT:    OK
[2m[logict] [m    once (pruning)
[2m[logict] [m      no pruning:                           OK
[2m[logict] [m      with pruning:                         OK
[2m[logict] [m  lnot (inversion)
[2m[logict] [m    inversion :: LogicT:                    OK
[2m[logict] [m    inversion :: []:                        OK
[2m[logict] [m    inversion :: ReaderT:                   OK
[2m[logict] [m    inversion :: CPS WriterT:               OK
[2m[logict] [m    inversion :: strict StateT:             OK
[2m[logict] [m    inversion :: lazy StateT:               OK
[2m[logict] [m
[2m[logict] [mAll 71 tests passed (0.47s)
[2m[logict] [mTest suite logict-tests: PASS
[2m[logict] [mTest suite logged to: dist/test/logict-0.8.2.0-logict-tests.log
[2m[logict] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[logict] [m[1;36mPhase: haddockPhase[m
[2m[logict] [mPreprocessing library for logict-0.8.2.0..
[2m[logict] [mRunning Haddock on library for logict-0.8.2.0..
[2m[logict] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[concurrent-output] [m[4 of 6] Compiling System.Console.Concurrent ( System/Console/Concurrent.hs, nothing )
[2m[concurrent-output] [m[5 of 6] Compiling System.Process.Concurrent ( System/Process/Concurrent.hs, nothing )
[2m[concurrent-output] [m[6 of 6] Compiling System.Console.Regions ( System/Console/Regions.hs, nothing )
[2m[logict] [m[1 of 2] Compiling Control.Monad.Logic.Class ( Control/Monad/Logic/Class.hs, nothing )
[2m[vector] [mPreprocessing test suite 'vector-doctest' for vector-0.13.2.0..
[2m[vector] [mBuilding test suite 'vector-doctest' for vector-0.13.2.0..
[2m[logict] [m[2 of 2] Compiling Control.Monad.Logic ( Control/Monad/Logic.hs, nothing )
[2m[lifted-async] [m[2 of 2] Compiling Control.Concurrent.Async.Lifted.Safe ( src/Control/Concurrent/Async/Lifted/Safe.hs, dist/build/Control/Concurrent/Async/Lifted/Safe.o, dist/build/Control/Concurrent/Async/Lifted/Safe.dyn_o )
[2m[vector] [m[1 of 1] Compiling Main             ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
[2m[concurrent-output] [mHaddock coverage:
[2m[concurrent-output] [m  46% ( 20 / 43) in 'System.Console.Concurrent.Internal'
[2m[concurrent-output] [m  Missing documentation for:
[2m[concurrent-output] [m    OutputHandle (System/Console/Concurrent/Internal.hs:38)
[2m[concurrent-output] [m    Lock (System/Console/Concurrent/Internal.hs:45)
[2m[concurrent-output] [m    withLock (System/Console/Concurrent/Internal.hs:76)
[2m[concurrent-output] [m    takeOutputLock' (System/Console/Concurrent/Internal.hs:79)
[2m[concurrent-output] [m    outputConcurrent' (System/Console/Concurrent/Internal.hs:171)
[2m[concurrent-output] [m    fgProcess (System/Console/Concurrent/Internal.hs:244)
[2m[concurrent-output] [m    bgProcess (System/Console/Concurrent/Internal.hs:256)
[2m[concurrent-output] [m    willOutput (System/Console/Concurrent/Internal.hs:289)
[2m[concurrent-output] [m    StdHandle (System/Console/Concurrent/Internal.hs:296)
[2m[concurrent-output] [m    toHandle (System/Console/Concurrent/Internal.hs:299)
[2m[concurrent-output] [m    bufferFor (System/Console/Concurrent/Internal.hs:303)
[2m[concurrent-output] [m    OutputBufferedActivity (System/Console/Concurrent/Internal.hs:306)
[2m[concurrent-output] [m    AtEnd (System/Console/Concurrent/Internal.hs:314)
[2m[concurrent-output] [m    BufSig (System/Console/Concurrent/Internal.hs:317)
[2m[concurrent-output] [m    setupOutputBuffer (System/Console/Concurrent/Internal.hs:320)
[2m[concurrent-output] [m    outputDrainer (System/Console/Concurrent/Internal.hs:329)
[2m[concurrent-output] [m    registerOutputThread (System/Console/Concurrent/Internal.hs:349)
[2m[concurrent-output] [m    unregisterOutputThread (System/Console/Concurrent/Internal.hs:354)
[2m[concurrent-output] [m    bufferWriter (System/Console/Concurrent/Internal.hs:364)
[2m[concurrent-output] [m    addOutputBuffer (System/Console/Concurrent/Internal.hs:417)
[2m[concurrent-output] [m    bufferOutputSTM' (System/Console/Concurrent/Internal.hs:451)
[2m[concurrent-output] [m    waitAnyBuffer (System/Console/Concurrent/Internal.hs:477)
[2m[concurrent-output] [m    endsNewLine (System/Console/Concurrent/Internal.hs:491)
[2m[concurrent-output] [m  90% ( 18 / 20) in 'System.Console.Concurrent'
[2m[concurrent-output] [m  Missing documentation for:
[2m[concurrent-output] [m    StdHandle (System/Console/Concurrent/Internal.hs:296)
[2m[concurrent-output] [m    waitAnyBuffer (System/Console/Concurrent/Internal.hs:477)
[2m[concurrent-output] [m 100% (  3 /  3) in 'System.Process.Concurrent'
[2m[concurrent-output] [mWarning: 'Text' is ambiguous. It is defined
[2m[concurrent-output] [m    * in ‘Data.Text.Internal’
[2m[concurrent-output] [m    * in ‘Data.Text.Internal.Lazy’
[2m[concurrent-output] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[concurrent-output] [m    by specifying the type/value namespace explicitly.
[2m[concurrent-output] [m    Defaulting to the one defined in ‘Data.Text.Internal.Lazy’
[2m[concurrent-output] [m  96% ( 24 / 25) in 'System.Console.Regions'
[2m[concurrent-output] [m  Missing documentation for:
[2m[concurrent-output] [m    RegionContent (System/Console/Regions.hs:176)
[2m[logict] [mHaddock coverage:
[2m[logict] [m 100% (  3 /  3) in 'Control.Monad.Logic.Class'
[2m[logict] [mWarning: 'Identity' is ambiguous. It is defined
[2m[logict] [m    * in ‘Data.Functor.Identity’
[2m[logict] [m    * in ‘Data.Functor.Identity’
[2m[logict] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[logict] [m    by specifying the type/value namespace explicitly.
[2m[logict] [m    Defaulting to the one defined in ‘Data.Functor.Identity’
[2m[logict] [mWarning: 'LogicT' is ambiguous. It is defined
[2m[logict] [m    * at Control/Monad/Logic.hs:124:5
[2m[logict] [m    * at Control/Monad/Logic.hs:123:1
[2m[logict] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[logict] [m    by specifying the type/value namespace explicitly.
[2m[logict] [m    Defaulting to the one defined at Control/Monad/Logic.hs:123:1
[2m[logict] [m 100% ( 19 / 19) in 'Control.Monad.Logic'
[2m[vector] [m[2 of 2] Linking dist/build/vector-doctest/vector-doctest
[2m[logict] [mWarning: Control.Monad.Logic: could not find link destinations for: 
[2m[logict] [m	- Control.Monad.Logic.D:R:ItemLogicT
[2m[lifted-async] [m[1 of 2] Compiling Control.Concurrent.Async.Lifted ( src/Control/Concurrent/Async/Lifted.hs, dist/build/Control/Concurrent/Async/Lifted.p_o )
[2m[lifted-async] [m[2 of 2] Compiling Control.Concurrent.Async.Lifted.Safe ( src/Control/Concurrent/Async/Lifted/Safe.hs, dist/build/Control/Concurrent/Async/Lifted/Safe.p_o )
[2m[logict] [mDocumentation created: dist/doc/html/logict/, dist/doc/html/logict/logict.txt
[2m[logict] [mPreprocessing test suite 'logict-tests' for logict-0.8.2.0..
[2m[logict] [m[1;36mPhase: installPhase[m
[2m[logict] [mInstalling library in /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[logict] [m[1;36mPhase: fixupPhase[m
[2m[logict] [mshrinking RPATHs of ELF executables and libraries in /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0
[2m[logict] [mshrinking /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSlogict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt-ghc9.8.1.so
[2m[logict] [mchecking for references to /build/ in /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0...
[2m[logict] [mpatching script interpreter paths in /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0
[2m[logict] [mstripping (with command strip and flags -S -p) in  /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0/lib
[2m[logict] [mshrinking RPATHs of ELF executables and libraries in /nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc
[2m[logict] [mchecking for references to /build/ in /nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc...
[2m[logict] [mpatching script interpreter paths in /nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc
[2m[logict:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0[m
[2m[logict:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[logict:post-build] [m[2m[m
[2m[logict:post-build] [m[2mPushing /nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc (822.05 KiB)[m
[2m[logict:post-build] [m[2mPushing /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0 (2.72 MiB)[m
[2m[logict:post-build] [m[2m[m
[2m[logict:post-build] [m[2mAll done.[m
[2m[logict:post-build] [m[2mUploading to the NixCI cache: /nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc /nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0[m
[2m[logict:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[logict:post-build] [m[2mcopying 2 paths...[m
[2m[logict:post-build] [m[2mcopying path '/nix/store/1m9qnjzb6pv0qlvq81drzm71yb7vc17c-logict-0.8.2.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[logict:post-build] [m[2mcopying path '/nix/store/558hpyzrwhbmdkvp6q8h1k35v5nyvxz8-logict-0.8.2.0' to 'https://cache.nix-ci.com'...[m
[2m[logict:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[logict:post-build] [m[2mcopying 1 paths...[m
[2m[logict:post-build] [m[2mcopying path '/nix/store/cq1rl98xdxmq4arzik17y96vramz4l6y-logict-0.8.2.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 26 of 50 built (3 building)[m
[1;34mBuilding /nix/store/sxj3qqxf7awzli4lkwmrqhbzdwvrz3sp-smallcheck-1.2.1.1.drv[m
[2m[concurrent-output] [mDocumentation created: dist/doc/html/concurrent-output/,
[2m[concurrent-output] [mdist/doc/html/concurrent-output/concurrent-output.txt
[2m[concurrent-output] [m[1;36mPhase: installPhase[m
[2m[concurrent-output] [mInstalling library in /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[concurrent-output] [m[1;36mPhase: fixupPhase[m
[2m[concurrent-output] [mshrinking RPATHs of ELF executables and libraries in /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21
[2m[concurrent-output] [mshrinking /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSconcurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK-ghc9.8.1.so
[2m[concurrent-output] [mchecking for references to /build/ in /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21...
[2m[concurrent-output] [mpatching script interpreter paths in /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21
[2m[concurrent-output] [mstripping (with command strip and flags -S -p) in  /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/lib
[2m[concurrent-output] [mshrinking RPATHs of ELF executables and libraries in /nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc
[2m[concurrent-output] [mchecking for references to /build/ in /nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc...
[2m[concurrent-output] [mpatching script interpreter paths in /nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc
[2m[lifted-async] [m[1;36mPhase: haddockPhase[m
[2m[lifted-async] [mPreprocessing library for lifted-async-0.10.2.7..
[2m[lifted-async] [mRunning Haddock on library for lifted-async-0.10.2.7..
[2m[lifted-async] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[lifted-async] [m[1 of 2] Compiling Control.Concurrent.Async.Lifted ( src/Control/Concurrent/Async/Lifted.hs, nothing )
[2m[lifted-async] [m[2 of 2] Compiling Control.Concurrent.Async.Lifted.Safe ( src/Control/Concurrent/Async/Lifted/Safe.hs, nothing )
[2m[lifted-async] [mHaddock coverage:
[2m[lifted-async] [mWarning: 'Concurrently' is ambiguous. It is defined
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:448:28
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:448:1
[2m[lifted-async] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-async] [m    by specifying the type/value namespace explicitly.
[2m[lifted-async] [m    Defaulting to the one defined at src/Control/Concurrent/Async/Lifted.hs:448:1
[2m[lifted-async] [mWarning: 'runConcurrently' is ambiguous. It is defined
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:448:43
[2m[lifted-async] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-async] [m    by specifying the type/value namespace explicitly.
[2m[lifted-async] [m    Defaulting to the one defined at src/Control/Concurrent/Async/Lifted.hs:448:43
[2m[lifted-async] [mWarning: 'a' is out of scope.
[2m[lifted-async] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[lifted-async] [mWarning: 'cancel' is ambiguous. It is defined
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:222:1
[2m[lifted-async] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-async] [m    by specifying the type/value namespace explicitly.
[2m[lifted-async] [m    Defaulting to the one defined at src/Control/Concurrent/Async/Lifted.hs:222:1
[2m[lifted-async] [m  98% ( 62 / 63) in 'Control.Concurrent.Async.Lifted'
[2m[lifted-async] [m  Missing documentation for:
[2m[lifted-async] [m    ExceptionInLinkedThread
[2m[lifted-async] [mWarning: 'm' is out of scope.
[2m[lifted-async] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[lifted-async] [mWarning: 'a' is out of scope.
[2m[lifted-async] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[lifted-async] [mWarning: 'Concurrently' is ambiguous. It is defined
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:448:28
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:448:1
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted/Safe.hs:413:3
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted/Safe.hs:412:1
[2m[lifted-async] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-async] [m    by specifying the type/value namespace explicitly.
[2m[lifted-async] [m    Defaulting to the one defined at src/Control/Concurrent/Async/Lifted/Safe.hs:412:1
[2m[lifted-async] [mWarning: 'runConcurrently' is ambiguous. It is defined
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:448:43
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted/Safe.hs:414:29
[2m[lifted-async] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-async] [m    by specifying the type/value namespace explicitly.
[2m[lifted-async] [m    Defaulting to the one defined at src/Control/Concurrent/Async/Lifted/Safe.hs:414:29
[2m[lifted-async] [mWarning: 'cancel' is ambiguous. It is defined
[2m[lifted-async] [m    * in ‘Control.Concurrent.Async.Internal’
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted.hs:222:1
[2m[lifted-async] [m    * at src/Control/Concurrent/Async/Lifted/Safe.hs:215:1
[2m[lifted-async] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[lifted-async] [m    by specifying the type/value namespace explicitly.
[2m[lifted-async] [m    Defaulting to the one defined at src/Control/Concurrent/Async/Lifted/Safe.hs:215:1
[2m[lifted-async] [m  96% ( 63 / 65) in 'Control.Concurrent.Async.Lifted.Safe'
[2m[lifted-async] [m  Missing documentation for:
[2m[lifted-async] [m    Forall
[2m[lifted-async] [m    ExceptionInLinkedThread
[2m[vector] [mbuildPhase completed in 3 minutes 40 seconds
[2m[vector] [m[1;36mPhase: checkPhase[m
[2m[vector] [mRunning 2 test suites...
[2m[vector] [mTest suite vector-tests-O0: RUNNING...
[2m[vector] [mtoplevel
[2m[vector] [m  Data.Vector.Fusion.Bundle
[2m[vector] [m    fromList.toList == id:                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    toList.fromList == id:                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    eq:                                                                    OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    length:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    null:                                                                  OK (0.02s)
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    empty:                                                                 OK
[2m[vector] [m      +++ OK, passed 1 test.
[2m[vector] [m    singleton:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    replicate:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    cons:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    snoc:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    append:                                                                OK (0.01s)
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    head:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m    last:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m    index:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m    extract:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    init:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m    tail:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m    take:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    drop:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    map:                                                                   OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    zipWith:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    zipWith3:                                                              OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    filter:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    takeWhile:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    dropWhile:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    elem:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    notElem:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    find:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    findIndex:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldl:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldl1:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m    foldl':                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldl1':                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m    foldr:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[concurrent-output:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21 /nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc[m
[2m[concurrent-output:post-build] [m[2mPushing 2 paths (81 are already present) using zstd to cache sellout ⏳[m
[2m[concurrent-output:post-build] [m[2m[m
[2m[concurrent-output:post-build] [m[2mPushing /nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc (1.18 MiB)[m
[2m[concurrent-output:post-build] [m[2mPushing /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21 (2.93 MiB)[m
[2m[concurrent-output:post-build] [m[2m[m
[2m[concurrent-output:post-build] [m[2mAll done.[m
[2m[concurrent-output:post-build] [m[2mUploading to the NixCI cache: /nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21 /nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc[m
[2m[concurrent-output:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[concurrent-output:post-build] [m[2mcopying 2 paths...[m
[2m[concurrent-output:post-build] [m[2mcopying path '/nix/store/1jd0y5ffprdaxxsc5a88hjcmix1pawig-concurrent-output-1.10.21-doc' to 'https://cache.nix-ci.com'...[m
[2m[concurrent-output:post-build] [m[2mcopying path '/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21' to 'https://cache.nix-ci.com'...[m
[2m[concurrent-output:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[concurrent-output:post-build] [m[2mcopying 1 paths...[m
[2m[concurrent-output:post-build] [m[2mcopying path '/nix/store/wxj321dsm5sck42k4ycslrx5yix7s50r-concurrent-output-1.10.21.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 27 of 49 built (3 building)[m
[2m[vector] [m    foldr1:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m    prescanl:                                                              OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    prescanl':                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    postscanl:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    postscanl':                                                            OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    scanl:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    scanl':                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    scanl1:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m    scanl1':                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m    concatMap:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    unfoldr:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    and:                                                                   OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    or:                                                                    OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Boxed
[2m[vector] [m    Bool
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[lifted-async] [mDocumentation created: dist/doc/html/lifted-async/,
[2m[lifted-async] [mdist/doc/html/lifted-async/lifted-async.txt
[2m[lifted-async] [m[1;36mPhase: installPhase[m
[2m[lifted-async] [mInstalling library in /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[lifted-async] [m[1;36mPhase: fixupPhase[m
[2m[lifted-async] [mshrinking RPATHs of ELF executables and libraries in /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7
[2m[lifted-async] [mshrinking /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSlifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb-ghc9.8.1.so
[2m[lifted-async] [mchecking for references to /build/ in /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7...
[2m[lifted-async] [mpatching script interpreter paths in /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7
[2m[lifted-async] [mstripping (with command strip and flags -S -p) in  /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/lib
[2m[lifted-async] [mshrinking RPATHs of ELF executables and libraries in /nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc
[2m[lifted-async] [mchecking for references to /build/ in /nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc...
[2m[lifted-async] [mpatching script interpreter paths in /nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc
[2m[smallcheck] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[smallcheck] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[smallcheck] [m[1;36mPhase: unpackPhase[m
[2m[smallcheck] [munpacking source archive /nix/store/4z2d5xjv0wl7ziyllqx31bwhdql1a9bh-smallcheck-1.2.1.1.tar.gz
[2m[smallcheck] [msource root is smallcheck-1.2.1.1
[2m[smallcheck] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "smallcheck-1.2.1.1/Test/SmallCheck/SeriesMonad.hs"
[2m[smallcheck] [m[1;36mPhase: patchPhase[m
[2m[smallcheck] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[smallcheck] [msetupCompileFlags: -package-db=/build/tmp.XlgY0AOMXt/setup-package.conf.d -threaded
[2m[smallcheck] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.XlgY0AOMXt/Main.o )
[2m[smallcheck] [m[2 of 2] Linking Setup
[2m[smallcheck] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[smallcheck] [m[1;36mPhase: configurePhase[m
[2m[smallcheck] [mconfigureFlags: --verbose --prefix=/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc/share/doc/smallcheck-1.2.1.1 --with-gcc=gcc --package-db=/build/tmp.XlgY0AOMXt/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[smallcheck] [mUsing Parsec parser
[2m[smallcheck] [mConfiguring smallcheck-1.2.1.1...
[2m[smallcheck] [mDependency base >=4.3 && <5: using base-4.19.0.0
[2m[smallcheck] [mDependency logict >=0.5 && <0.9: using logict-0.8.2.0
[2m[smallcheck] [mDependency mtl <2.4: using mtl-2.3.1
[2m[smallcheck] [mDependency pretty <1.2: using pretty-1.1.3.6
[2m[smallcheck] [mSource component graph: component lib
[2m[smallcheck] [mConfigured component graph:
[2m[smallcheck] [m    component smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[smallcheck] [m        include base-4.19.0.0-b960
[2m[smallcheck] [m        include logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[smallcheck] [m        include mtl-2.3.1-63a4
[2m[smallcheck] [m        include pretty-1.1.3.6-0c70
[2m[smallcheck] [mLinked component graph:
[2m[smallcheck] [m    unit smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[smallcheck] [m        include base-4.19.0.0-b960
[2m[smallcheck] [m        include logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[smallcheck] [m        include mtl-2.3.1-63a4
[2m[smallcheck] [m        include pretty-1.1.3.6-0c70
[2m[smallcheck] [m        Test.SmallCheck=smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk:Test.SmallCheck,Test.SmallCheck.Drivers=smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk:Test.SmallCheck.Drivers,Test.SmallCheck.Series=smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk:Test.SmallCheck.Series
[2m[smallcheck] [mReady component graph:
[2m[smallcheck] [m    definite smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[smallcheck] [m        depends base-4.19.0.0-b960
[2m[smallcheck] [m        depends logict-0.8.2.0-CBOehc6MIbK7jQ3jRjnYQt
[2m[smallcheck] [m        depends mtl-2.3.1-63a4
[2m[smallcheck] [m        depends pretty-1.1.3.6-0c70
[2m[smallcheck] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[smallcheck] [mUsing compiler: ghc-9.8.1
[2m[smallcheck] [mUsing install prefix:
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1
[2m[smallcheck] [mExecutables installed in:
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/bin
[2m[smallcheck] [mLibraries installed in:
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[smallcheck] [mDynamic Libraries installed in:
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[smallcheck] [mPrivate executables installed in:
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[lifted-async:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7 /nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc[m
[2m[lifted-async:post-build] [m[2mPushing 2 paths (88 are already present) using zstd to cache sellout ⏳[m
[2m[lifted-async:post-build] [m[2m[m
[2m[lifted-async:post-build] [m[2mPushing /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7 (1.81 MiB)[m
[2m[lifted-async:post-build] [m[2mPushing /nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc (1.16 MiB)[m
[2m[lifted-async:post-build] [m[2m[m
[2m[lifted-async:post-build] [m[2mAll done.[m
[2m[lifted-async:post-build] [m[2mUploading to the NixCI cache: /nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7 /nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc[m
[2m[lifted-async:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[lifted-async:post-build] [m[2mcopying 2 paths...[m
[2m[lifted-async:post-build] [m[2mcopying path '/nix/store/x61lg8ldndanvpqccp481lv7w5ksvmpd-lifted-async-0.10.2.7-doc' to 'https://cache.nix-ci.com'...[m
[2m[lifted-async:post-build] [m[2mcopying path '/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7' to 'https://cache.nix-ci.com'...[m
[2m[lifted-async:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[lifted-async:post-build] [m[2mcopying 1 paths...[m
[2m[lifted-async:post-build] [m[2mcopying path '/nix/store/p5rzb73nkl2zab8ci8idymi8niiwarsj-lifted-async-0.10.2.7.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 28 of 49 built (2 building)[m
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/libexec/x86_64-linux-ghc-9.8.1/smallcheck-1.2.1.1
[2m[smallcheck] [mData files installed in:
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/share/x86_64-linux-ghc-9.8.1/smallcheck-1.2.1.1
[2m[smallcheck] [mDocumentation installed in:
[2m[smallcheck] [m/nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc/share/doc/smallcheck-1.2.1.1
[2m[smallcheck] [mConfiguration files installed in:
[2m[smallcheck] [m/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/etc
[2m[smallcheck] [mNo alex found
[2m[smallcheck] [mUsing ar found on system at:
[2m[smallcheck] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[smallcheck] [mNo c2hs found
[2m[smallcheck] [mNo cpphs found
[2m[smallcheck] [mNo doctest found
[2m[smallcheck] [mUsing gcc version 14.3.0 given by user at:
[2m[smallcheck] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[smallcheck] [mUsing ghc version 9.8.1 found on system at:
[2m[smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[smallcheck] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[smallcheck] [mNo ghcjs found
[2m[smallcheck] [mNo ghcjs-pkg found
[2m[smallcheck] [mNo greencard found
[2m[smallcheck] [mUsing haddock version 2.30.0 found on system at:
[2m[smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[smallcheck] [mNo happy found
[2m[smallcheck] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[smallcheck] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[smallcheck] [mNo hmake found
[2m[smallcheck] [mUsing hpc version 0.69 found on system at:
[2m[smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[smallcheck] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[smallcheck] [mUsing hscolour version 1.25 found on system at:
[2m[smallcheck] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[smallcheck] [mNo jhc found
[2m[smallcheck] [mUsing ld found on system at:
[2m[smallcheck] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[smallcheck] [mNo pkg-config found
[2m[smallcheck] [mUsing runghc version 9.8.1 found on system at:
[2m[smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[smallcheck] [mUsing strip version 2.44 found on system at:
[2m[smallcheck] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[smallcheck] [mUsing tar found on system at:
[2m[smallcheck] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[smallcheck] [mNo uhc found
[2m[smallcheck] [m[1;36mPhase: buildPhase[m
[2m[smallcheck] [mPreprocessing library for smallcheck-1.2.1.1..
[2m[smallcheck] [mBuilding library for smallcheck-1.2.1.1..
[2m[smallcheck] [m[1 of 6] Compiling Test.SmallCheck.Property.Result ( Test/SmallCheck/Property/Result.hs, dist/build/Test/SmallCheck/Property/Result.o, dist/build/Test/SmallCheck/Property/Result.dyn_o )
[2m[smallcheck] [m[2 of 6] Compiling Test.SmallCheck.SeriesMonad ( Test/SmallCheck/SeriesMonad.hs, dist/build/Test/SmallCheck/SeriesMonad.o, dist/build/Test/SmallCheck/SeriesMonad.dyn_o )
[2m[smallcheck] [m[3 of 6] Compiling Test.SmallCheck.Series ( Test/SmallCheck/Series.hs, dist/build/Test/SmallCheck/Series.o, dist/build/Test/SmallCheck/Series.dyn_o )
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[1;34mBuilding /nix/store/5458kfdgkysbzx3n0ag8abp4zhiihjw2-hedgehog-1.5.drv[m
[2m[smallcheck] [m[4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, dist/build/Test/SmallCheck/Property.o, dist/build/Test/SmallCheck/Property.dyn_o )
[2m[smallcheck] [m[5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, dist/build/Test/SmallCheck/Drivers.o, dist/build/Test/SmallCheck/Drivers.dyn_o )
[2m[smallcheck] [m[6 of 6] Compiling Test.SmallCheck  ( Test/SmallCheck.hs, dist/build/Test/SmallCheck.o, dist/build/Test/SmallCheck.dyn_o )
[2m[smallcheck] [m[1 of 6] Compiling Test.SmallCheck.Property.Result ( Test/SmallCheck/Property/Result.hs, dist/build/Test/SmallCheck/Property/Result.p_o )
[2m[smallcheck] [m[2 of 6] Compiling Test.SmallCheck.SeriesMonad ( Test/SmallCheck/SeriesMonad.hs, dist/build/Test/SmallCheck/SeriesMonad.p_o )
[2m[smallcheck] [m[3 of 6] Compiling Test.SmallCheck.Series ( Test/SmallCheck/Series.hs, dist/build/Test/SmallCheck/Series.p_o )
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      and:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      or:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    Int
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Primitive
[2m[vector] [m    Int
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m    Double
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 30 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldl':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 2 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Storable
[2m[vector] [m    Data.Vector.Storable.Vector (Int)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m    Data.Vector.Storable.Vector (Double)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 6 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Strict
[2m[vector] [m    Bool
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      and:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      or:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    Int
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Unboxed
[2m[vector] [m    ()
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.11s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.08s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Bool)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.09s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      and:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      or:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Int)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m    (Float)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.07s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Double)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      foldr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldr':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[vector] [m      iscanr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 9 discarded.
[2m[vector] [m    (Int,Bool)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[hedgehog] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Int,Bool,Int)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.09s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.07s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Data.Vector.Storable.Vector Alignment
[2m[vector] [m    Aligned Double:                                                        OK
[2m[vector] [m    Aligned Int:                                                           OK
[2m[vector] [m  Regression tests
[2m[vector] [m    enumFromTo crash #188
[2m[vector] [m      Word8:                                                               OK
[2m[vector] [m      Word16:                                                              OK
[2m[vector] [m      Word32:                                                              OK
[2m[vector] [m      Word64:                                                              OK
[2m[vector] [m      Word:                                                                OK
[2m[vector] [m      Int8:                                                                OK
[2m[vector] [m      Int16:                                                               OK
[2m[vector] [m      Int32:                                                               OK
[2m[vector] [m      Int64:                                                               OK
[2m[vector] [m      Int:                                                                 OK
[2m[vector] [m      Char:                                                                OK
[2m[vector] [m  Negative tests
[2m[vector] [m    slice out of bounds #257
[2m[vector] [m      Boxed
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m      Primitive
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m      Storable
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m      Unboxed
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m    take #282
[2m[vector] [m      Boxed:                                                               OK
[2m[vector] [m      Primitive:                                                           OK
[2m[vector] [m      Storable:                                                            OK
[2m[vector] [m      Unboxed:                                                             OK
[2m[vector] [m  Data.Vector
[2m[vector] [m    MonadFix:                                                              OK
[2m[vector] [m    toFromArray:                                                           OK
[2m[vector] [m    toFromArraySlice:                                                      OK
[2m[vector] [m    toFromArraySliceUnsafe:                                                OK
[2m[vector] [m    toFromMutableArray:                                                    OK
[2m[vector] [m  Data.Vector.Mutable (Move):                                              OK
[2m[vector] [m    +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m  Data.Vector.Primitive.Mutable (Move):                                    OK
[2m[vector] [m    +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m  Data.Vector.Unboxed.Mutable (Move):                                      OK
[2m[vector] [m    +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m  Data.Vector.Storable.Mutable (Move):                                     OK
[2m[vector] [m    +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m  Data.Vector.Generic.Mutable (nextPermutation):                           OK (0.01s)
[2m[vector] [m    +++ OK, passed 1 test.
[2m[vector] [m  Data.Vector.Generic.Mutable (prevPermutation):                           OK (0.01s)
[2m[vector] [m    +++ OK, passed 1 test.
[2m[vector] [m  Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK (0.02s)
[2m[vector] [m    +++ OK, passed 100 tests.
[2m[vector] [m  Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
[2m[vector] [m    +++ OK, passed 100 tests.
[2m[vector] [m
[2m[vector] [mAll 2808 tests passed (17.40s)
[2m[vector] [mTest suite vector-tests-O0: PASS
[2m[vector] [mTest suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
[2m[vector] [mTest suite vector-tests-O2: RUNNING...
[2m[vector] [mtoplevel
[2m[vector] [m  Data.Vector.Fusion.Bundle
[2m[vector] [m    fromList.toList == id:                                                 OK (0.01s)
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    toList.fromList == id:                                                 OK (0.02s)
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    eq:                                                                    OK (0.02s)
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    length:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    null:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    empty:                                                                 OK
[2m[vector] [m      +++ OK, passed 1 test.
[2m[vector] [m    singleton:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    replicate:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    cons:                                                                  OK (0.01s)
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    snoc:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    append:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    head:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m    last:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m    index:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m    extract:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    init:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m    tail:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m    take:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    drop:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    map:                                                                   OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    zipWith:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    zipWith3:                                                              OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    filter:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    takeWhile:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    dropWhile:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    elem:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    notElem:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    find:                                                                  OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    findIndex:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldl:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldl1:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m    foldl':                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldl1':                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m    foldr:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    foldr1:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m    prescanl:                                                              OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    prescanl':                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    postscanl:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    postscanl':                                                            OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    scanl:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    scanl':                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    scanl1:                                                                OK
[2m[vector] [m      +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m    scanl1':                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m    concatMap:                                                             OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    unfoldr:                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    and:                                                                   OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    or:                                                                    OK
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Boxed
[2m[vector] [m    Bool
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[1;36mPhase: unpackPhase[m
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[hedgehog] [munpacking source archive /nix/store/y6x6mm5qz6s835g6w7sj382w8cidq00s-hedgehog-1.5.tar.gz
[2m[hedgehog] [msource root is hedgehog-1.5
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [msetting SOURCE_DATE_EPOCH to timestamp 1721821132 of file "hedgehog-1.5/CHANGELOG.md"
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[hedgehog] [m[1;36mPhase: patchPhase[m
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mReplace Cabal file with edited version from mirror://hackage/hedgehog-1.5/revision/2.cabal.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[hedgehog] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [msetupCompileFlags: -package-db=/build/tmp.L0yQxm88Rh/setup-package.conf.d -threaded
[2m[vector] [m      ifoldM_:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.L0yQxm88Rh/Main.o )
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      and:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      or:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    Int
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[2 of 2] Linking Setup
[2m[vector] [m      generateM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Primitive
[2m[vector] [m    Int
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m    Double
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, dist/build/Test/SmallCheck/Property.p_o )
[2m[vector] [m      zipWith3:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[vector] [m      groupBy:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[1;36mPhase: configurePhase[m
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[hedgehog] [mconfigureFlags: --verbose --prefix=/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc/share/doc/hedgehog-1.5 --with-gcc=gcc --package-db=/build/tmp.L0yQxm88Rh/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mUsing Parsec parser
[2m[hedgehog] [mConfiguring hedgehog-1.5...
[2m[vector] [m      foldl:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldl':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      foldr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, dist/build/Test/SmallCheck/Drivers.p_o )
[2m[vector] [m      prescanl:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[6 of 6] Compiling Test.SmallCheck  ( Test/SmallCheck.hs, dist/build/Test/SmallCheck.p_o )
[2m[vector] [m      postscanr:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mDependency ansi-terminal >=0.6 && <1.2: using ansi-terminal-1.1.2
[2m[hedgehog] [mDependency async >=2.0 && <2.3: using async-2.2.5
[2m[hedgehog] [mDependency barbies >=1.0 && <2.2: using barbies-2.1.1.0
[2m[hedgehog] [mDependency base >=4.9 && <5: using base-4.19.0.0
[2m[hedgehog] [mDependency bytestring >=0.10 && <0.13: using bytestring-0.12.0.2
[2m[hedgehog] [mDependency concurrent-output >=1.7 && <1.11: using concurrent-output-1.10.21
[2m[hedgehog] [mDependency containers >=0.4 && <0.9: using containers-0.6.8
[2m[hedgehog] [mDependency deepseq >=1.1.0.0 && <1.6: using deepseq-1.5.0.0
[2m[hedgehog] [mDependency directory >=1.2 && <1.4: using directory-1.3.8.1
[2m[hedgehog] [mDependency erf >=2.0 && <2.1: using erf-2.0.0.0
[2m[hedgehog] [mDependency exceptions >=0.7 && <0.11: using exceptions-0.10.7
[2m[hedgehog] [mDependency lifted-async >=0.7 && <0.11: using lifted-async-0.10.2.7
[2m[hedgehog] [mDependency mmorph >=1.0 && <1.3: using mmorph-1.2.0
[2m[hedgehog] [mDependency monad-control >=1.0 && <1.1: using monad-control-1.0.3.1
[2m[hedgehog] [mDependency mtl >=2.1 && <2.4: using mtl-2.3.1
[2m[hedgehog] [mDependency pretty-show >=1.6 && <1.11: using pretty-show-1.10
[2m[hedgehog] [mDependency primitive >=0.6 && <0.10: using primitive-0.9.1.0
[2m[hedgehog] [mDependency random >=1.1 && <1.4: using random-1.2.1.3
[2m[hedgehog] [mDependency resourcet >=1.1 && <1.4: using resourcet-1.3.0
[2m[hedgehog] [mDependency safe-exceptions >=0.1 && <0.2: using safe-exceptions-0.1.7.4
[2m[hedgehog] [mDependency stm >=2.4 && <2.6: using stm-2.5.2.1
[2m[hedgehog] [mDependency template-haskell >=2.10 && <2.24: using template-haskell-2.21.0.0
[2m[hedgehog] [mDependency text >=1.1 && <2.2: using text-2.1
[2m[hedgehog] [mDependency time >=1.4 && <1.15: using time-1.12.2
[2m[hedgehog] [mDependency transformers >=0.5 && <0.7: using transformers-0.6.1.0
[2m[hedgehog] [mDependency transformers-base >=0.4.5.1 && <0.5: using transformers-base-0.4.6
[2m[hedgehog] [mDependency wl-pprint-annotated >=0.0 && <0.2: using
[2m[hedgehog] [mwl-pprint-annotated-0.1.0.1
[2m[hedgehog] [mDependency base >=3 && <5: using base-4.19.0.0
[2m[hedgehog] [mDependency containers >=0.4 && <0.9: using containers-0.6.8
[2m[hedgehog] [mDependency hedgehog: using hedgehog-1.5
[2m[hedgehog] [mDependency mmorph >=1.0 && <1.3: using mmorph-1.2.0
[2m[hedgehog] [mDependency mtl >=2.1 && <2.4: using mtl-2.3.1
[2m[hedgehog] [mDependency pretty-show >=1.6 && <1.11: using pretty-show-1.10
[2m[hedgehog] [mDependency text >=1.1 && <2.2: using text-2.1
[2m[hedgehog] [mDependency transformers >=0.3 && <0.7: using transformers-0.6.1.0
[2m[vector] [m      scanr':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mSource component graph:
[2m[hedgehog] [m    component lib
[2m[hedgehog] [m    component test:test dependency lib
[2m[hedgehog] [mConfigured component graph:
[2m[hedgehog] [m    component hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hedgehog] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[hedgehog] [m        include barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[hedgehog] [m        include base-4.19.0.0-b960
[2m[hedgehog] [m        include bytestring-0.12.0.2-4690
[2m[hedgehog] [m        include concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[hedgehog] [m        include containers-0.6.8-4775
[2m[hedgehog] [m        include deepseq-1.5.0.0-412f
[2m[hedgehog] [m        include directory-1.3.8.1-6a8e
[2m[hedgehog] [m        include erf-2.0.0.0-BwyR9YGZlxuwpYm1ZK7E3
[2m[hedgehog] [m        include exceptions-0.10.7-d3e7
[2m[hedgehog] [m        include lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[hedgehog] [m        include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
[2m[hedgehog] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[hedgehog] [m        include mtl-2.3.1-63a4
[2m[hedgehog] [m        include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
[2m[hedgehog] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[hedgehog] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hedgehog] [m        include resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[hedgehog] [m        include safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[hedgehog] [m        include stm-2.5.2.1-83fa
[2m[hedgehog] [m        include template-haskell-2.21.0.0-8831
[2m[hedgehog] [m        include text-2.1-c36a
[2m[hedgehog] [m        include time-1.12.2-d26d
[2m[hedgehog] [m        include transformers-0.6.1.0-c3ec
[2m[hedgehog] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[hedgehog] [m        include wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[hedgehog] [m    component hedgehog-1.5-9mlLd9RWgXOH2Dh5T2jzdt-test
[2m[hedgehog] [m        include base-4.19.0.0-b960
[2m[hedgehog] [m        include containers-0.6.8-4775
[2m[hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [m        include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
[2m[hedgehog] [m        include mtl-2.3.1-63a4
[2m[hedgehog] [m        include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
[2m[hedgehog] [m        include text-2.1-c36a
[2m[hedgehog] [m        include transformers-0.6.1.0-c3ec
[2m[hedgehog] [mLinked component graph:
[2m[hedgehog] [m    unit hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [m        include ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hedgehog] [m        include async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[hedgehog] [m        include barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[hedgehog] [m        include base-4.19.0.0-b960
[2m[hedgehog] [m        include bytestring-0.12.0.2-4690
[2m[hedgehog] [m        include concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[hedgehog] [m        include containers-0.6.8-4775
[2m[hedgehog] [m        include deepseq-1.5.0.0-412f
[2m[hedgehog] [m        include directory-1.3.8.1-6a8e
[2m[hedgehog] [m        include erf-2.0.0.0-BwyR9YGZlxuwpYm1ZK7E3
[2m[hedgehog] [m        include exceptions-0.10.7-d3e7
[2m[hedgehog] [m        include lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[hedgehog] [m        include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
[2m[hedgehog] [m        include monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[hedgehog] [m        include mtl-2.3.1-63a4
[2m[hedgehog] [m        include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
[2m[hedgehog] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[hedgehog] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hedgehog] [m        include resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[hedgehog] [m        include safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[hedgehog] [m        include stm-2.5.2.1-83fa
[2m[hedgehog] [m        include template-haskell-2.21.0.0-8831
[2m[hedgehog] [m        include text-2.1-c36a
[2m[hedgehog] [m        include time-1.12.2-d26d
[2m[hedgehog] [m        include transformers-0.6.1.0-c3ec
[2m[hedgehog] [m        include transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[hedgehog] [m        include wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[hedgehog] [m        Hedgehog=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog,Hedgehog.Gen=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Gen,Hedgehog.Internal.Barbie=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Barbie,Hedgehog.Internal.Config=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Config,Hedgehog.Internal.Discovery=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Discovery,Hedgehog.Internal.Distributive=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Distributive,Hedgehog.Internal.Exception=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Exception,Hedgehog.Internal.Gen=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Gen,Hedgehog.Internal.HTraversable=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.HTraversable,Hedgehog.Internal.Opaque=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Opaque,Hedgehog.Internal.Prelude=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Prelude,Hedgehog.Internal.Property=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Property,Hedgehog.Internal.Queue=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Queue,Hedgehog.Internal.Range=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Range,Hedgehog.Internal.Region=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Region,Hedgehog.Internal.Report=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Report,Hedgehog.Internal.Runner=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Runner,Hedgehog.Internal.Seed=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Seed,Hedgehog.Internal.Show=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Show,Hedgehog.Internal.Shrink=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Shrink,Hedgehog.Internal.Source=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Source,Hedgehog.Internal.State=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.State,Hedgehog.Internal.TH=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.TH,Hedgehog.Internal.Tree=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Tree,Hedgehog.Internal.Tripping=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Internal.Tripping,Hedgehog.Main=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Main,Hedgehog.Range=hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK:Hedgehog.Range
[2m[hedgehog] [m    unit hedgehog-1.5-9mlLd9RWgXOH2Dh5T2jzdt-test
[2m[hedgehog] [m        include base-4.19.0.0-b960
[2m[hedgehog] [m        include containers-0.6.8-4775
[2m[hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [m        include mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
[2m[hedgehog] [m        include mtl-2.3.1-63a4
[2m[hedgehog] [m        include pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
[2m[hedgehog] [m        include text-2.1-c36a
[2m[hedgehog] [m        include transformers-0.6.1.0-c3ec
[2m[hedgehog] [mReady component graph:
[2m[hedgehog] [m    definite hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [m        depends ansi-terminal-1.1.2-BSOLUPgLdL7g1uLwspCAQ
[2m[hedgehog] [m        depends async-2.2.5-4iGqEhfeonCFkQqAVgJzMM
[2m[hedgehog] [m        depends barbies-2.1.1.0-B6UYCcN21if5vG2GztECG1
[2m[hedgehog] [m        depends base-4.19.0.0-b960
[2m[hedgehog] [m        depends bytestring-0.12.0.2-4690
[2m[hedgehog] [m        depends concurrent-output-1.10.21-8XAqUIeIxYk529rhS9VGsK
[2m[hedgehog] [m        depends containers-0.6.8-4775
[2m[hedgehog] [m        depends deepseq-1.5.0.0-412f
[2m[hedgehog] [m        depends directory-1.3.8.1-6a8e
[2m[hedgehog] [m        depends erf-2.0.0.0-BwyR9YGZlxuwpYm1ZK7E3
[2m[hedgehog] [m        depends exceptions-0.10.7-d3e7
[2m[hedgehog] [m        depends lifted-async-0.10.2.7-75RyUSW3Zd28S5iPNW83Pb
[2m[hedgehog] [m        depends mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
[2m[hedgehog] [m        depends monad-control-1.0.3.1-2eP4sBl3ucx13tmhY6OKWV
[2m[hedgehog] [m        depends mtl-2.3.1-63a4
[2m[hedgehog] [m        depends pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
[2m[hedgehog] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[hedgehog] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[hedgehog] [m        depends resourcet-1.3.0-8y8Kx5pDEaaF2JgpMADoWC
[2m[hedgehog] [m        depends safe-exceptions-0.1.7.4-3ShHADtaJwdGvWUSZS1UKv
[2m[hedgehog] [m        depends stm-2.5.2.1-83fa
[2m[hedgehog] [m        depends template-haskell-2.21.0.0-8831
[2m[hedgehog] [m        depends text-2.1-c36a
[2m[hedgehog] [m        depends time-1.12.2-d26d
[2m[hedgehog] [m        depends transformers-0.6.1.0-c3ec
[2m[hedgehog] [m        depends transformers-base-0.4.6-8H5i1t5nCEIAC4vKFNraWg
[2m[hedgehog] [m        depends wl-pprint-annotated-0.1.0.1-3osBR396cSn418NXykY5x3
[2m[hedgehog] [m    definite hedgehog-1.5-9mlLd9RWgXOH2Dh5T2jzdt-test
[2m[hedgehog] [m        depends base-4.19.0.0-b960
[2m[hedgehog] [m        depends containers-0.6.8-4775
[2m[hedgehog] [m        depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [m        depends mmorph-1.2.0-8X6cuR5yRhs9dF9SHeOjcs
[2m[hedgehog] [m        depends mtl-2.3.1-63a4
[2m[hedgehog] [m        depends pretty-show-1.10-EakGXTGwrxfK2WvfKoHfgK
[2m[hedgehog] [m        depends text-2.1-c36a
[2m[hedgehog] [m        depends transformers-0.6.1.0-c3ec
[2m[hedgehog] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[hedgehog] [mUsing compiler: ghc-9.8.1
[2m[hedgehog] [mUsing install prefix: /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
[2m[hedgehog] [mExecutables installed in:
[2m[hedgehog] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/bin
[2m[hedgehog] [mLibraries installed in:
[2m[hedgehog] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[hedgehog] [mDynamic Libraries installed in:
[2m[hedgehog] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[vector] [m      mut_foldM':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mPrivate executables installed in:
[2m[hedgehog] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/libexec/x86_64-linux-ghc-9.8.1/hedgehog-1.5
[2m[hedgehog] [mData files installed in:
[2m[hedgehog] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/share/x86_64-linux-ghc-9.8.1/hedgehog-1.5
[2m[hedgehog] [mDocumentation installed in:
[2m[hedgehog] [m/nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc/share/doc/hedgehog-1.5
[2m[hedgehog] [mConfiguration files installed in:
[2m[hedgehog] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/etc
[2m[hedgehog] [mNo alex found
[2m[hedgehog] [mUsing ar found on system at:
[2m[hedgehog] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[hedgehog] [mNo c2hs found
[2m[hedgehog] [mNo cpphs found
[2m[hedgehog] [mNo doctest found
[2m[hedgehog] [mUsing gcc version 14.3.0 given by user at:
[2m[hedgehog] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[hedgehog] [mUsing ghc version 9.8.1 found on system at:
[2m[hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[hedgehog] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[hedgehog] [mNo ghcjs found
[2m[hedgehog] [mNo ghcjs-pkg found
[2m[hedgehog] [mNo greencard found
[2m[hedgehog] [mUsing haddock version 2.30.0 found on system at:
[2m[hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[hedgehog] [mNo happy found
[2m[hedgehog] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[hedgehog] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[hedgehog] [mNo hmake found
[2m[hedgehog] [mUsing hpc version 0.69 found on system at:
[2m[hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[hedgehog] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[hedgehog] [mUsing hscolour version 1.25 found on system at:
[2m[hedgehog] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[hedgehog] [mNo jhc found
[2m[hedgehog] [mUsing ld found on system at:
[2m[hedgehog] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[hedgehog] [mNo pkg-config found
[2m[hedgehog] [mUsing runghc version 9.8.1 found on system at:
[2m[hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[hedgehog] [mUsing strip version 2.44 found on system at:
[2m[hedgehog] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[hedgehog] [mUsing tar found on system at:
[2m[hedgehog] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[hedgehog] [mNo uhc found
[2m[vector] [m      mut_ifoldM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 27 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 1 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Storable
[2m[vector] [m    Data.Vector.Storable.Vector (Int)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[1;36mPhase: buildPhase[m
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mPreprocessing library for hedgehog-1.5..
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [mBuilding library for hedgehog-1.5..
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m    Data.Vector.Storable.Vector (Double)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, dist/build/Hedgehog/Internal/Barbie.o, dist/build/Hedgehog/Internal/Barbie.dyn_o )
[2m[vector] [m      mapM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[smallcheck] [m[1;36mPhase: checkPhase[m
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mPackage has no test suites.
[2m[smallcheck] [m[1;36mPhase: haddockPhase[m
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldl':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldr:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      foldr':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, dist/build/Hedgehog/Internal/Distributive.o, dist/build/Hedgehog/Internal/Distributive.dyn_o )
[2m[vector] [m      foldr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mPreprocessing library for smallcheck-1.2.1.1..
[2m[smallcheck] [mRunning Haddock on library for smallcheck-1.2.1.1..
[2m[vector] [m      ifoldM_:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[smallcheck] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[smallcheck] [m[1 of 6] Compiling Test.SmallCheck.Property.Result ( Test/SmallCheck/Property/Result.hs, nothing )
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[2 of 6] Compiling Test.SmallCheck.SeriesMonad ( Test/SmallCheck/SeriesMonad.hs, nothing )
[2m[vector] [m      mut_imapM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[3 of 6] Compiling Test.SmallCheck.Series ( Test/SmallCheck/Series.hs, nothing )
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, dist/build/Hedgehog/Internal/Exception.o, dist/build/Hedgehog/Internal/Exception.dyn_o )
[2m[hedgehog] [m[ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, dist/build/Hedgehog/Internal/HTraversable.o, dist/build/Hedgehog/Internal/HTraversable.dyn_o )
[2m[hedgehog] [m[ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, dist/build/Hedgehog/Internal/Opaque.o, dist/build/Hedgehog/Internal/Opaque.dyn_o )
[2m[hedgehog] [m[ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, dist/build/Hedgehog/Internal/Prelude.o, dist/build/Hedgehog/Internal/Prelude.dyn_o )
[2m[hedgehog] [m[ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, dist/build/Hedgehog/Internal/Range.o, dist/build/Hedgehog/Internal/Range.dyn_o )
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Strict
[2m[vector] [m    Bool
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, dist/build/Hedgehog/Internal/Region.o, dist/build/Hedgehog/Internal/Region.dyn_o )
[2m[hedgehog] [m[ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, dist/build/Hedgehog/Internal/Seed.o, dist/build/Hedgehog/Internal/Seed.dyn_o )
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 27 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 26 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      and:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      or:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    Int
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, nothing )
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, dist/build/Hedgehog/Internal/Show.o, dist/build/Hedgehog/Internal/Show.dyn_o )
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, dist/build/Hedgehog/Internal/Shrink.o, dist/build/Hedgehog/Internal/Shrink.dyn_o )
[2m[hedgehog] [m[12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, dist/build/Hedgehog/Internal/Source.o, dist/build/Hedgehog/Internal/Source.dyn_o )
[2m[hedgehog] [m[13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, dist/build/Hedgehog/Internal/Tree.o, dist/build/Hedgehog/Internal/Tree.dyn_o )
[2m[vector] [m      mapM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, nothing )
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[6 of 6] Compiling Test.SmallCheck  ( Test/SmallCheck.hs, nothing )
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[smallcheck] [mHaddock coverage:
[2m[smallcheck] [mWarning: 'Series' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/SeriesMonad.hs:46:22
[2m[smallcheck] [m    * at Test/SmallCheck/SeriesMonad.hs:46:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/SeriesMonad.hs:46:1
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[smallcheck] [mWarning: 'NonEmpty' is ambiguous. It is defined
[2m[smallcheck] [m    * in ‘GHC.Base’
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:1121:22
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:1121:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/Series.hs:1121:1
[2m[smallcheck] [mWarning: 'NonZero' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:1084:21
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:1084:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/Series.hs:1084:1
[2m[smallcheck] [mWarning: 'NonNegative' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:1040:25
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:1040:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/Series.hs:1040:1
[2m[smallcheck] [mWarning: 'Positive' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:996:22
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:996:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/Series.hs:996:1
[2m[smallcheck] [mWarning: 'M' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:753:15
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:753:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/Series.hs:753:1
[2m[smallcheck] [mWarning: 'N' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:712:15
[2m[smallcheck] [m    * at Test/SmallCheck/Series.hs:712:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/Series.hs:712:1
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mWarning: 'Series' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/SeriesMonad.hs:46:22
[2m[smallcheck] [m    * at Test/SmallCheck/SeriesMonad.hs:46:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/SeriesMonad.hs:46:1
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m 100% ( 56 / 56) in 'Test.SmallCheck.Series'
[2m[smallcheck] [mWarning: 'Series' is ambiguous. It is defined
[2m[smallcheck] [m    * at Test/SmallCheck/SeriesMonad.hs:46:22
[2m[smallcheck] [m    * at Test/SmallCheck/SeriesMonad.hs:46:1
[2m[smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[smallcheck] [m    Defaulting to the one defined at Test/SmallCheck/SeriesMonad.hs:46:1
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m 100% ( 11 / 11) in 'Test.SmallCheck.Drivers'
[2m[smallcheck] [m 100% ( 21 / 21) in 'Test.SmallCheck'
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      fmap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      return:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      bind:                                                                OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mzip:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      munzip:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_pure:                                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      applicative_appl:                                                    OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Tests.Vector.Unboxed
[2m[vector] [m    ()
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 27 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mWarning: Test.SmallCheck.Series: could not find link destinations for: 
[2m[smallcheck] [m	- Test.SmallCheck.Series.GCoSerial
[2m[smallcheck] [m	- Test.SmallCheck.Series.GSerial
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.16s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Bool)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[14 of 27] Compiling Hedgehog.Main    ( src/Hedgehog/Main.hs, dist/build/Hedgehog/Main.o, dist/build/Hedgehog/Main.dyn_o )
[2m[hedgehog] [m[15 of 27] Compiling Hedgehog.Range   ( src/Hedgehog/Range.hs, dist/build/Hedgehog/Range.o, dist/build/Hedgehog/Range.dyn_o )
[2m[hedgehog] [m[16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, dist/build/Hedgehog/Internal/Gen.o, dist/build/Hedgehog/Internal/Gen.dyn_o )
[2m[vector] [m      mut_iforM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      and:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      or:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Int)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 10 discarded.
[2m[vector] [m    (Float)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 26 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 2 discarded.
[2m[vector] [m    (Double)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[smallcheck] [mDocumentation created: dist/doc/html/smallcheck/,
[2m[smallcheck] [mdist/doc/html/smallcheck/smallcheck.txt
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m[17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, dist/build/Hedgehog/Internal/Property.o, dist/build/Hedgehog/Internal/Property.dyn_o )
[2m[vector] [m      accum:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[1;36mPhase: installPhase[m
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.03s)
[2m[smallcheck] [mInstalling library in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Property.hs:433:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m    |[0m[0m
[2m[hedgehog] [m[;1m[34m433 |[0m[0m     groups = List.map (\l -> ([;1m[35mhead[0m[0m l, length l)) $ List.group sp
[2m[hedgehog] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[vector] [m      zipWith:                                                             OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldl':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      foldr:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      foldr':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [m[1;36mPhase: fixupPhase[m
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1
[2m[vector] [m      prescanl:                                                            OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mshrinking /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSsmallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk-ghc9.8.1.so
[2m[smallcheck] [mchecking for references to /build/ in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1...
[2m[vector] [m      postscanl:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mpatching script interpreter paths in /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1
[2m[vector] [m      scanl:                                                               OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mstripping (with command strip and flags -S -p) in  /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1/lib
[2m[vector] [m      scanl':                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc
[2m[smallcheck] [mchecking for references to /build/ in /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc...
[2m[smallcheck] [mpatching script interpreter paths in /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc
[2m[vector] [m      iscanr:                                                              OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[smallcheck:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc[m
[2m[smallcheck:post-build] [m[2mPushing 2 paths (68 are already present) using zstd to cache sellout ⏳[m
[2m[smallcheck:post-build] [m[2m[m
[2m[smallcheck:post-build] [m[2mPushing /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 (6.71 MiB)[m
[2m[smallcheck:post-build] [m[2mPushing /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc (1.97 MiB)[m
[2m[smallcheck:post-build] [m[2m[m
[2m[smallcheck:post-build] [m[2mAll done.[m
[2m[smallcheck:post-build] [m[2mUploading to the NixCI cache: /nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1 /nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc[m
[2m[smallcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[smallcheck:post-build] [m[2mcopying 2 paths...[m
[2m[smallcheck:post-build] [m[2mcopying path '/nix/store/wc36cgbbh240g6acd2irz5j4lr09g87b-smallcheck-1.2.1.1-doc' to 'https://cache.nix-ci.com'...[m
[2m[smallcheck:post-build] [m[2mcopying path '/nix/store/2b541dafhmrj4gsk2h4229hl0lygsjxd-smallcheck-1.2.1.1' to 'https://cache.nix-ci.com'...[m
[2m[smallcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[smallcheck:post-build] [m[2mcopying 1 paths...[m
[2m[smallcheck:post-build] [m[2mcopying path '/nix/store/sxj3qqxf7awzli4lkwmrqhbzdwvrz3sp-smallcheck-1.2.1.1.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 29 of 48 built (2 building)[m
[1;34mBuilding /nix/store/4wi66qphj36m7fxwhw032c9jj721fqpp-tasty-smallcheck-0.8.2.drv[m
[2m[hedgehog] [m[18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, dist/build/Hedgehog/Internal/Tripping.o, dist/build/Hedgehog/Internal/Tripping.dyn_o )
[2m[hedgehog] [m[19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, dist/build/Hedgehog/Internal/State.o, dist/build/Hedgehog/Internal/State.dyn_o )
[2m[hedgehog] [m[20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, dist/build/Hedgehog/Internal/Discovery.o, dist/build/Hedgehog/Internal/Discovery.dyn_o )
[2m[hedgehog] [m[21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, dist/build/Hedgehog/Internal/TH.o, dist/build/Hedgehog/Internal/TH.dyn_o )
[2m[hedgehog] [m[22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, dist/build/Hedgehog/Internal/Config.o, dist/build/Hedgehog/Internal/Config.dyn_o )
[2m[hedgehog] [m[23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, dist/build/Hedgehog/Internal/Report.o, dist/build/Hedgehog/Internal/Report.dyn_o )
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Report.hs:1096:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m     |[0m[0m
[2m[hedgehog] [m[;1m[34m1096 |[0m[0m           replicate fillErrorWidth ([;1m[35mhead[0m[0m parts)
[2m[hedgehog] [m[;1m[34m     |[0m[0m[;1m[35m                                     ^^^^[0m[0m
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Report.hs:1098:39: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m     |[0m[0m
[2m[hedgehog] [m[;1m[34m1098 |[0m[0m           replicate fillSurplusWidth ([;1m[35mhead[0m[0m parts)
[2m[hedgehog] [m[;1m[34m     |[0m[0m[;1m[35m                                       ^^^^[0m[0m
[2m[hedgehog] [m[24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, dist/build/Hedgehog/Internal/Queue.o, dist/build/Hedgehog/Internal/Queue.dyn_o )
[2m[hedgehog] [m[25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, dist/build/Hedgehog/Internal/Runner.o, dist/build/Hedgehog/Internal/Runner.dyn_o )
[2m[hedgehog] [m[26 of 27] Compiling Hedgehog.Gen     ( src/Hedgehog/Gen.hs, dist/build/Hedgehog/Gen.o, dist/build/Hedgehog/Gen.dyn_o )
[2m[hedgehog] [m[27 of 27] Compiling Hedgehog         ( src/Hedgehog.hs, dist/build/Hedgehog.o, dist/build/Hedgehog.dyn_o )
[2m[hedgehog] [m[ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, dist/build/Hedgehog/Internal/Barbie.p_o )
[2m[vector] [m      mut_generateM:                                                       OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 17 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sum:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      product:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromN:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromTo:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      enumFromThenTo:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests; 6 discarded.
[2m[vector] [m    (Int,Bool)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    (Int,Bool,Int)
[2m[vector] [m      fromList.toList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      toList.fromList == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream.stream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      stream.unstream == id:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      eq:                                                                  OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      length:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      null:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      index:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      safeIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      head:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      unsafeIndex:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      unsafeLast:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m      slice:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      init:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      tail:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      take:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      drop:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      splitAt:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      empty:                                                               OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      singleton:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicate:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generate:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iterateNM:                                                           OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      generateM:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      replicateM:                                                          OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      create:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      createT:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldr:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrN:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactN:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrNM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unfoldrExactNM:                                                      OK (0.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructN:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      constructrN:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      cons:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      snoc:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      append:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concat:                                                              OK (0.05s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      force:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      upd:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      accum:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      reverse:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      backpermute:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      map:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imap:                                                                OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      concatMap:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      forM_:                                                               OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapM_:                                                              OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWith3:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWith3:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      izipWithM_:                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM_:                                                           OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filter:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifilter:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      filterM:                                                             OK (0.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      uniq:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      takeWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      dropWhile:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partition:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      span:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      break:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      spanR:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      breakR:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      groupBy:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elem:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      notElem:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      find:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndexR:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      findIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndex:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      elemIndices:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      foldr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests; 13 discarded.
[2m[vector] [m      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      ifoldl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM_:                                                             OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      ifoldM'_:                                                            OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      all:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      any:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanl':                                                           OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanl':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      prescanr':                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      postscanr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_read:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      mut_generate:                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_generateM:                                                       OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_mapM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_imapM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_iforM_:                                                          OK (0.04s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldr':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldl':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldM':                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldrM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldM':                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM:                                                         OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_ifoldrM':                                                        OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      compare:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      maximum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      minIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      minIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m      ListFirstMaxIndexWins:                                               OK
[2m[vector] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m      FalseListFirstMaxIndexWins:                                          OK
[2m[vector] [m        +++ OK, failed as expected. (after 1 test):
[2m[vector] [m        Exception:
[2m[vector] [m          Prelude.foldr1: empty list
[2m[vector] [m          CallStack (from HasCallStack):
[2m[vector] [m            error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
[2m[vector] [m            errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
[2m[vector] [m            foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      zip:                                                                 OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zip3:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip:                                                               OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unzip3:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      indexed:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      update:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 1 test.
[2m[vector] [m      mappend:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mconcat:                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      glength:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m    unstream
[2m[vector] [m      unstream == vunstream (exact):                                       OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstream == vunstream (unknown):                                     OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (exact):                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      unstreamR ~= vunstream (unknown):                                    OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m  Data.Vector.Storable.Vector Alignment
[2m[vector] [m    Aligned Double:                                                        OK
[2m[vector] [m    Aligned Int:                                                           OK
[2m[vector] [m  Regression tests
[2m[vector] [m    enumFromTo crash #188
[2m[vector] [m      Word8:                                                               OK
[2m[vector] [m      Word16:                                                              OK
[2m[vector] [m      Word32:                                                              OK
[2m[vector] [m      Word64:                                                              OK
[2m[vector] [m      Word:                                                                OK
[2m[vector] [m      Int8:                                                                OK
[2m[vector] [m      Int16:                                                               OK
[2m[vector] [m      Int32:                                                               OK
[2m[vector] [m      Int64:                                                               OK
[2m[vector] [m      Int:                                                                 OK
[2m[vector] [m      Char:                                                                OK
[2m[vector] [m  Negative tests
[2m[vector] [m    slice out of bounds #257
[2m[vector] [m      Boxed
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m      Primitive
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m      Storable
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m      Unboxed
[2m[vector] [m        Negative ix:                                                       OK
[2m[vector] [m        Negative size:                                                     OK
[2m[vector] [m        Negative ix and size:                                              OK
[2m[vector] [m        Too large ix:                                                      OK
[2m[vector] [m        Too large size:                                                    OK
[2m[vector] [m        Too large ix and size:                                             OK
[2m[vector] [m        Overflow:                                                          OK
[2m[vector] [m        OutOfMemory:                                                       OK
[2m[vector] [m    take #282
[2m[vector] [m      Boxed:                                                               OK
[2m[vector] [m      Primitive:                                                           OK
[2m[vector] [m      Storable:                                                            OK
[2m[vector] [m      Unboxed:                                                             OK
[2m[vector] [m  Data.Vector
[2m[vector] [m    MonadFix:                                                              OK
[2m[vector] [m    toFromArray:                                                           OK
[2m[vector] [m    toFromArraySlice:                                                      OK
[2m[vector] [m    toFromArraySliceUnsafe:                                                OK
[2m[vector] [m    toFromMutableArray:                                                    OK
[2m[vector] [m  Data.Vector.Mutable (Move):                                              OK
[2m[vector] [m    +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m  Data.Vector.Primitive.Mutable (Move):                                    OK
[2m[vector] [m    +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m  Data.Vector.Unboxed.Mutable (Move):                                      OK
[2m[vector] [m    +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m  Data.Vector.Storable.Mutable (Move):                                     OK
[2m[vector] [m    +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m  Data.Vector.Generic.Mutable (nextPermutation):                           OK
[2m[vector] [m    +++ OK, passed 1 test.
[2m[vector] [m  Data.Vector.Generic.Mutable (prevPermutation):                           OK (0.01s)
[2m[vector] [m    +++ OK, passed 1 test.
[2m[vector] [m  Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
[2m[vector] [m    +++ OK, passed 100 tests.
[2m[vector] [m  Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
[2m[vector] [m    +++ OK, passed 100 tests.
[2m[vector] [m
[2m[vector] [mAll 2808 tests passed (13.75s)
[2m[vector] [mTest suite vector-tests-O2: PASS
[2m[vector] [mTest suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
[2m[vector] [m2 of 2 test suites (2 of 2 test cases) passed.
[2m[vector] [mcheckPhase completed in 37 seconds
[2m[vector] [m[1;36mPhase: haddockPhase[m
[2m[vector] [m[1;36mPhase: installPhase[m
[2m[vector] [mInstalling library in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[tasty-smallcheck] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[tasty-smallcheck] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[hedgehog] [m[ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, dist/build/Hedgehog/Internal/Distributive.p_o )
[2m[tasty-smallcheck] [m[1;36mPhase: unpackPhase[m
[2m[tasty-smallcheck] [munpacking source archive /nix/store/0x239pdac4vkzizdq057g48dka8hh4al-tasty-smallcheck-0.8.2.tar.gz
[2m[tasty-smallcheck] [msource root is tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [msetting SOURCE_DATE_EPOCH to timestamp 1608313170 of file "tasty-smallcheck-0.8.2/tasty-smallcheck.cabal"
[2m[tasty-smallcheck] [m[1;36mPhase: patchPhase[m
[2m[tasty-smallcheck] [mReplace Cabal file with edited version from mirror://hackage/tasty-smallcheck-0.8.2/revision/1.cabal.
[2m[tasty-smallcheck] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[tasty-smallcheck] [msetupCompileFlags: -package-db=/build/tmp.SrVseikyg4/setup-package.conf.d -threaded
[2m[tasty-smallcheck] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.SrVseikyg4/Main.o )
[2m[tasty-smallcheck] [m[2 of 2] Linking Setup
[2m[vector] [mInstalling internal library benchmarks-O2 in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
[2m[vector] [m[1;36mPhase: fixupPhase[m
[2m[hedgehog] [m[ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, dist/build/Hedgehog/Internal/Exception.p_o )
[2m[hedgehog] [m[ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, dist/build/Hedgehog/Internal/HTraversable.p_o )
[2m[hedgehog] [m[ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, dist/build/Hedgehog/Internal/Opaque.p_o )
[2m[hedgehog] [m[ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, dist/build/Hedgehog/Internal/Prelude.p_o )
[2m[hedgehog] [m[ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, dist/build/Hedgehog/Internal/Range.p_o )
[2m[hedgehog] [m[ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, dist/build/Hedgehog/Internal/Region.p_o )
[2m[hedgehog] [m[ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, dist/build/Hedgehog/Internal/Seed.p_o )
[2m[vector] [mshrinking RPATHs of ELF executables and libraries in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
[2m[vector] [mshrinking /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-0.13.2.0-KITycIPQp0R25115diGgzh-ghc9.8.1.so
[2m[vector] [mshrinking /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2-ghc9.8.1.so
[2m[vector] [mchecking for references to /build/ in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0...
[2m[vector] [mpatching script interpreter paths in /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0
[2m[vector] [mstripping (with command strip and flags -S -p) in  /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0/lib
[2m[hedgehog] [m[10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, dist/build/Hedgehog/Internal/Show.p_o )
[2m[hedgehog] [m[11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, dist/build/Hedgehog/Internal/Shrink.p_o )
[2m[hedgehog] [m[12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, dist/build/Hedgehog/Internal/Source.p_o )
[2m[hedgehog] [m[13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, dist/build/Hedgehog/Internal/Tree.p_o )
[2m[vector:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0[m
[2m[vector:post-build] [m[2mPushing 1 paths (93 are already present) using zstd to cache sellout ⏳[m
[2m[vector:post-build] [m[2m[m
[2m[vector:post-build] [m[2mPushing /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0 (57.19 MiB)[m
[2m[vector:post-build] [m[2m[m
[2m[vector:post-build] [m[2mAll done.[m
[2m[vector:post-build] [m[2mUploading to the NixCI cache: /nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0[m
[2m[vector:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[vector:post-build] [m[2mcopying 1 paths...[m
[2m[vector:post-build] [m[2mcopying path '/nix/store/5v2551fmq65m4bk9blrfn0v7ai2fxjsd-vector-0.13.2.0' to 'https://cache.nix-ci.com'...[m
[2m[vector:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[vector:post-build] [m[2mcopying 1 paths...[m
[2m[vector:post-build] [m[2mcopying path '/nix/store/z5i7y0hxmdcp07w36h4nfxc77vf4c7xf-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 30 of 48 built (2 building)[m
[2m[hedgehog] [m[14 of 27] Compiling Hedgehog.Main    ( src/Hedgehog/Main.hs, dist/build/Hedgehog/Main.p_o )
[2m[hedgehog] [m[15 of 27] Compiling Hedgehog.Range   ( src/Hedgehog/Range.hs, dist/build/Hedgehog/Range.p_o )
[2m[hedgehog] [m[16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, dist/build/Hedgehog/Internal/Gen.p_o )
[2m[hedgehog] [m[17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, dist/build/Hedgehog/Internal/Property.p_o )
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Property.hs:433:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m    |[0m[0m
[2m[hedgehog] [m[;1m[34m433 |[0m[0m     groups = List.map (\l -> ([;1m[35mhead[0m[0m l, length l)) $ List.group sp
[2m[hedgehog] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[hedgehog] [m[18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, dist/build/Hedgehog/Internal/Tripping.p_o )
[2m[hedgehog] [m[19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, dist/build/Hedgehog/Internal/State.p_o )
[2m[hedgehog] [m[20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, dist/build/Hedgehog/Internal/Discovery.p_o )
[2m[hedgehog] [m[21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, dist/build/Hedgehog/Internal/TH.p_o )
[2m[hedgehog] [m[22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, dist/build/Hedgehog/Internal/Config.p_o )
[2m[hedgehog] [m[23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, dist/build/Hedgehog/Internal/Report.p_o )
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Report.hs:1096:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m     |[0m[0m
[2m[hedgehog] [m[;1m[34m1096 |[0m[0m           replicate fillErrorWidth ([;1m[35mhead[0m[0m parts)
[2m[hedgehog] [m[;1m[34m     |[0m[0m[;1m[35m                                     ^^^^[0m[0m
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Report.hs:1098:39: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m     |[0m[0m
[2m[hedgehog] [m[;1m[34m1098 |[0m[0m           replicate fillSurplusWidth ([;1m[35mhead[0m[0m parts)
[2m[hedgehog] [m[;1m[34m     |[0m[0m[;1m[35m                                       ^^^^[0m[0m
[2m[hedgehog] [m[24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, dist/build/Hedgehog/Internal/Queue.p_o )
[2m[hedgehog] [m[25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, dist/build/Hedgehog/Internal/Runner.p_o )
[2m[hedgehog] [m[26 of 27] Compiling Hedgehog.Gen     ( src/Hedgehog/Gen.hs, dist/build/Hedgehog/Gen.p_o )
[2m[hedgehog] [m[27 of 27] Compiling Hedgehog         ( src/Hedgehog.hs, dist/build/Hedgehog.p_o )
[2m[hedgehog] [mPreprocessing test suite 'test' for hedgehog-1.5..
[2m[hedgehog] [mBuilding test suite 'test' for hedgehog-1.5..
[2m[hedgehog] [m[1 of 9] Compiling Test.Hedgehog.Applicative ( test/Test/Hedgehog/Applicative.hs, dist/build/test/test-tmp/Test/Hedgehog/Applicative.o )
[2m[hedgehog] [m[2 of 9] Compiling Test.Hedgehog.Confidence ( test/Test/Hedgehog/Confidence.hs, dist/build/test/test-tmp/Test/Hedgehog/Confidence.o )
[2m[hedgehog] [m[3 of 9] Compiling Test.Hedgehog.Filter ( test/Test/Hedgehog/Filter.hs, dist/build/test/test-tmp/Test/Hedgehog/Filter.o )
[2m[tasty-smallcheck] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[tasty-smallcheck] [m[1;36mPhase: configurePhase[m
[2m[tasty-smallcheck] [mconfigureFlags: --verbose --prefix=/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc/share/doc/tasty-smallcheck-0.8.2 --with-gcc=gcc --package-db=/build/tmp.SrVseikyg4/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[tasty-smallcheck] [mUsing Parsec parser
[2m[tasty-smallcheck] [mConfiguring tasty-smallcheck-0.8.2...
[2m[tasty-smallcheck] [mDependency base >=4.8 && <5: using base-4.19.0.0
[2m[tasty-smallcheck] [mDependency optparse-applicative: using optparse-applicative-0.18.1.0
[2m[tasty-smallcheck] [mDependency smallcheck >=1.0: using smallcheck-1.2.1.1
[2m[tasty-smallcheck] [mDependency tagged: using tagged-0.8.8
[2m[tasty-smallcheck] [mDependency tasty >=0.8: using tasty-1.5.3
[2m[tasty-smallcheck] [mSource component graph: component lib
[2m[tasty-smallcheck] [mConfigured component graph:
[2m[tasty-smallcheck] [m    component tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[tasty-smallcheck] [m        include base-4.19.0.0-b960
[2m[tasty-smallcheck] [m        include optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
[2m[tasty-smallcheck] [m        include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[tasty-smallcheck] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-smallcheck] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-smallcheck] [mLinked component graph:
[2m[tasty-smallcheck] [m    unit tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[tasty-smallcheck] [m        include base-4.19.0.0-b960
[2m[tasty-smallcheck] [m        include optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
[2m[tasty-smallcheck] [m        include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[tasty-smallcheck] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-smallcheck] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-smallcheck] [m        Test.Tasty.SmallCheck=tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU:Test.Tasty.SmallCheck
[2m[tasty-smallcheck] [mReady component graph:
[2m[tasty-smallcheck] [m    definite tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[tasty-smallcheck] [m        depends base-4.19.0.0-b960
[2m[tasty-smallcheck] [m        depends optparse-applicative-0.18.1.0-JSftWZu2wf2IpYDe7m06qv
[2m[tasty-smallcheck] [m        depends smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[tasty-smallcheck] [m        depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-smallcheck] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-smallcheck] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[tasty-smallcheck] [mUsing compiler: ghc-9.8.1
[2m[tasty-smallcheck] [mUsing install prefix:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [mExecutables installed in:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/bin
[2m[tasty-smallcheck] [mLibraries installed in:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[tasty-smallcheck] [mDynamic Libraries installed in:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[tasty-smallcheck] [mPrivate executables installed in:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/libexec/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [mData files installed in:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/share/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [mDocumentation installed in:
[2m[tasty-smallcheck] [m/nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc/share/doc/tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [mConfiguration files installed in:
[2m[tasty-smallcheck] [m/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/etc
[2m[tasty-smallcheck] [mNo alex found
[2m[tasty-smallcheck] [mUsing ar found on system at:
[2m[tasty-smallcheck] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[tasty-smallcheck] [mNo c2hs found
[2m[tasty-smallcheck] [mNo cpphs found
[2m[tasty-smallcheck] [mNo doctest found
[2m[hedgehog] [m[4 of 9] Compiling Test.Hedgehog.Maybe ( test/Test/Hedgehog/Maybe.hs, dist/build/test/test-tmp/Test/Hedgehog/Maybe.o )
[2m[hedgehog] [m[5 of 9] Compiling Test.Hedgehog.Seed ( test/Test/Hedgehog/Seed.hs, dist/build/test/test-tmp/Test/Hedgehog/Seed.o )
[2m[hedgehog] [m[6 of 9] Compiling Test.Hedgehog.Skip ( test/Test/Hedgehog/Skip.hs, dist/build/test/test-tmp/Test/Hedgehog/Skip.o )
[2m[hedgehog] [m[7 of 9] Compiling Test.Hedgehog.Text ( test/Test/Hedgehog/Text.hs, dist/build/test/test-tmp/Test/Hedgehog/Text.o )
[2m[hedgehog] [m[8 of 9] Compiling Test.Hedgehog.Zip ( test/Test/Hedgehog/Zip.hs, dist/build/test/test-tmp/Test/Hedgehog/Zip.o )
[2m[hedgehog] [m[9 of 9] Compiling Main             ( test/test.hs, dist/build/test/test-tmp/Main.o )
[2m[hedgehog] [m[10 of 10] Linking dist/build/test/test
[2m[hedgehog] [mbuildPhase completed in 35 seconds
[2m[hedgehog] [m[1;36mPhase: checkPhase[m
[2m[hedgehog] [mRunning 1 test suites...
[2m[hedgehog] [mTest suite test: RUNNING...
[2m[hedgehog] [m━━━ Test.Hedgehog.Applicative ━━━
[2m[hedgehog] [m  ✓ prop_StateT_outside passed 100 tests.
[2m[hedgehog] [m  ✓ 1 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Confidence ━━━
[2m[hedgehog] [m  ✓ prop_with_confidence passed 300 tests.
[2m[hedgehog] [m    number == 1 32% ██████▍············· ✓ 20%
[2m[hedgehog] [m  ✓ prop_with_confidence_and_min_tests passed 1000 tests.
[2m[hedgehog] [m    number == 2 18% ███▋················ ✓ 10%
[2m[hedgehog] [m  ✓ 2 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Filter ━━━
[2m[hedgehog] [m  ✓ prop_filter_repetition passed 100 tests.
[2m[hedgehog] [m  ✓ prop_filter_even passed 100 tests.
[2m[hedgehog] [m  ✓ 2 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Maybe ━━━
[2m[hedgehog] [m  ✓ prop_mapMaybe passed 1 test.
[2m[hedgehog] [m  ✓ 1 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Seed ━━━
[2m[hedgehog] [m  ✓ prop_avoid_pathological_gamma_values passed 1 test.
[2m[hedgehog] [m  ✓ 1 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Skip ━━━
[2m[hedgehog] [m  ✓ prop_SkipNothing passed 1 test.
[2m[hedgehog] [m  ✓ prop_SkipToFailingTest passed 1 test.
[2m[hedgehog] [m  ✓ prop_SkipPastFailingTest passed 1 test.
[2m[hedgehog] [m  ✓ prop_SkipToNoShrink passed 1 test.
[2m[hedgehog] [m  ✓ prop_SkipToFailingShrink passed 1 test.
[2m[hedgehog] [m  ✓ prop_SkipToPassingShrink passed 1 test.
[2m[hedgehog] [m  ✓ prop_SkipToReportedShrink passed 1 test.
[2m[hedgehog] [m  ✓ prop_compressSkip passed 100 tests.
[2m[hedgehog] [m  ✓ prop_compressDecompressExamples passed 1 test.
[2m[hedgehog] [m  ✓ 9 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Text ━━━
[2m[hedgehog] [m  ✓ prop_show_append_size passed 100 tests.
[2m[hedgehog] [m  ✓ prop_tripping_append_size passed 100 tests.
[2m[hedgehog] [m  ✓ prop_show_append_seed passed 100 tests.
[2m[hedgehog] [m  ✓ prop_tripping_append_seed passed 100 tests.
[2m[hedgehog] [m  ✓ 4 succeeded.
[2m[hedgehog] [m━━━ Test.Hedgehog.Zip ━━━
[2m[hedgehog] [m  ✓ prop_gen_applicative passed 100 tests.
[2m[hedgehog] [m  ✓ 1 succeeded.
[2m[hedgehog] [mTest suite test: PASS
[2m[hedgehog] [mTest suite logged to: dist/test/hedgehog-1.5-test.log
[2m[hedgehog] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[hedgehog] [m[1;36mPhase: haddockPhase[m
[2m[hedgehog] [mPreprocessing library for hedgehog-1.5..
[2m[hedgehog] [mRunning Haddock on library for hedgehog-1.5..
[2m[hedgehog] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[hedgehog] [m[ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, nothing )
[2m[hedgehog] [m[ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, /build/ghc1118_0/ghc_24.o, /build/ghc1118_0/ghc_24.dyn_o )
[2m[hedgehog] [m[ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, /build/ghc1118_0/ghc_26.o, /build/ghc1118_0/ghc_26.dyn_o )
[2m[hedgehog] [m[ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, nothing )
[2m[hedgehog] [m[ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, nothing )
[2m[hedgehog] [m[ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, /build/ghc1118_0/ghc_30.o, /build/ghc1118_0/ghc_30.dyn_o )
[2m[hedgehog] [m[ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, /build/ghc1118_0/ghc_36.o, /build/ghc1118_0/ghc_36.dyn_o )
[2m[hedgehog] [m[ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, /build/ghc1118_0/ghc_38.o, /build/ghc1118_0/ghc_38.dyn_o )
[2m[hedgehog] [m[ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, /build/ghc1118_0/ghc_42.o, /build/ghc1118_0/ghc_42.dyn_o )
[2m[hedgehog] [m[10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, /build/ghc1118_0/ghc_44.o, /build/ghc1118_0/ghc_44.dyn_o )
[2m[tasty-smallcheck] [mUsing gcc version 14.3.0 given by user at:
[2m[tasty-smallcheck] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[tasty-smallcheck] [mUsing ghc version 9.8.1 found on system at:
[2m[tasty-smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[tasty-smallcheck] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[tasty-smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[tasty-smallcheck] [mNo ghcjs found
[2m[tasty-smallcheck] [mNo ghcjs-pkg found
[2m[tasty-smallcheck] [mNo greencard found
[2m[tasty-smallcheck] [mUsing haddock version 2.30.0 found on system at:
[2m[tasty-smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[tasty-smallcheck] [mNo happy found
[2m[tasty-smallcheck] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[tasty-smallcheck] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[tasty-smallcheck] [mNo hmake found
[2m[tasty-smallcheck] [mUsing hpc version 0.69 found on system at:
[2m[tasty-smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[tasty-smallcheck] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[tasty-smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[tasty-smallcheck] [mUsing hscolour version 1.25 found on system at:
[2m[tasty-smallcheck] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[tasty-smallcheck] [mNo jhc found
[2m[tasty-smallcheck] [mUsing ld found on system at:
[2m[tasty-smallcheck] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[tasty-smallcheck] [mNo pkg-config found
[2m[tasty-smallcheck] [mUsing runghc version 9.8.1 found on system at:
[2m[tasty-smallcheck] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[tasty-smallcheck] [mUsing strip version 2.44 found on system at:
[2m[tasty-smallcheck] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[tasty-smallcheck] [mUsing tar found on system at:
[2m[tasty-smallcheck] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[tasty-smallcheck] [mNo uhc found
[2m[tasty-smallcheck] [m[1;36mPhase: buildPhase[m
[2m[tasty-smallcheck] [mPreprocessing library for tasty-smallcheck-0.8.2..
[2m[tasty-smallcheck] [mBuilding library for tasty-smallcheck-0.8.2..
[2m[tasty-smallcheck] [m[1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, dist/build/Test/Tasty/SmallCheck.o, dist/build/Test/Tasty/SmallCheck.dyn_o )
[2m[tasty-smallcheck] [m[1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, dist/build/Test/Tasty/SmallCheck.p_o )
[2m[tasty-smallcheck] [m[1;36mPhase: checkPhase[m
[2m[tasty-smallcheck] [mPackage has no test suites.
[2m[tasty-smallcheck] [m[1;36mPhase: haddockPhase[m
[2m[tasty-smallcheck] [mPreprocessing library for tasty-smallcheck-0.8.2..
[2m[tasty-smallcheck] [mRunning Haddock on library for tasty-smallcheck-0.8.2..
[2m[tasty-smallcheck] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[tasty-smallcheck] [m[1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, nothing )
[2m[tasty-smallcheck] [mHaddock coverage:
[2m[tasty-smallcheck] [mWarning: 'SmallCheckDepth' is ambiguous. It is defined
[2m[tasty-smallcheck] [m    * at Test/Tasty/SmallCheck.hs:28:27
[2m[tasty-smallcheck] [m    * at Test/Tasty/SmallCheck.hs:28:1
[2m[tasty-smallcheck] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[tasty-smallcheck] [m    by specifying the type/value namespace explicitly.
[2m[tasty-smallcheck] [m    Defaulting to the one defined at Test/Tasty/SmallCheck.hs:28:1
[2m[tasty-smallcheck] [mWarning: 'Test' is out of scope.
[2m[tasty-smallcheck] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[tasty-smallcheck] [m 100% ( 15 / 15) in 'Test.Tasty.SmallCheck'
[2m[tasty-smallcheck] [mDocumentation created: dist/doc/html/tasty-smallcheck/,
[2m[tasty-smallcheck] [mdist/doc/html/tasty-smallcheck/tasty-smallcheck.txt
[2m[tasty-smallcheck] [m[1;36mPhase: installPhase[m
[2m[tasty-smallcheck] [mInstalling library in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[tasty-smallcheck] [m[1;36mPhase: fixupPhase[m
[2m[tasty-smallcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [mshrinking /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU-ghc9.8.1.so
[2m[tasty-smallcheck] [mchecking for references to /build/ in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2...
[2m[tasty-smallcheck] [mpatching script interpreter paths in /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2
[2m[tasty-smallcheck] [mstripping (with command strip and flags -S -p) in  /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2/lib
[2m[tasty-smallcheck] [mshrinking RPATHs of ELF executables and libraries in /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc
[2m[hedgehog] [m[11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, /build/ghc1118_0/ghc_46.o, /build/ghc1118_0/ghc_46.dyn_o )
[2m[hedgehog] [m[12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, /build/ghc1118_0/ghc_48.o, /build/ghc1118_0/ghc_48.dyn_o )
[2m[hedgehog] [m[13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, /build/ghc1118_0/ghc_50.o, /build/ghc1118_0/ghc_50.dyn_o )
[2m[hedgehog] [m[14 of 27] Compiling Hedgehog.Main    ( src/Hedgehog/Main.hs, nothing )
[2m[hedgehog] [m[15 of 27] Compiling Hedgehog.Range   ( src/Hedgehog/Range.hs, /build/ghc1118_0/ghc_52.o, /build/ghc1118_0/ghc_52.dyn_o )
[2m[hedgehog] [m[16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, /build/ghc1118_0/ghc_28.o, /build/ghc1118_0/ghc_28.dyn_o )
[2m[tasty-smallcheck] [mchecking for references to /build/ in /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc...
[2m[tasty-smallcheck] [mpatching script interpreter paths in /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc
[2m[tasty-smallcheck:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc[m
[2m[tasty-smallcheck:post-build] [m[2mPushing 2 paths (89 are already present) using zstd to cache sellout ⏳[m
[2m[tasty-smallcheck:post-build] [m[2m[m
[2m[tasty-smallcheck:post-build] [m[2mPushing /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 (358.59 KiB)[m
[2m[tasty-smallcheck:post-build] [m[2mPushing /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc (273.11 KiB)[m
[2m[tasty-smallcheck:post-build] [m[2m[m
[2m[tasty-smallcheck:post-build] [m[2mAll done.[m
[2m[tasty-smallcheck:post-build] [m[2mUploading to the NixCI cache: /nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2 /nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc[m
[2m[tasty-smallcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[tasty-smallcheck:post-build] [m[2mcopying 2 paths...[m
[2m[tasty-smallcheck:post-build] [m[2mcopying path '/nix/store/hh0qh8js6q5jiyh7da1hv4lic8cwf1w2-tasty-smallcheck-0.8.2-doc' to 'https://cache.nix-ci.com'...[m
[2m[tasty-smallcheck:post-build] [m[2mcopying path '/nix/store/67kl9an42zi3rxmavjyzp74935z9dddx-tasty-smallcheck-0.8.2' to 'https://cache.nix-ci.com'...[m
[2m[tasty-smallcheck:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[tasty-smallcheck:post-build] [m[2mcopying 1 paths...[m
[2m[tasty-smallcheck:post-build] [m[2mcopying path '/nix/store/4wi66qphj36m7fxwhw032c9jj721fqpp-tasty-smallcheck-0.8.2.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 31 of 47 built (1 building)[m
[1;34mBuilding /nix/store/w3k022qgh9jnjzrax7zxd61gdyj6c7sc-integer-logarithms-1.0.4.drv[m
[2m[hedgehog] [m[17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, /build/ghc1118_0/ghc_32.o, /build/ghc1118_0/ghc_32.dyn_o )
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Property.hs:433:31: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m    |[0m[0m
[2m[hedgehog] [m[;1m[34m433 |[0m[0m     groups = List.map (\l -> ([;1m[35mhead[0m[0m l, length l)) $ List.group sp
[2m[hedgehog] [m[;1m[34m    |[0m[0m[;1m[35m                               ^^^^[0m[0m
[2m[hedgehog] [m[18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, nothing )
[2m[hedgehog] [m[19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, nothing )
[2m[hedgehog] [m[20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, /build/ghc1118_0/ghc_22.o, /build/ghc1118_0/ghc_22.dyn_o )
[2m[hedgehog] [m[21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, nothing )
[2m[hedgehog] [m[22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, /build/ghc1118_0/ghc_20.o, /build/ghc1118_0/ghc_20.dyn_o )
[2m[hedgehog] [m[23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, /build/ghc1118_0/ghc_40.o, /build/ghc1118_0/ghc_40.dyn_o )
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Report.hs:1096:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m     |[0m[0m
[2m[hedgehog] [m[;1m[34m1096 |[0m[0m           replicate fillErrorWidth ([;1m[35mhead[0m[0m parts)
[2m[hedgehog] [m[;1m[34m     |[0m[0m[;1m[35m                                     ^^^^[0m[0m
[2m[hedgehog] [m
[2m[hedgehog] [m[;1msrc/Hedgehog/Internal/Report.hs:1098:39: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[hedgehog] [m    In the use of ‘head’
[2m[hedgehog] [m    (imported from Hedgehog.Internal.Prelude, but defined in GHC.List):
[2m[hedgehog] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[hedgehog] [m[;1m[34m     |[0m[0m
[2m[hedgehog] [m[;1m[34m1098 |[0m[0m           replicate fillSurplusWidth ([;1m[35mhead[0m[0m parts)
[2m[hedgehog] [m[;1m[34m     |[0m[0m[;1m[35m                                       ^^^^[0m[0m
[2m[hedgehog] [m[24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, /build/ghc1118_0/ghc_34.o, /build/ghc1118_0/ghc_34.dyn_o )
[2m[hedgehog] [m[25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, nothing )
[2m[hedgehog] [m[26 of 27] Compiling Hedgehog.Gen     ( src/Hedgehog/Gen.hs, nothing )
[2m[hedgehog] [m[27 of 27] Compiling Hedgehog         ( src/Hedgehog.hs, nothing )
[2m[hedgehog] [mHaddock coverage:
[2m[hedgehog] [m  75% (  3 /  4) in 'Hedgehog.Internal.Barbie'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Rec
[2m[hedgehog] [m   0% (  0 /  2) in 'Hedgehog.Internal.Distributive'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    MonadTransDistributive (src/Hedgehog/Internal/Distributive.hs:31)
[2m[hedgehog] [m   0% (  0 /  3) in 'Hedgehog.Internal.Exception'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    tryAll (src/Hedgehog/Internal/Exception.hs:14)
[2m[hedgehog] [m    tryEvaluate (src/Hedgehog/Internal/Exception.hs:23)
[2m[hedgehog] [m  50% (  1 /  2) in 'Hedgehog.Internal.HTraversable'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m  50% (  1 /  2) in 'Hedgehog.Internal.Opaque'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m  97% (135 /139) in 'Hedgehog.Internal.Prelude'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Bool
[2m[hedgehog] [m    Ordering
[2m[hedgehog] [m    even
[2m[hedgehog] [m    odd
[2m[hedgehog] [mWarning: 'Size' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Range.hs:56:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Range.hs:55:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Range.hs:55:1
[2m[hedgehog] [mWarning: 'Range' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Range.hs:81:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Range.hs:80:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Range.hs:80:1
[2m[hedgehog] [m  96% ( 32 / 33) in 'Hedgehog.Internal.Range'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m   0% (  0 / 10) in 'Hedgehog.Internal.Region'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    Region (src/Hedgehog/Internal/Region.hs:29)
[2m[hedgehog] [m    newEmptyRegion (src/Hedgehog/Internal/Region.hs:35)
[2m[hedgehog] [m    newOpenRegion (src/Hedgehog/Internal/Region.hs:41)
[2m[hedgehog] [m    openRegion (src/Hedgehog/Internal/Region.hs:48)
[2m[hedgehog] [m    setRegion (src/Hedgehog/Internal/Region.hs:64)
[2m[hedgehog] [m    displayRegions (src/Hedgehog/Internal/Region.hs:78)
[2m[hedgehog] [m    displayRegion (src/Hedgehog/Internal/Region.hs:87)
[2m[hedgehog] [m    moveToBottom (src/Hedgehog/Internal/Region.hs:91)
[2m[hedgehog] [m    finishRegion (src/Hedgehog/Internal/Region.hs:115)
[2m[hedgehog] [mWarning: 'Seed' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Seed.hs:75:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Seed.hs:74:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Seed.hs:74:1
[2m[hedgehog] [m  70% ( 12 / 17) in 'Hedgehog.Internal.Seed'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    mix64 (src/Hedgehog/Internal/Seed.hs:177)
[2m[hedgehog] [m    mix64variant13 (src/Hedgehog/Internal/Seed.hs:193)
[2m[hedgehog] [m    mix32 (src/Hedgehog/Internal/Seed.hs:185)
[2m[hedgehog] [m    mixGamma (src/Hedgehog/Internal/Seed.hs:201)
[2m[hedgehog] [m    global (src/Hedgehog/Internal/Seed.hs:97)
[2m[hedgehog] [m  13% (  2 / 15) in 'Hedgehog.Internal.Show'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    ValueDiff (src/Hedgehog/Internal/Show.hs:30)
[2m[hedgehog] [m    LineDiff (src/Hedgehog/Internal/Show.hs:39)
[2m[hedgehog] [m    mkValue (src/Hedgehog/Internal/Show.hs:74)
[2m[hedgehog] [m    showPretty (src/Hedgehog/Internal/Show.hs:78)
[2m[hedgehog] [m    valueDiff (src/Hedgehog/Internal/Show.hs:93)
[2m[hedgehog] [m    lineDiff (src/Hedgehog/Internal/Show.hs:82)
[2m[hedgehog] [m    toLineDiff (src/Hedgehog/Internal/Show.hs:86)
[2m[hedgehog] [m    renderValue (src/Hedgehog/Internal/Show.hs:55)
[2m[hedgehog] [m    renderValueDiff (src/Hedgehog/Internal/Show.hs:59)
[2m[hedgehog] [m    renderLineDiff (src/Hedgehog/Internal/Show.hs:65)
[2m[hedgehog] [m    takeLeft (src/Hedgehog/Internal/Show.hs:127)
[2m[hedgehog] [m    takeRight (src/Hedgehog/Internal/Show.hs:142)
[2m[hedgehog] [mWarning: 'k' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [m  85% (  6 /  7) in 'Hedgehog.Internal.Shrink'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m  50% (  5 / 10) in 'Hedgehog.Internal.Source'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    LineNo (src/Hedgehog/Internal/Source.hs:24)
[2m[hedgehog] [m    ColumnNo (src/Hedgehog/Internal/Source.hs:29)
[2m[hedgehog] [m    Span (src/Hedgehog/Internal/Source.hs:34)
[2m[hedgehog] [m    getCaller (src/Hedgehog/Internal/Source.hs:44)
[2m[hedgehog] [mWarning: 'NodeT' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:131:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:130:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:130:1
[2m[hedgehog] [mWarning: 'TreeT' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:105:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:104:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:104:1
[2m[hedgehog] [mWarning: 'Node' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:125:1
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:116:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:116:1
[2m[hedgehog] [mWarning: 'Tree' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:95:1
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:89:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:89:1
[2m[hedgehog] [m  78% ( 22 / 28) in 'Hedgehog.Internal.Tree'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    mapMaybe (src/Hedgehog/Internal/Tree.hs:257)
[2m[hedgehog] [m    mapMaybeMaybeT (src/Hedgehog/Internal/Tree.hs:277)
[2m[hedgehog] [m    consChild (src/Hedgehog/Internal/Tree.hs:325)
[2m[hedgehog] [m    mapMaybeT (src/Hedgehog/Internal/Tree.hs:314)
[2m[hedgehog] [m    interleave (src/Hedgehog/Internal/Tree.hs:388)
[2m[hedgehog] [m  66% (  2 /  3) in 'Hedgehog.Main'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m  96% ( 25 / 26) in 'Hedgehog.Range'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [mWarning: 'GenT' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Gen.hs:257:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Gen.hs:256:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Gen.hs:256:1
[2m[hedgehog] [mWarning: 'Size' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Range.hs:56:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Range.hs:55:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Range.hs:55:1
[2m[hedgehog] [mWarning: 'Seed' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Seed.hs:75:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Seed.hs:74:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Seed.hs:74:1
[2m[hedgehog] [mWarning: 'list' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Gen.hs:1501:1
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Shrink.hs:79:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Shrink.hs:79:1
[2m[hedgehog] [mWarning: 'filter' is ambiguous. It is defined
[2m[hedgehog] [m    * in ‘Data.List.NonEmpty’
[2m[hedgehog] [m    * in ‘Data.ByteString’
[2m[hedgehog] [m    * in ‘Data.Map.Internal’
[2m[hedgehog] [m    * in ‘Data.Sequence.Internal’
[2m[hedgehog] [m    * in ‘Data.Set.Internal’
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Gen.hs:1342:1
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:254:1
[2m[hedgehog] [m    * in ‘Data.Text’
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:254:1
[2m[hedgehog] [mWarning: 'mapMaybeT' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Gen.hs:1420:1
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:314:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:314:1
[2m[hedgehog] [mWarning: 'mfilter' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'mapMaybe' is ambiguous. It is defined
[2m[hedgehog] [m    * in ‘Data.Maybe’
[2m[hedgehog] [m    * in ‘Data.Map.Internal’
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Gen.hs:1359:1
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Tree.hs:257:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:257:1
[2m[hedgehog] [mWarning: 'a' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'b' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'n' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'withTests' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'property' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [m  97% (124 /127) in 'Hedgehog.Internal.Gen'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    Vec (src/Hedgehog/Internal/Gen.hs:1609)
[2m[hedgehog] [m    Nat (src/Hedgehog/Internal/Gen.hs:1605)
[2m[hedgehog] [mWarning: 'OverloadedStrings' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'Class' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'ShrinkPath' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:397:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:396:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:396:1
[2m[hedgehog] [mWarning: 'r' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'ExceptT' is ambiguous. It is defined
[2m[hedgehog] [m    * in ‘Control.Monad.Trans.Except’
[2m[hedgehog] [m    * in ‘Control.Monad.Trans.Except’
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined in ‘Control.Monad.Trans.Except’
[2m[hedgehog] [mWarning: 'TestT' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:243:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:242:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:242:1
[2m[hedgehog] [mWarning: 'PropertyT' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:208:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:207:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:207:1
[2m[hedgehog] [mWarning: 'Property' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:199:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:198:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:198:1
[2m[hedgehog] [mWarning: 'Confidence' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:274:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:273:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:273:1
[2m[hedgehog] [mWarning: 'ShrinkRetries' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:546:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:545:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:545:1
[2m[hedgehog] [mWarning: 'Label' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:593:5
[2m[hedgehog] [m    * at src/Hedgehog/Internal/Property.hs:672:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:672:1
[2m[hedgehog] [mWarning: 'ClassifierName' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [m  86% ( 87 /101) in 'Hedgehog.Internal.Property'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    MonadTest (src/Hedgehog/Internal/Property.hs:766)
[2m[hedgehog] [m    coverPercentage (src/Hedgehog/Internal/Property.hs:1342)
[2m[hedgehog] [m    labelCovered (src/Hedgehog/Internal/Property.hs:1355)
[2m[hedgehog] [m    coverageFailures (src/Hedgehog/Internal/Property.hs:1364)
[2m[hedgehog] [m    journalCoverage (src/Hedgehog/Internal/Property.hs:1441)
[2m[hedgehog] [m    toCoverCount (src/Hedgehog/Internal/Property.hs:1317)
[2m[hedgehog] [m    TerminationCriteria (src/Hedgehog/Internal/Property.hs:576)
[2m[hedgehog] [m    verifiedTermination (src/Hedgehog/Internal/Property.hs:1228)
[2m[hedgehog] [m    mkTest (src/Hedgehog/Internal/Property.hs:826)
[2m[hedgehog] [m    mkTestT (src/Hedgehog/Internal/Property.hs:822)
[2m[hedgehog] [m    runTest (src/Hedgehog/Internal/Property.hs:834)
[2m[hedgehog] [m    runTestT (src/Hedgehog/Internal/Property.hs:830)
[2m[hedgehog] [m    wilsonBounds (src/Hedgehog/Internal/Property.hs:1403)
[2m[hedgehog] [m  50% (  1 /  2) in 'Hedgehog.Internal.Tripping'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [mWarning: 'Command' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:383:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:382:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/State.hs:382:1
[2m[hedgehog] [mWarning: 'Action' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:415:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:414:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/State.hs:414:1
[2m[hedgehog] [mWarning: 'Symbolic' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:108:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:107:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/State.hs:107:1
[2m[hedgehog] [mWarning: 'Concrete' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:135:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:134:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/State.hs:134:1
[2m[hedgehog] [mWarning: 'Var' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:177:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:176:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/State.hs:176:1
[2m[hedgehog] [m  96% ( 31 / 32) in 'Hedgehog.Internal.State'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m   0% (  0 /  7) in 'Hedgehog.Internal.Discovery'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    PropertySource (src/Hedgehog/Internal/Discovery.hs:35)
[2m[hedgehog] [m    readProperties (src/Hedgehog/Internal/Discovery.hs:41)
[2m[hedgehog] [m    findProperties (src/Hedgehog/Internal/Discovery.hs:67)
[2m[hedgehog] [m    readDeclaration (src/Hedgehog/Internal/Discovery.hs:45)
[2m[hedgehog] [m    Pos (src/Hedgehog/Internal/Discovery.hs:209)
[2m[hedgehog] [m    Position (src/Hedgehog/Internal/Discovery.hs:202)
[2m[hedgehog] [mWarning: 'prop_' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [m  25% (  1 /  4) in 'Hedgehog.Internal.TH'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    TExpQ (src/Hedgehog/Internal/TH.hs:30)
[2m[hedgehog] [m    discoverPrefix (src/Hedgehog/Internal/TH.hs:51)
[2m[hedgehog] [m  29% (  5 / 17) in 'Hedgehog.Internal.Config'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    resolveColor (src/Hedgehog/Internal/Config.hs:191)
[2m[hedgehog] [m    resolveSeed (src/Hedgehog/Internal/Config.hs:198)
[2m[hedgehog] [m    resolveVerbosity (src/Hedgehog/Internal/Config.hs:205)
[2m[hedgehog] [m    resolveWorkers (src/Hedgehog/Internal/Config.hs:212)
[2m[hedgehog] [m    resolveSkip (src/Hedgehog/Internal/Config.hs:219)
[2m[hedgehog] [m    detectMark (src/Hedgehog/Internal/Config.hs:76)
[2m[hedgehog] [m    detectColor (src/Hedgehog/Internal/Config.hs:103)
[2m[hedgehog] [m    detectSeed (src/Hedgehog/Internal/Config.hs:137)
[2m[hedgehog] [m    detectVerbosity (src/Hedgehog/Internal/Config.hs:147)
[2m[hedgehog] [m    detectWorkers (src/Hedgehog/Internal/Config.hs:165)
[2m[hedgehog] [m    detectSkip (src/Hedgehog/Internal/Config.hs:175)
[2m[hedgehog] [m  26% (  7 / 26) in 'Hedgehog.Internal.Report'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    FailureReport (src/Hedgehog/Internal/Report.hs:100)
[2m[hedgehog] [m    FailedAnnotation (src/Hedgehog/Internal/Report.hs:94)
[2m[hedgehog] [m    Style (src/Hedgehog/Internal/Report.hs:205)
[2m[hedgehog] [m    Markup (src/Hedgehog/Internal/Report.hs:211)
[2m[hedgehog] [m    Config (src/Hedgehog/Internal/Report.hs:1316)
[2m[hedgehog] [m    defaultConfig (src/Hedgehog/Internal/Report.hs:1335)
[2m[hedgehog] [m    Context (src/Hedgehog/Internal/Report.hs:573)
[2m[hedgehog] [m    Lines (src/Hedgehog/Internal/Report.hs:567)
[2m[hedgehog] [m    renderProgress (src/Hedgehog/Internal/Report.hs:1310)
[2m[hedgehog] [m    renderResult (src/Hedgehog/Internal/Report.hs:1314)
[2m[hedgehog] [m    renderResultWith (src/Hedgehog/Internal/Report.hs:1338)
[2m[hedgehog] [m    renderSummary (src/Hedgehog/Internal/Report.hs:1342)
[2m[hedgehog] [m    renderDoc (src/Hedgehog/Internal/Report.hs:1190)
[2m[hedgehog] [m    ppProgress (src/Hedgehog/Internal/Report.hs:800)
[2m[hedgehog] [m    ppResult (src/Hedgehog/Internal/Report.hs:823)
[2m[hedgehog] [m    ppResultWith (src/Hedgehog/Internal/Report.hs:826)
[2m[hedgehog] [m    ppSummary (src/Hedgehog/Internal/Report.hs:1148)
[2m[hedgehog] [m    mkFailure (src/Hedgehog/Internal/Report.hs:286)
[2m[hedgehog] [m  12% (  1 /  8) in 'Hedgehog.Internal.Queue'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    TaskIndex (src/Hedgehog/Internal/Queue.hs:32)
[2m[hedgehog] [m    TasksRemaining (src/Hedgehog/Internal/Queue.hs:36)
[2m[hedgehog] [m    runTasks (src/Hedgehog/Internal/Queue.hs:59)
[2m[hedgehog] [m    finalizeTask (src/Hedgehog/Internal/Queue.hs:107)
[2m[hedgehog] [m    runActiveFinalizers (src/Hedgehog/Internal/Queue.hs:83)
[2m[hedgehog] [m    dequeueMVar (src/Hedgehog/Internal/Queue.hs:43)
[2m[hedgehog] [m  64% (  9 / 14) in 'Hedgehog.Internal.Runner'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [m    recheckAt (src/Hedgehog/Internal/Runner.hs:442)
[2m[hedgehog] [m    checkReport (src/Hedgehog/Internal/Runner.hs:215)
[2m[hedgehog] [m    checkRegion (src/Hedgehog/Internal/Runner.hs:389)
[2m[hedgehog] [m    checkNamed (src/Hedgehog/Internal/Runner.hs:419)
[2m[hedgehog] [m  98% ( 93 / 94) in 'Hedgehog.Gen'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    Module header
[2m[hedgehog] [mWarning: 'Command' is ambiguous. It is defined
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:383:3
[2m[hedgehog] [m    * at src/Hedgehog/Internal/State.hs:382:1
[2m[hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[hedgehog] [m    Defaulting to the one defined at src/Hedgehog/Internal/State.hs:382:1
[2m[hedgehog] [mWarning: 'DeriveGeneric' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'DeriveAnyClass' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [mWarning: 'DerivingStrategies' is out of scope.
[2m[hedgehog] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[hedgehog] [m  94% ( 93 / 98) in 'Hedgehog'
[2m[hedgehog] [m  Missing documentation for:
[2m[hedgehog] [m    recheckAt (src/Hedgehog/Internal/Runner.hs:442)
[2m[hedgehog] [m    discoverPrefix (src/Hedgehog/Internal/TH.hs:51)
[2m[hedgehog] [m    verifiedTermination (src/Hedgehog/Internal/Property.hs:1228)
[2m[hedgehog] [m    MonadTest (src/Hedgehog/Internal/Property.hs:766)
[2m[hedgehog] [m    Rec
[2m[integer-logarithms] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[integer-logarithms] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[integer-logarithms] [m[1;36mPhase: unpackPhase[m
[2m[integer-logarithms] [munpacking source archive /nix/store/ph0i5ssdxwdx25fp5i1sbmq6177nxsr9-integer-logarithms-1.0.4.tar.gz
[2m[integer-logarithms] [msource root is integer-logarithms-1.0.4
[2m[integer-logarithms] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "integer-logarithms-1.0.4/test-suite/Test.hs"
[2m[integer-logarithms] [m[1;36mPhase: patchPhase[m
[2m[integer-logarithms] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[integer-logarithms] [msetupCompileFlags: -package-db=/build/tmp.rxLKaW9j2u/setup-package.conf.d -threaded
[2m[hedgehog] [mWarning: Hedgehog.Internal.Barbie: could not find link destinations for: 
[2m[hedgehog] [m	- Barbies.Generics.Constraints.P
[2m[hedgehog] [m	- Barbies.Generics.Constraints.GAllRec
[2m[hedgehog] [mWarning: Hedgehog.Internal.Distributive: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.Distributive.R:TransformerfMaybeTm
[2m[hedgehog] [m	- Hedgehog.Internal.Distributive.R:TransformerfIdentityTm
[2m[hedgehog] [m	- Hedgehog.Internal.Tree.R:TransformerfTreeTm
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:TransformertGenTm
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:TransformertTestTm
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:TransformertPropertyTm
[2m[integer-logarithms] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.rxLKaW9j2u/Main.o )
[2m[integer-logarithms] [m[2 of 2] Linking Setup
[2m[hedgehog] [mWarning: Hedgehog.Internal.Prelude: could not find link destinations for: 
[2m[hedgehog] [m	- GHC.Prim.~#
[2m[hedgehog] [m	- Data.Functor.Utils.StateT
[2m[hedgehog] [m	- Data.Functor.Utils.Max
[2m[hedgehog] [m	- Data.Functor.Utils.Min
[2m[hedgehog] [m	- Data.Functor.Utils.StateL
[2m[hedgehog] [m	- Data.Functor.Utils.StateR
[2m[hedgehog] [m	- GHC.Generics.SingKind
[2m[hedgehog] [m	- GHC.Generics.DemoteRep
[2m[hedgehog] [m	- GHC.Generics.fromSing
[2m[hedgehog] [m	- GHC.Generics.SingI
[2m[hedgehog] [m	- GHC.Generics.sing
[2m[hedgehog] [m	- GHC.Generics.Sing
[2m[hedgehog] [m	- GHC.Generics.D:R:UReckWordp0
[2m[hedgehog] [m	- GHC.Generics.D:R:UReckIntp0
[2m[hedgehog] [m	- GHC.Generics.D:R:UReckFloatp0
[2m[hedgehog] [m	- GHC.Generics.D:R:UReckDoublep0
[2m[hedgehog] [m	- GHC.Generics.D:R:UReckCharp0
[2m[hedgehog] [m	- GHC.Generics.Rep1_Either
[2m[hedgehog] [m	- GHC.Generics.Rep1_Maybe
[2m[hedgehog] [m	- GHC.Generics.Rep_Ordering
[2m[hedgehog] [m	- GHC.Generics.Rep_Bool
[2m[hedgehog] [m	- GHC.Generics.Rep_Either
[2m[hedgehog] [m	- GHC.Generics.Rep_Maybe
[2m[hedgehog] [m	- GHC.Generics.Rep_R:UReckWordp
[2m[hedgehog] [m	- GHC.Generics.Rep1_R:UReckWordp
[2m[hedgehog] [m	- GHC.Generics.Rep_R:UReckIntp
[2m[hedgehog] [m	- GHC.Generics.Rep1_R:UReckIntp
[2m[hedgehog] [m	- GHC.Generics.Rep1_R:UReckFloatp
[2m[hedgehog] [m	- GHC.Generics.Rep_R:UReckDoublep
[2m[hedgehog] [m	- GHC.Generics.Rep1_R:UReckDoublep
[2m[hedgehog] [m	- GHC.Generics.Rep_R:UReckCharp
[2m[hedgehog] [m	- GHC.Generics.Rep1_R:UReckCharp
[2m[hedgehog] [m	- GHC.IOPort.IOPort
[2m[hedgehog] [m	- Data.Foldable1.JoinWith
[2m[hedgehog] [m	- Data.Foldable1.FromMaybe
[2m[hedgehog] [m	- Data.Foldable1.NonEmptyDList
[2m[hedgehog] [m	- Data.ByteString.Builder.RealFloat.FormatMode
[2m[hedgehog] [m	- Data.Text.Internal.Encoding.PartialUtf8CodePoint
[2m[hedgehog] [m	- Text.ParserCombinators.ReadP.P
[2m[hedgehog] [m	- GHC.Generics.D:R:SingBoola0
[2m[hedgehog] [m	- GHC.Generics.STrue
[2m[hedgehog] [m	- GHC.Generics.D:R:DemoteRepBool
[2m[hedgehog] [m	- GHC.Generics.SFalse
[2m[hedgehog] [m	- GHC.Generics.Rep_R:UReckFloatp
[2m[hedgehog] [m	- GHC.Generics.D:R:SingMaybeb0
[2m[hedgehog] [m	- GHC.Generics.SNothing
[2m[hedgehog] [m	- GHC.Generics.SJust
[2m[hedgehog] [m	- GHC.Generics.D:R:DemoteRepMaybe
[2m[hedgehog] [m	- System.Console.Regions.LineUpdate
[2m[hedgehog] [m	- Control.Monad.Trans.Control.D:R:StMIOa
[2m[hedgehog] [m	- Control.Monad.Trans.Control.D:R:StMMaybea
[2m[hedgehog] [m	- Control.Monad.Primitive.D:R:PrimStateIO
[2m[hedgehog] [m	- Data.Set.Internal.MergeSet
[2m[hedgehog] [m	- Text.Printf.UPrintf
[2m[hedgehog] [m	- Text.Printf.hspr
[2m[hedgehog] [m	- Text.Printf.spr
[2m[hedgehog] [m	- GHC.IOPort.IOPortException
[2m[hedgehog] [m	- Data.Graph.SetM
[2m[hedgehog] [mWarning: Hedgehog.Internal.Region: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.Region.Body
[2m[hedgehog] [mWarning: Hedgehog.Internal.Source: could not find link destinations for: 
[2m[hedgehog] [m	- GHC.IsList.D:R:ItemCallStack
[2m[hedgehog] [mWarning: Hedgehog.Internal.Tree: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.Tree.D:R:PrimStateTreeT
[2m[hedgehog] [m	- Hedgehog.Internal.Tree.R:TransformerfTreeTm
[2m[hedgehog] [mWarning: Hedgehog.Internal.Gen: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:PrimStateGenT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:TransformertGenTm
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseWriterT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseWriterT0
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseStateT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseStateT0
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseReaderT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseExceptT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseMaybeT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseIdentityT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseGenT
[2m[hedgehog] [mWarning: Hedgehog.Internal.Property: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:StTTestTa
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:PrimStateTestT
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:TransformertTestTm
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:PrimStatePropertyT
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:TransformertPropertyTm
[2m[hedgehog] [mWarning: Hedgehog.Internal.State: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.State.Context
[2m[hedgehog] [mWarning: Hedgehog: could not find link destinations for: 
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:PrimStateGenT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:TransformertGenTm
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseWriterT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseWriterT0
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseStateT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseStateT0
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseReaderT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseExceptT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseMaybeT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseIdentityT
[2m[hedgehog] [m	- Hedgehog.Internal.Gen.D:R:GenBaseGenT
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:StTTestTa
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:PrimStateTestT
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:TransformertTestTm
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:PrimStatePropertyT
[2m[hedgehog] [m	- Hedgehog.Internal.Property.D:R:TransformertPropertyTm
[2m[hedgehog] [m	- Barbies.Generics.Constraints.P
[2m[hedgehog] [m	- Barbies.Generics.Constraints.GAllRec
[2m[integer-logarithms] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[integer-logarithms] [m[1;36mPhase: configurePhase[m
[2m[integer-logarithms] [mconfigureFlags: --verbose --prefix=/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc/share/doc/integer-logarithms-1.0.4 --with-gcc=gcc --package-db=/build/tmp.rxLKaW9j2u/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[integer-logarithms] [mUsing Parsec parser
[2m[integer-logarithms] [mConfiguring integer-logarithms-1.0.4...
[2m[integer-logarithms] [mFlags chosen: check-bounds=False, integer-gmp=True
[2m[integer-logarithms] [mDependency array >=0.5.3.0 && <0.6: using array-0.5.6.0
[2m[integer-logarithms] [mDependency base >=4.15 && <4.22: using base-4.19.0.0
[2m[integer-logarithms] [mDependency ghc-bignum >=1.0 && <1.4: using ghc-bignum-1.3
[2m[integer-logarithms] [mDependency ghc-prim <0.14: using ghc-prim-0.11.0
[2m[integer-logarithms] [mDependency QuickCheck >=2.14.1 && <2.16: using QuickCheck-2.14.3
[2m[integer-logarithms] [mDependency base: using base-4.19.0.0
[2m[integer-logarithms] [mDependency integer-logarithms: using integer-logarithms-1.0.4
[2m[integer-logarithms] [mDependency smallcheck >=1.2 && <1.3: using smallcheck-1.2.1.1
[2m[integer-logarithms] [mDependency tasty >=1.4 && <1.6: using tasty-1.5.3
[2m[integer-logarithms] [mDependency tasty-hunit >=0.10 && <0.11: using tasty-hunit-0.10.2
[2m[integer-logarithms] [mDependency tasty-quickcheck >=0.10 && <0.12: using tasty-quickcheck-0.11
[2m[integer-logarithms] [mDependency tasty-smallcheck >=0.8 && <0.9: using tasty-smallcheck-0.8.2
[2m[integer-logarithms] [mSource component graph:
[2m[integer-logarithms] [m    component lib
[2m[integer-logarithms] [m    component test:spec dependency lib
[2m[integer-logarithms] [mConfigured component graph:
[2m[integer-logarithms] [m    component integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m        include array-0.5.6.0-dc89
[2m[integer-logarithms] [m        include base-4.19.0.0-b960
[2m[integer-logarithms] [m        include ghc-bignum-1.3-5487
[2m[integer-logarithms] [m        include ghc-prim-0.11.0-a69e
[2m[integer-logarithms] [m    component integer-logarithms-1.0.4-2pEGdHlgDPS9e1U8YHMnQI-spec
[2m[integer-logarithms] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[integer-logarithms] [m        include base-4.19.0.0-b960
[2m[integer-logarithms] [m        include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m        include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[integer-logarithms] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[integer-logarithms] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[integer-logarithms] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[integer-logarithms] [m        include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[integer-logarithms] [mLinked component graph:
[2m[integer-logarithms] [m    unit integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m        include array-0.5.6.0-dc89
[2m[integer-logarithms] [m        include base-4.19.0.0-b960
[2m[integer-logarithms] [m        include ghc-bignum-1.3-5487
[2m[integer-logarithms] [m        include ghc-prim-0.11.0-a69e
[2m[integer-logarithms] [m        GHC.Integer.Logarithms.Compat=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:GHC.Integer.Logarithms.Compat,Math.NumberTheory.Logarithms=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:Math.NumberTheory.Logarithms,Math.NumberTheory.Powers.Integer=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:Math.NumberTheory.Powers.Integer,Math.NumberTheory.Powers.Natural=integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH:Math.NumberTheory.Powers.Natural
[2m[integer-logarithms] [m    unit integer-logarithms-1.0.4-2pEGdHlgDPS9e1U8YHMnQI-spec
[2m[integer-logarithms] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[integer-logarithms] [m        include base-4.19.0.0-b960
[2m[integer-logarithms] [m        include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m        include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[integer-logarithms] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[integer-logarithms] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[integer-logarithms] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[integer-logarithms] [m        include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[integer-logarithms] [mReady component graph:
[2m[integer-logarithms] [m    definite integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m        depends array-0.5.6.0-dc89
[2m[integer-logarithms] [m        depends base-4.19.0.0-b960
[2m[integer-logarithms] [m        depends ghc-bignum-1.3-5487
[2m[integer-logarithms] [m        depends ghc-prim-0.11.0-a69e
[2m[integer-logarithms] [m    definite integer-logarithms-1.0.4-2pEGdHlgDPS9e1U8YHMnQI-spec
[2m[integer-logarithms] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[integer-logarithms] [m        depends base-4.19.0.0-b960
[2m[integer-logarithms] [m        depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m        depends smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[integer-logarithms] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[integer-logarithms] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[integer-logarithms] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[integer-logarithms] [m        depends tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[integer-logarithms] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[integer-logarithms] [mUsing compiler: ghc-9.8.1
[2m[integer-logarithms] [mUsing install prefix:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
[2m[integer-logarithms] [mExecutables installed in:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/bin
[2m[integer-logarithms] [mLibraries installed in:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [mDynamic Libraries installed in:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[integer-logarithms] [mPrivate executables installed in:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/libexec/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4
[2m[integer-logarithms] [mData files installed in:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/share/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4
[2m[integer-logarithms] [mDocumentation installed in:
[2m[integer-logarithms] [m/nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc/share/doc/integer-logarithms-1.0.4
[2m[integer-logarithms] [mConfiguration files installed in:
[2m[integer-logarithms] [m/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/etc
[2m[integer-logarithms] [mNo alex found
[2m[integer-logarithms] [mUsing ar found on system at:
[2m[integer-logarithms] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[integer-logarithms] [mNo c2hs found
[2m[integer-logarithms] [mNo cpphs found
[2m[integer-logarithms] [mNo doctest found
[2m[integer-logarithms] [mUsing gcc version 14.3.0 given by user at:
[2m[integer-logarithms] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[integer-logarithms] [mUsing ghc version 9.8.1 found on system at:
[2m[integer-logarithms] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[integer-logarithms] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[integer-logarithms] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[integer-logarithms] [mNo ghcjs found
[2m[integer-logarithms] [mNo ghcjs-pkg found
[2m[integer-logarithms] [mNo greencard found
[2m[integer-logarithms] [mUsing haddock version 2.30.0 found on system at:
[2m[integer-logarithms] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[integer-logarithms] [mNo happy found
[2m[integer-logarithms] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[integer-logarithms] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[integer-logarithms] [mNo hmake found
[2m[integer-logarithms] [mUsing hpc version 0.69 found on system at:
[2m[integer-logarithms] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[integer-logarithms] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[integer-logarithms] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[integer-logarithms] [mUsing hscolour version 1.25 found on system at:
[2m[integer-logarithms] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[integer-logarithms] [mNo jhc found
[2m[integer-logarithms] [mUsing ld found on system at:
[2m[integer-logarithms] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[integer-logarithms] [mNo pkg-config found
[2m[integer-logarithms] [mUsing runghc version 9.8.1 found on system at:
[2m[integer-logarithms] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[integer-logarithms] [mUsing strip version 2.44 found on system at:
[2m[integer-logarithms] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[integer-logarithms] [mUsing tar found on system at:
[2m[integer-logarithms] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[integer-logarithms] [mNo uhc found
[2m[integer-logarithms] [m[1;36mPhase: buildPhase[m
[2m[integer-logarithms] [mPreprocessing library for integer-logarithms-1.0.4..
[2m[integer-logarithms] [mBuilding library for integer-logarithms-1.0.4..
[2m[integer-logarithms] [m[1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, dist/build/GHC/Integer/Logarithms/Compat.o, dist/build/GHC/Integer/Logarithms/Compat.dyn_o )
[2m[integer-logarithms] [m[2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.o, dist/build/Math/NumberTheory/Logarithms.dyn_o )
[2m[integer-logarithms] [m[3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, dist/build/Math/NumberTheory/Powers/Integer.o, dist/build/Math/NumberTheory/Powers/Integer.dyn_o )
[2m[integer-logarithms] [m[4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, dist/build/Math/NumberTheory/Powers/Natural.o, dist/build/Math/NumberTheory/Powers/Natural.dyn_o )
[2m[integer-logarithms] [m[1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, dist/build/GHC/Integer/Logarithms/Compat.p_o )
[2m[integer-logarithms] [m[2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.p_o )
[2m[integer-logarithms] [m[3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, dist/build/Math/NumberTheory/Powers/Integer.p_o )
[2m[integer-logarithms] [m[4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, dist/build/Math/NumberTheory/Powers/Natural.p_o )
[2m[hedgehog] [mDocumentation created: dist/doc/html/hedgehog/,
[2m[hedgehog] [mdist/doc/html/hedgehog/hedgehog.txt
[2m[hedgehog] [mPreprocessing test suite 'test' for hedgehog-1.5..
[2m[hedgehog] [m[1;36mPhase: installPhase[m
[2m[hedgehog] [mInstalling library in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[integer-logarithms] [mPreprocessing test suite 'spec' for integer-logarithms-1.0.4..
[2m[integer-logarithms] [mBuilding test suite 'spec' for integer-logarithms-1.0.4..
[2m[integer-logarithms] [m[1 of 4] Compiling Math.NumberTheory.TestUtils ( test-suite/Math/NumberTheory/TestUtils.hs, dist/build/spec/spec-tmp/Math/NumberTheory/TestUtils.o )
[2m[integer-logarithms] [m[2 of 4] Compiling Orphans          ( test-suite/Orphans.hs, dist/build/spec/spec-tmp/Orphans.o )
[2m[integer-logarithms] [m[3 of 4] Compiling Math.NumberTheory.LogarithmsTests ( test-suite/Math/NumberTheory/LogarithmsTests.hs, dist/build/spec/spec-tmp/Math/NumberTheory/LogarithmsTests.o )
[2m[integer-logarithms] [m[4 of 4] Compiling Main             ( test-suite/Test.hs, dist/build/spec/spec-tmp/Main.o )
[2m[hedgehog] [m[1;36mPhase: fixupPhase[m
[2m[hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
[2m[hedgehog] [mshrinking /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHShedgehog-1.5-1B99eT9THHr5ZSpEl39tYK-ghc9.8.1.so
[2m[hedgehog] [mchecking for references to /build/ in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5...
[2m[hedgehog] [mpatching script interpreter paths in /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5
[2m[hedgehog] [mstripping (with command strip and flags -S -p) in  /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/lib
[2m[integer-logarithms] [m[5 of 5] Linking dist/build/spec/spec
[2m[hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc
[2m[hedgehog] [mchecking for references to /build/ in /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc...
[2m[hedgehog] [mpatching script interpreter paths in /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc
[2m[hedgehog:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5[m
[2m[hedgehog:post-build] [m[2mPushing 2 paths (128 are already present) using zstd to cache sellout ⏳[m
[2m[hedgehog:post-build] [m[2m[m
[2m[hedgehog:post-build] [m[2mPushing /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc (18.24 MiB)[m
[2m[hedgehog:post-build] [m[2mPushing /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5 (23.40 MiB)[m
[2m[hedgehog:post-build] [m[2m[m
[2m[hedgehog:post-build] [m[2mAll done.[m
[2m[hedgehog:post-build] [m[2mUploading to the NixCI cache: /nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc /nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5[m
[2m[hedgehog:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hedgehog:post-build] [m[2mcopying 2 paths...[m
[2m[hedgehog:post-build] [m[2mcopying path '/nix/store/spmmi4a4h9flcfqamj4i7bzf2j2yp452-hedgehog-1.5-doc' to 'https://cache.nix-ci.com'...[m
[2m[hedgehog:post-build] [m[2mcopying path '/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5' to 'https://cache.nix-ci.com'...[m
[2m[hedgehog:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[hedgehog:post-build] [m[2mcopying 1 paths...[m
[2m[hedgehog:post-build] [m[2mcopying path '/nix/store/5458kfdgkysbzx3n0ag8abp4zhiihjw2-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 32 of 47 built (1 building)[m
[1;34mBuilding /nix/store/349qlybgg6fyg3x7dx68044ggfs7wkyj-duoids-hedgehog-0.0.1.0.drv[m
[1;34mBuilding /nix/store/jds9nixsl9b83kdbkg1qm2ab0zxcij8p-tasty-hedgehog-1.4.0.2.drv[m
[2m[integer-logarithms] [m[1;36mPhase: checkPhase[m
[2m[integer-logarithms] [mRunning 1 test suites...
[2m[integer-logarithms] [mTest suite spec: RUNNING...
[2m[integer-logarithms] [mAll
[2m[integer-logarithms] [m  Logarithms
[2m[integer-logarithms] [m    integerLogBase
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        25 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLog2
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLog2Huge
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLog10
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    naturalLogBase
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        25 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    naturalLog2
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    naturalLog2Huge
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    naturalLog10
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    intLog2
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    wordLog2
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLogBase'
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        25 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLogBase' with base > 32 and n >= base ^ 2
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        25 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLog2'
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    integerLog10'
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    intLog2'
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m    wordLog2'
[2m[integer-logarithms] [m      smallcheck: OK
[2m[integer-logarithms] [m        5 tests completed
[2m[integer-logarithms] [m      quickcheck: OK
[2m[integer-logarithms] [m        +++ OK, passed 100 tests.
[2m[integer-logarithms] [m
[2m[integer-logarithms] [mAll 32 tests passed (0.01s)
[2m[integer-logarithms] [mTest suite spec: PASS
[2m[integer-logarithms] [mTest suite logged to: dist/test/integer-logarithms-1.0.4-spec.log
[2m[integer-logarithms] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[integer-logarithms] [m[1;36mPhase: haddockPhase[m
[2m[integer-logarithms] [mPreprocessing library for integer-logarithms-1.0.4..
[2m[integer-logarithms] [mRunning Haddock on library for integer-logarithms-1.0.4..
[2m[integer-logarithms] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[integer-logarithms] [m[1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, nothing )
[2m[integer-logarithms] [m[2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, nothing )
[2m[integer-logarithms] [m[3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, nothing )
[2m[integer-logarithms] [m[4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, nothing )
[2m[integer-logarithms] [mHaddock coverage:
[2m[integer-logarithms] [m  40% (  2 /  5) in 'GHC.Integer.Logarithms.Compat'
[2m[integer-logarithms] [m  Missing documentation for:
[2m[integer-logarithms] [m    integerLogBase#
[2m[integer-logarithms] [m    integerLog2#
[2m[integer-logarithms] [m    wordLog2#
[2m[integer-logarithms] [mWarning: 'naturalLog2' is ambiguous. It is defined
[2m[integer-logarithms] [m    * in ‘GHC.Num.Natural’
[2m[integer-logarithms] [m    * at src/Math/NumberTheory/Logarithms.hs:109:1
[2m[integer-logarithms] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[integer-logarithms] [m    by specifying the type/value namespace explicitly.
[2m[integer-logarithms] [m    Defaulting to the one defined at src/Math/NumberTheory/Logarithms.hs:109:1
[2m[integer-logarithms] [mWarning: 'naturalLogBase' is ambiguous. It is defined
[2m[integer-logarithms] [m    * in ‘GHC.Num.Natural’
[2m[integer-logarithms] [m    * at src/Math/NumberTheory/Logarithms.hs:99:1
[2m[integer-logarithms] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[integer-logarithms] [m    by specifying the type/value namespace explicitly.
[2m[integer-logarithms] [m    Defaulting to the one defined at src/Math/NumberTheory/Logarithms.hs:99:1
[2m[integer-logarithms] [m 100% ( 17 / 17) in 'Math.NumberTheory.Logarithms'
[2m[integer-logarithms] [m 100% (  3 /  3) in 'Math.NumberTheory.Powers.Integer'
[2m[integer-logarithms] [m 100% (  3 /  3) in 'Math.NumberTheory.Powers.Natural'
[2m[integer-logarithms] [mDocumentation created: dist/doc/html/integer-logarithms/,
[2m[integer-logarithms] [mdist/doc/html/integer-logarithms/integer-logarithms.txt
[2m[integer-logarithms] [mPreprocessing test suite 'spec' for integer-logarithms-1.0.4..
[2m[integer-logarithms] [m[1;36mPhase: installPhase[m
[2m[integer-logarithms] [mInstalling library in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[integer-logarithms] [m[1;36mPhase: fixupPhase[m
[2m[integer-logarithms] [mshrinking RPATHs of ELF executables and libraries in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
[2m[integer-logarithms] [mshrinking /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSinteger-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH-ghc9.8.1.so
[2m[integer-logarithms] [mchecking for references to /build/ in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4...
[2m[integer-logarithms] [mpatching script interpreter paths in /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4
[2m[integer-logarithms] [mstripping (with command strip and flags -S -p) in  /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4/lib
[2m[integer-logarithms] [mshrinking RPATHs of ELF executables and libraries in /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc
[2m[integer-logarithms] [mchecking for references to /build/ in /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc...
[2m[integer-logarithms] [mpatching script interpreter paths in /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc
[2m[integer-logarithms:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4[m
[2m[integer-logarithms:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[integer-logarithms:post-build] [m[2m[m
[2m[integer-logarithms:post-build] [m[2mPushing /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc (354.77 KiB)[m
[2m[integer-logarithms:post-build] [m[2mPushing /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4 (900.41 KiB)[m
[2m[integer-logarithms:post-build] [m[2m[m
[2m[integer-logarithms:post-build] [m[2mAll done.[m
[2m[integer-logarithms:post-build] [m[2mUploading to the NixCI cache: /nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc /nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4[m
[2m[integer-logarithms:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[integer-logarithms:post-build] [m[2mcopying 2 paths...[m
[2m[integer-logarithms:post-build] [m[2mcopying path '/nix/store/3zx62ypi3w6767f6z992y732s7hrqixq-integer-logarithms-1.0.4-doc' to 'https://cache.nix-ci.com'...[m
[2m[integer-logarithms:post-build] [m[2mcopying path '/nix/store/6dnl3phgjn958fal81alqwlq3hnkvs2f-integer-logarithms-1.0.4' to 'https://cache.nix-ci.com'...[m
[2m[integer-logarithms:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[integer-logarithms:post-build] [m[2mcopying 1 paths...[m
[2m[integer-logarithms:post-build] [m[2mcopying path '/nix/store/w3k022qgh9jnjzrax7zxd61gdyj6c7sc-integer-logarithms-1.0.4.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 33 of 47 built (2 building)[m
[1;34mBuilding /nix/store/kmwyd33dsb5b986dg2s1ywr8cchd9p33-scientific-0.3.8.0.drv[m
[2m[duoids-hedgehog] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[duoids-hedgehog] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[duoids-hedgehog] [m[1;36mPhase: unpackPhase[m
[2m[duoids-hedgehog] [munpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./hedgehog
[2m[duoids-hedgehog] [msource root is hedgehog
[2m[duoids-hedgehog] [m[1;36mPhase: patchPhase[m
[2m[duoids-hedgehog] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[duoids-hedgehog] [msetupCompileFlags: -package-db=/build/tmp.741IFhG65Z/setup-package.conf.d -threaded
[2m[duoids-hedgehog] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.741IFhG65Z/Main.o )
[2m[duoids-hedgehog] [m[2 of 2] Linking Setup
[2m[duoids-hedgehog] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[duoids-hedgehog] [m[1;36mPhase: configurePhase[m
[2m[duoids-hedgehog] [mconfigureFlags: --verbose --prefix=/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.741IFhG65Z/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 --ghc-options=-Werror --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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
[2m[duoids-hedgehog] [mUsing Parsec parser
[2m[duoids-hedgehog] [mConfiguring duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mFlags chosen: noisy-deprecations=True, verify-no-recursion=False
[2m[duoids-hedgehog] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoids-hedgehog] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoids-hedgehog] [mDependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
[2m[duoids-hedgehog] [mDependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
[2m[duoids-hedgehog] [mhedgehog-1.5
[2m[duoids-hedgehog] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoids-hedgehog] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoids-hedgehog] [mDependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mDependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
[2m[duoids-hedgehog] [mhedgehog-1.5
[2m[duoids-hedgehog] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[duoids-hedgehog] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[duoids-hedgehog] [mDependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
[2m[duoids-hedgehog] [m<0.25: using doctest-0.22.6
[2m[duoids-hedgehog] [mDependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mSource component graph:
[2m[duoids-hedgehog] [m    component lib
[2m[duoids-hedgehog] [m    component test:doctests dependency lib
[2m[duoids-hedgehog] [m    component test:laws dependency lib
[2m[duoids-hedgehog] [mConfigured component graph:
[2m[duoids-hedgehog] [m    component duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m        include base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids-hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[duoids-hedgehog] [m    component duoids-hedgehog-0.0.1.0-GPzU4X6nvkV28mgPo0dGEE-doctests
[2m[duoids-hedgehog] [m        include base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m    component duoids-hedgehog-0.0.1.0-EOfMK9uP5vVLJ7PYKxu4gL-laws
[2m[duoids-hedgehog] [m        include base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[duoids-hedgehog] [mLinked component graph:
[2m[duoids-hedgehog] [m    unit duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m        include base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[tasty-hedgehog] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[tasty-hedgehog] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[tasty-hedgehog] [m[1;36mPhase: unpackPhase[m
[2m[tasty-hedgehog] [munpacking source archive /nix/store/c7lip15ss1zm2zsp6i971ky2zjla3sm3-tasty-hedgehog-1.4.0.2.tar.gz
[2m[tasty-hedgehog] [msource root is tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "tasty-hedgehog-1.4.0.2/test/Main.hs"
[2m[tasty-hedgehog] [m[1;36mPhase: patchPhase[m
[2m[tasty-hedgehog] [mReplace Cabal file with edited version from mirror://hackage/tasty-hedgehog-1.4.0.2/revision/6.cabal.
[2m[tasty-hedgehog] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[tasty-hedgehog] [msetupCompileFlags: -package-db=/build/tmp.ERLpd1DNaP/setup-package.conf.d -threaded
[2m[tasty-hedgehog] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.ERLpd1DNaP/Main.o )
[2m[tasty-hedgehog] [m[2 of 2] Linking Setup
[2m[tasty-hedgehog] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[tasty-hedgehog] [m[1;36mPhase: configurePhase[m
[2m[tasty-hedgehog] [mconfigureFlags: --verbose --prefix=/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc/share/doc/tasty-hedgehog-1.4.0.2 --with-gcc=gcc --package-db=/build/tmp.ERLpd1DNaP/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[tasty-hedgehog] [mUsing Parsec parser
[2m[tasty-hedgehog] [mConfiguring tasty-hedgehog-1.4.0.2...
[2m[tasty-hedgehog] [mDependency base >=4.8 && <4.22: using base-4.19.0.0
[2m[tasty-hedgehog] [mDependency hedgehog >=1.4 && <1.6: using hedgehog-1.5
[2m[tasty-hedgehog] [mDependency tagged >=0.8 && <0.9: using tagged-0.8.8
[2m[tasty-hedgehog] [mDependency tasty >=0.11 && <1.6: using tasty-1.5.3
[2m[tasty-hedgehog] [mSource component graph: component lib
[2m[tasty-hedgehog] [mConfigured component graph:
[2m[tasty-hedgehog] [m    component tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[tasty-hedgehog] [m        include base-4.19.0.0-b960
[2m[tasty-hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[tasty-hedgehog] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-hedgehog] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-hedgehog] [mLinked component graph:
[2m[tasty-hedgehog] [m    unit tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[tasty-hedgehog] [m        include base-4.19.0.0-b960
[2m[tasty-hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[tasty-hedgehog] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-hedgehog] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-hedgehog] [m        Test.Tasty.Hedgehog=tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t:Test.Tasty.Hedgehog
[2m[tasty-hedgehog] [mReady component graph:
[2m[tasty-hedgehog] [m    definite tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[tasty-hedgehog] [m        depends base-4.19.0.0-b960
[2m[tasty-hedgehog] [m        depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[tasty-hedgehog] [m        depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[tasty-hedgehog] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[tasty-hedgehog] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[tasty-hedgehog] [mUsing compiler: ghc-9.8.1
[2m[tasty-hedgehog] [mUsing install prefix:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [mExecutables installed in:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/bin
[2m[tasty-hedgehog] [mLibraries installed in:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[tasty-hedgehog] [mDynamic Libraries installed in:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[duoids-hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[duoids-hedgehog] [m        Test.Duoid=duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR:Test.Duoidal
[2m[duoids-hedgehog] [m    unit duoids-hedgehog-0.0.1.0-GPzU4X6nvkV28mgPo0dGEE-doctests
[2m[duoids-hedgehog] [m        include base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m    unit duoids-hedgehog-0.0.1.0-EOfMK9uP5vVLJ7PYKxu4gL-laws
[2m[duoids-hedgehog] [m        include base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[duoids-hedgehog] [mReady component graph:
[2m[duoids-hedgehog] [m    definite duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m        depends base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[duoids-hedgehog] [m        depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[duoids-hedgehog] [m    definite duoids-hedgehog-0.0.1.0-EOfMK9uP5vVLJ7PYKxu4gL-laws
[2m[duoids-hedgehog] [m        depends base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [m        depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[duoids-hedgehog] [m    definite duoids-hedgehog-0.0.1.0-GPzU4X6nvkV28mgPo0dGEE-doctests
[2m[duoids-hedgehog] [m        depends base-4.19.0.0-b960
[2m[duoids-hedgehog] [m        depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[duoids-hedgehog] [m        depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [mUsing Cabal-3.12.1.0 compiled by ghc-9.8
[2m[duoids-hedgehog] [mUsing compiler: ghc-9.8.1
[2m[duoids-hedgehog] [mUsing install prefix:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mExecutables installed in:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/bin
[2m[duoids-hedgehog] [mLibraries installed in:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[duoids-hedgehog] [mDynamic Libraries installed in:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
[2m[duoids-hedgehog] [mPrivate executables installed in:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mData files installed in:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mDocumentation installed in:
[2m[duoids-hedgehog] [m/nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mConfiguration files installed in:
[2m[duoids-hedgehog] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/etc
[2m[duoids-hedgehog] [mNo alex found
[2m[duoids-hedgehog] [mUsing ar found on system at:
[2m[duoids-hedgehog] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[duoids-hedgehog] [mNo c2hs found
[2m[duoids-hedgehog] [mNo cpphs found
[2m[duoids-hedgehog] [mUsing doctest version 0.22.6 found on system at:
[2m[duoids-hedgehog] [m/nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
[2m[duoids-hedgehog] [mUsing gcc version 14.3.0 given by user at:
[2m[duoids-hedgehog] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[duoids-hedgehog] [mUsing ghc version 9.8.1 found on system at:
[2m[duoids-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[duoids-hedgehog] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[duoids-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[duoids-hedgehog] [mNo ghcjs found
[2m[duoids-hedgehog] [mNo ghcjs-pkg found
[2m[duoids-hedgehog] [mNo greencard found
[2m[duoids-hedgehog] [mUsing haddock version 2.30.0 found on system at:
[2m[duoids-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[duoids-hedgehog] [mNo happy found
[2m[duoids-hedgehog] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[duoids-hedgehog] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[duoids-hedgehog] [mNo hmake found
[2m[duoids-hedgehog] [mUsing hpc version 0.69 found on system at:
[2m[duoids-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[duoids-hedgehog] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[duoids-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[duoids-hedgehog] [mUsing hscolour version 1.25 found on system at:
[2m[duoids-hedgehog] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[duoids-hedgehog] [mNo jhc found
[2m[duoids-hedgehog] [mUsing ld found on system at:
[2m[duoids-hedgehog] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[duoids-hedgehog] [mNo pkg-config found
[2m[duoids-hedgehog] [mUsing runghc version 9.8.1 found on system at:
[2m[duoids-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[duoids-hedgehog] [mUsing strip version 2.44 found on system at:
[2m[tasty-hedgehog] [mPrivate executables installed in:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/libexec/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [mData files installed in:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/share/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [mDocumentation installed in:
[2m[tasty-hedgehog] [m/nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc/share/doc/tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [mConfiguration files installed in:
[2m[tasty-hedgehog] [m/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/etc
[2m[tasty-hedgehog] [mNo alex found
[2m[tasty-hedgehog] [mUsing ar found on system at:
[2m[tasty-hedgehog] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[tasty-hedgehog] [mNo c2hs found
[2m[tasty-hedgehog] [mNo cpphs found
[2m[tasty-hedgehog] [mNo doctest found
[2m[tasty-hedgehog] [mUsing gcc version 14.3.0 given by user at:
[2m[tasty-hedgehog] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[tasty-hedgehog] [mUsing ghc version 9.8.1 found on system at:
[2m[tasty-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[tasty-hedgehog] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[tasty-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[tasty-hedgehog] [mNo ghcjs found
[2m[tasty-hedgehog] [mNo ghcjs-pkg found
[2m[tasty-hedgehog] [mNo greencard found
[2m[tasty-hedgehog] [mUsing haddock version 2.30.0 found on system at:
[2m[tasty-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[tasty-hedgehog] [mNo happy found
[2m[tasty-hedgehog] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[tasty-hedgehog] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[tasty-hedgehog] [mNo hmake found
[2m[tasty-hedgehog] [mUsing hpc version 0.69 found on system at:
[2m[tasty-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[tasty-hedgehog] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[tasty-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[tasty-hedgehog] [mUsing hscolour version 1.25 found on system at:
[2m[tasty-hedgehog] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[tasty-hedgehog] [mNo jhc found
[2m[tasty-hedgehog] [mUsing ld found on system at:
[2m[tasty-hedgehog] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[tasty-hedgehog] [mNo pkg-config found
[2m[tasty-hedgehog] [mUsing runghc version 9.8.1 found on system at:
[2m[tasty-hedgehog] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[tasty-hedgehog] [mUsing strip version 2.44 found on system at:
[2m[tasty-hedgehog] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[tasty-hedgehog] [mUsing tar found on system at:
[2m[tasty-hedgehog] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[tasty-hedgehog] [mNo uhc found
[2m[tasty-hedgehog] [m[1;36mPhase: buildPhase[m
[2m[tasty-hedgehog] [mPreprocessing library for tasty-hedgehog-1.4.0.2..
[2m[tasty-hedgehog] [mBuilding library for tasty-hedgehog-1.4.0.2..
[2m[tasty-hedgehog] [m[1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, dist/build/Test/Tasty/Hedgehog.o, dist/build/Test/Tasty/Hedgehog.dyn_o )
[2m[tasty-hedgehog] [m[1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, dist/build/Test/Tasty/Hedgehog.p_o )
[2m[duoids-hedgehog] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[duoids-hedgehog] [mUsing tar found on system at:
[2m[duoids-hedgehog] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[duoids-hedgehog] [mNo uhc found
[2m[duoids-hedgehog] [m[1;36mPhase: buildPhase[m
[2m[duoids-hedgehog] [mPreprocessing library for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mBuilding library for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [m[1 of 2] Compiling Test.Duoid       ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
[2m[duoids-hedgehog] [m[2 of 2] Compiling Test.Duoidal     ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
[2m[duoids-hedgehog] [m[1 of 2] Compiling Test.Duoid       ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
[2m[duoids-hedgehog] [m[2 of 2] Compiling Test.Duoidal     ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
[2m[scientific] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[scientific] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[scientific] [m[1;36mPhase: unpackPhase[m
[2m[scientific] [munpacking source archive /nix/store/8wdrn8qwx87rmmykvk7is30zx4xswld9-scientific-0.3.8.0.tar.gz
[2m[scientific] [msource root is scientific-0.3.8.0
[2m[scientific] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "scientific-0.3.8.0/test/test.hs"
[2m[scientific] [m[1;36mPhase: patchPhase[m
[2m[scientific] [mReplace Cabal file with edited version from mirror://hackage/scientific-0.3.8.0/revision/2.cabal.
[2m[scientific] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[scientific] [msetupCompileFlags: -package-db=/build/tmp.14sAC0e5oJ/setup-package.conf.d -threaded
[2m[scientific] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.14sAC0e5oJ/Main.o )
[2m[scientific] [m[2 of 2] Linking Setup
[2m[duoids-hedgehog] [mPreprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mBuilding test suite 'laws' for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [m[1 of 1] Compiling Main             ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
[2m[tasty-hedgehog] [m[1;36mPhase: haddockPhase[m
[2m[duoids-hedgehog] [m[2 of 2] Linking dist/build/laws/laws
[2m[scientific] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[scientific] [m[1;36mPhase: configurePhase[m
[2m[scientific] [mconfigureFlags: --verbose --prefix=/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc/share/doc/scientific-0.3.8.0 --with-gcc=gcc --package-db=/build/tmp.14sAC0e5oJ/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[scientific] [mUsing Parsec parser
[2m[scientific] [mConfiguring scientific-0.3.8.0...
[2m[tasty-hedgehog] [mPreprocessing library for tasty-hedgehog-1.4.0.2..
[2m[tasty-hedgehog] [mRunning Haddock on library for tasty-hedgehog-1.4.0.2..
[2m[tasty-hedgehog] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[tasty-hedgehog] [m[1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, nothing )
[2m[scientific] [mFlags chosen: integer-simple=False
[2m[scientific] [mDependency base >=4.15 && <4.22: using base-4.19.0.0
[2m[scientific] [mDependency binary >=0.8.6.0 && <0.9: using binary-0.8.9.1
[2m[scientific] [mDependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
[2m[scientific] [mDependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
[2m[scientific] [mDependency deepseq >=1.4.4.0 && <1.6: using deepseq-1.5.0.0
[2m[scientific] [mDependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
[2m[scientific] [mDependency integer-logarithms >=1.0.3.1 && <1.1: using
[2m[scientific] [minteger-logarithms-1.0.4
[2m[scientific] [mDependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
[2m[scientific] [mDependency template-haskell >=2.14.0.0 && <2.24: using
[2m[scientific] [mtemplate-haskell-2.21.0.0
[2m[scientific] [mDependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
[2m[scientific] [mDependency QuickCheck >=2.14.2: using QuickCheck-2.14.3
[2m[scientific] [mDependency base: using base-4.19.0.0
[2m[scientific] [mDependency binary: using binary-0.8.9.1
[2m[scientific] [mDependency bytestring: using bytestring-0.12.0.2
[2m[scientific] [mDependency scientific: using scientific-0.3.8.0
[2m[scientific] [mDependency smallcheck >=1.0: using smallcheck-1.2.1.1
[2m[scientific] [mDependency tasty >=1.4.0.1: using tasty-1.5.3
[2m[scientific] [mDependency tasty-hunit >=0.8: using tasty-hunit-0.10.2
[2m[scientific] [mDependency tasty-quickcheck >=0.8: using tasty-quickcheck-0.11
[2m[scientific] [mDependency tasty-smallcheck >=0.2: using tasty-smallcheck-0.8.2
[2m[scientific] [mDependency text: using text-2.1
[2m[tasty-hedgehog] [mHaddock coverage:
[2m[tasty-hedgehog] [mWarning: 'Property' is ambiguous. It is defined
[2m[tasty-hedgehog] [m    * in ‘Hedgehog.Internal.Property’
[2m[tasty-hedgehog] [m    * in ‘Hedgehog.Internal.Property’
[2m[tasty-hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[tasty-hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[tasty-hedgehog] [m    Defaulting to the one defined in ‘Hedgehog.Internal.Property’
[2m[tasty-hedgehog] [mWarning: 'Group' is ambiguous. It is defined
[2m[tasty-hedgehog] [m    * in ‘Hedgehog.Internal.Property’
[2m[tasty-hedgehog] [m    * in ‘Hedgehog.Internal.Property’
[2m[tasty-hedgehog] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[tasty-hedgehog] [m    by specifying the type/value namespace explicitly.
[2m[tasty-hedgehog] [m    Defaulting to the one defined in ‘Hedgehog.Internal.Property’
[2m[tasty-hedgehog] [m 100% ( 11 / 11) in 'Test.Tasty.Hedgehog'
[2m[scientific] [mSource component graph:
[2m[scientific] [m    component lib
[2m[scientific] [m    component test:test-scientific dependency lib
[2m[scientific] [mConfigured component graph:
[2m[scientific] [m    component scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [m        include base-4.19.0.0-b960
[2m[scientific] [m        include binary-0.8.9.1-0e3e
[2m[scientific] [m        include bytestring-0.12.0.2-4690
[2m[scientific] [m        include containers-0.6.8-4775
[2m[scientific] [m        include deepseq-1.5.0.0-412f
[2m[scientific] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[scientific] [m        include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[scientific] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[scientific] [m        include template-haskell-2.21.0.0-8831
[2m[scientific] [m        include text-2.1-c36a
[2m[scientific] [m    component scientific-0.3.8.0-ERgFuAaF9w6JlyRZv4Gsn-test-scientific
[2m[scientific] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[scientific] [m        include base-4.19.0.0-b960
[2m[scientific] [m        include binary-0.8.9.1-0e3e
[2m[scientific] [m        include bytestring-0.12.0.2-4690
[2m[scientific] [m        include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [m        include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[scientific] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[scientific] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[scientific] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[scientific] [m        include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[scientific] [m        include text-2.1-c36a
[2m[scientific] [mLinked component graph:
[2m[scientific] [m    unit scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [m        include base-4.19.0.0-b960
[2m[scientific] [m        include binary-0.8.9.1-0e3e
[2m[scientific] [m        include bytestring-0.12.0.2-4690
[2m[scientific] [m        include containers-0.6.8-4775
[2m[scientific] [m        include deepseq-1.5.0.0-412f
[2m[scientific] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[scientific] [m        include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[scientific] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[scientific] [m        include template-haskell-2.21.0.0-8831
[2m[scientific] [m        include text-2.1-c36a
[2m[scientific] [m        Data.ByteString.Builder.Scientific=scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X:Data.ByteString.Builder.Scientific,Data.Scientific=scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X:Data.Scientific,Data.Text.Lazy.Builder.Scientific=scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X:Data.Text.Lazy.Builder.Scientific
[2m[scientific] [m    unit scientific-0.3.8.0-ERgFuAaF9w6JlyRZv4Gsn-test-scientific
[2m[scientific] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[scientific] [m        include base-4.19.0.0-b960
[2m[scientific] [m        include binary-0.8.9.1-0e3e
[2m[scientific] [m        include bytestring-0.12.0.2-4690
[2m[scientific] [m        include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [m        include smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[scientific] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[scientific] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[scientific] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[scientific] [m        include tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[scientific] [m        include text-2.1-c36a
[2m[scientific] [mReady component graph:
[2m[scientific] [m    definite scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [m        depends base-4.19.0.0-b960
[2m[scientific] [m        depends binary-0.8.9.1-0e3e
[2m[scientific] [m        depends bytestring-0.12.0.2-4690
[2m[scientific] [m        depends containers-0.6.8-4775
[2m[scientific] [m        depends deepseq-1.5.0.0-412f
[2m[scientific] [m        depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[scientific] [m        depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[scientific] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[scientific] [m        depends template-haskell-2.21.0.0-8831
[2m[scientific] [m        depends text-2.1-c36a
[2m[scientific] [m    definite scientific-0.3.8.0-ERgFuAaF9w6JlyRZv4Gsn-test-scientific
[2m[scientific] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[scientific] [m        depends base-4.19.0.0-b960
[2m[scientific] [m        depends binary-0.8.9.1-0e3e
[2m[scientific] [m        depends bytestring-0.12.0.2-4690
[2m[scientific] [m        depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [m        depends smallcheck-1.2.1.1-D4zzkFSCaYTCul1pEwUrHk
[2m[scientific] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[scientific] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[scientific] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[scientific] [m        depends tasty-smallcheck-0.8.2-7gCOOXxINRX9o3u5Fi2GEU
[2m[scientific] [m        depends text-2.1-c36a
[2m[scientific] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[scientific] [mUsing compiler: ghc-9.8.1
[2m[scientific] [mUsing install prefix:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
[2m[scientific] [mExecutables installed in:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/bin
[2m[scientific] [mLibraries installed in:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[scientific] [mDynamic Libraries installed in:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[scientific] [mPrivate executables installed in:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/libexec/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0
[2m[scientific] [mData files installed in:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/share/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0
[2m[scientific] [mDocumentation installed in:
[2m[scientific] [m/nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc/share/doc/scientific-0.3.8.0
[2m[scientific] [mConfiguration files installed in:
[2m[scientific] [m/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/etc
[2m[scientific] [mNo alex found
[2m[scientific] [mUsing ar found on system at:
[2m[scientific] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[scientific] [mNo c2hs found
[2m[scientific] [mNo cpphs found
[2m[scientific] [mNo doctest found
[2m[scientific] [mUsing gcc version 14.3.0 given by user at:
[2m[scientific] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[scientific] [mUsing ghc version 9.8.1 found on system at:
[2m[scientific] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[scientific] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[scientific] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[scientific] [mNo ghcjs found
[2m[scientific] [mNo ghcjs-pkg found
[2m[scientific] [mNo greencard found
[2m[scientific] [mUsing haddock version 2.30.0 found on system at:
[2m[scientific] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[scientific] [mNo happy found
[2m[scientific] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[scientific] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[scientific] [mNo hmake found
[2m[scientific] [mUsing hpc version 0.69 found on system at:
[2m[scientific] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[scientific] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[scientific] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[scientific] [mUsing hscolour version 1.25 found on system at:
[2m[scientific] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[scientific] [mNo jhc found
[2m[scientific] [mUsing ld found on system at:
[2m[scientific] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[scientific] [mNo pkg-config found
[2m[scientific] [mUsing runghc version 9.8.1 found on system at:
[2m[scientific] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[scientific] [mUsing strip version 2.44 found on system at:
[2m[scientific] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[scientific] [mUsing tar found on system at:
[2m[scientific] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[scientific] [mNo uhc found
[2m[duoids-hedgehog] [mPreprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mBuilding test suite 'doctests' for duoids-hedgehog-0.0.1.0...
[2m[scientific] [m[1;36mPhase: buildPhase[m
[2m[scientific] [mPreprocessing library for scientific-0.3.8.0..
[2m[scientific] [mBuilding library for scientific-0.3.8.0..
[2m[duoids-hedgehog] [m[1 of 2] Compiling Build_doctests   ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
[2m[scientific] [m[1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, dist/build/GHC/Integer/Compat.o, dist/build/GHC/Integer/Compat.dyn_o )
[2m[scientific] [m[2 of 5] Compiling Utils            ( src/Utils.hs, dist/build/Utils.o, dist/build/Utils.dyn_o )
[2m[duoids-hedgehog] [m[2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
[2m[scientific] [m[3 of 5] Compiling Data.Scientific  ( src/Data/Scientific.hs, dist/build/Data/Scientific.o, dist/build/Data/Scientific.dyn_o )
[2m[duoids-hedgehog] [m[3 of 3] Linking dist/build/doctests/doctests
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Scientific.hs:1041:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding:
[2m[scientific] [m        Patterns of type ‘[Char]’ not matched:
[2m[scientific] [m            []
[2m[scientific] [m            []
[2m[scientific] [m            [][0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m
[2m[scientific] [m[;1m[34m1041 |[0m[0m                [;1m[35m(d:ds') = map intToDigit (if ei > 0 then init is' else is')[0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m[;1m[35m                ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Scientific.hs:1057:11: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding: Patterns of type ‘[Char]’ not matched: [][0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m
[2m[scientific] [m[;1m[34m1057 |[0m[0m           [;1m[35md:ds' = map intToDigit (if ei > 0 then is' else 0:is')[0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m[;1m[35m           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m[4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.o, dist/build/Data/Text/Lazy/Builder/Scientific.dyn_o )
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:19:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    The import of ‘Data.Monoid’ is redundant
[2m[scientific] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[scientific] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m19 |[0m[0m [;1m[35mimport Data.Monoid                  ((<>))[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:60:12: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding:
[2m[scientific] [m        Patterns of type ‘[Char]’ not matched:
[2m[scientific] [m            []
[2m[scientific] [m            []
[2m[scientific] [m            [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m60 |[0m[0m            [;1m[35m(d:ds') = map i2d (if ei > 0 then init is' else is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:88:11: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding: Patterns of type ‘[Char]’ not matched: [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m88 |[0m[0m           [;1m[35md:ds' = map i2d (if ei > 0 then is' else 0:is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m[5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.o, dist/build/Data/ByteString/Builder/Scientific.dyn_o )
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:20:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    The import of ‘Data.Monoid’ is redundant
[2m[scientific] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[scientific] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m20 |[0m[0m [;1m[35mimport Data.Monoid                  ((<>))[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:64:12: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding:
[2m[scientific] [m        Patterns of type ‘[Char]’ not matched:
[2m[scientific] [m            []
[2m[scientific] [m            []
[2m[scientific] [m            [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m64 |[0m[0m            [;1m[35m(d:ds') = map i2d (if ei > 0 then init is' else is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:94:11: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding: Patterns of type ‘[Char]’ not matched: [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m94 |[0m[0m           [;1m[35md:ds' = map i2d (if ei > 0 then is' else 0:is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[tasty-hedgehog] [mDocumentation created: dist/doc/html/tasty-hedgehog/,
[2m[tasty-hedgehog] [mdist/doc/html/tasty-hedgehog/tasty-hedgehog.txt
[2m[tasty-hedgehog] [m[1;36mPhase: installPhase[m
[2m[tasty-hedgehog] [mInstalling library in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[scientific] [m[1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, dist/build/GHC/Integer/Compat.p_o )
[2m[scientific] [m[2 of 5] Compiling Utils            ( src/Utils.hs, dist/build/Utils.p_o )
[2m[tasty-hedgehog] [m[1;36mPhase: fixupPhase[m
[2m[tasty-hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [mshrinking /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHStasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t-ghc9.8.1.so
[2m[tasty-hedgehog] [mchecking for references to /build/ in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2...
[2m[tasty-hedgehog] [mpatching script interpreter paths in /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2
[2m[tasty-hedgehog] [mstripping (with command strip and flags -S -p) in  /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2/lib
[2m[scientific] [m[3 of 5] Compiling Data.Scientific  ( src/Data/Scientific.hs, dist/build/Data/Scientific.p_o )
[2m[tasty-hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc
[2m[tasty-hedgehog] [mchecking for references to /build/ in /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc...
[2m[tasty-hedgehog] [mpatching script interpreter paths in /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc
[2m[tasty-hedgehog:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2[m
[2m[tasty-hedgehog:post-build] [m[2mPushing 2 paths (138 are already present) using zstd to cache sellout ⏳[m
[2m[tasty-hedgehog:post-build] [m[2m[m
[2m[tasty-hedgehog:post-build] [m[2mPushing /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2 (926.47 KiB)[m
[2m[tasty-hedgehog:post-build] [m[2mPushing /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc (348.98 KiB)[m
[2m[tasty-hedgehog:post-build] [m[2m[m
[2m[tasty-hedgehog:post-build] [m[2mAll done.[m
[2m[tasty-hedgehog:post-build] [m[2mUploading to the NixCI cache: /nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc /nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2[m
[2m[tasty-hedgehog:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[tasty-hedgehog:post-build] [m[2mcopying 2 paths...[m
[2m[tasty-hedgehog:post-build] [m[2mcopying path '/nix/store/dxhxlznlvskd1n078axkb6dsynlglmyb-tasty-hedgehog-1.4.0.2-doc' to 'https://cache.nix-ci.com'...[m
[2m[tasty-hedgehog:post-build] [m[2mcopying path '/nix/store/w733byrw5gl74405y3xqq3khbnfn026a-tasty-hedgehog-1.4.0.2' to 'https://cache.nix-ci.com'...[m
[2m[tasty-hedgehog:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[tasty-hedgehog:post-build] [m[2mcopying 1 paths...[m
[2m[tasty-hedgehog:post-build] [m[2mcopying path '/nix/store/jds9nixsl9b83kdbkg1qm2ab0zxcij8p-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 34 of 47 built (2 building)[m
[1;34mBuilding /nix/store/w1l3ywx2hi2wfc49gx8mlzxfb6sxzkmw-nothunks-0.3.0.0.drv[m
[2m[duoids-hedgehog] [m[1;36mPhase: checkPhase[m
[2m[duoids-hedgehog] [mRunning 2 test suites...
[2m[duoids-hedgehog] [mTest suite laws: RUNNING...
[2m[duoids-hedgehog] [m━━━ Duoid Int ━━━
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 4 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid Int16 ━━━
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 4 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid Int32 ━━━
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 4 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid Int64 ━━━
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 4 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid Int8 ━━━
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 4 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal Natural ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal (Ratio Natural) ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid (Ratio Integer) ━━━
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 4 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal Word ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal Word16 ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal Word32 ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal Word64 ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [m━━━ Duoid.Normal Word8 ━━━
[2m[duoids-hedgehog] [m  ✓ unswapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ interchange passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ splitUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ joinUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ swapUnit passed 100 tests.
[2m[duoids-hedgehog] [m  ✓ 5 succeeded.
[2m[duoids-hedgehog] [mTest suite laws: PASS
[2m[duoids-hedgehog] [mTest suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
[2m[duoids-hedgehog] [mTest suite doctests: RUNNING...
[2m[duoids-hedgehog] [mExamples: 0  Tried: 0  Errors: 0  Failures: 0
[2m[duoids-hedgehog] [mTest suite doctests: PASS
[2m[duoids-hedgehog] [mTest suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
[2m[duoids-hedgehog] [m2 of 2 test suites (2 of 2 test cases) passed.
[2m[duoids-hedgehog] [m[1;36mPhase: haddockPhase[m
[2m[duoids-hedgehog] [mPreprocessing library for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mRunning Haddock on library for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [m[1 of 2] Compiling Test.Duoid       ( src/Test/Duoid.hs, nothing )
[2m[duoids-hedgehog] [m[2 of 2] Compiling Test.Duoidal     ( src/Test/Duoidal.hs, nothing )
[2m[duoids-hedgehog] [mHaddock coverage:
[2m[duoids-hedgehog] [m  33% (  1 /  3) in 'Test.Duoid'
[2m[duoids-hedgehog] [m  Missing documentation for:
[2m[duoids-hedgehog] [m    validate (src/Test/Duoid.hs:72)
[2m[duoids-hedgehog] [m    validateNormal (src/Test/Duoid.hs:82)
[2m[duoids-hedgehog] [m  50% (  1 /  2) in 'Test.Duoidal'
[2m[duoids-hedgehog] [m  Missing documentation for:
[2m[duoids-hedgehog] [m    validate (src/Test/Duoidal.hs:98)
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Scientific.hs:1041:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding:
[2m[scientific] [m        Patterns of type ‘[Char]’ not matched:
[2m[scientific] [m            []
[2m[scientific] [m            []
[2m[scientific] [m            [][0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m
[2m[scientific] [m[;1m[34m1041 |[0m[0m                [;1m[35m(d:ds') = map intToDigit (if ei > 0 then init is' else is')[0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m[;1m[35m                ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Scientific.hs:1057:11: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding: Patterns of type ‘[Char]’ not matched: [][0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m
[2m[scientific] [m[;1m[34m1057 |[0m[0m           [;1m[35md:ds' = map intToDigit (if ei > 0 then is' else 0:is')[0m[0m
[2m[scientific] [m[;1m[34m     |[0m[0m[;1m[35m           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m[4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.p_o )
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:19:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    The import of ‘Data.Monoid’ is redundant
[2m[scientific] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[scientific] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m19 |[0m[0m [;1m[35mimport Data.Monoid                  ((<>))[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:60:12: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding:
[2m[scientific] [m        Patterns of type ‘[Char]’ not matched:
[2m[scientific] [m            []
[2m[scientific] [m            []
[2m[scientific] [m            [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m60 |[0m[0m            [;1m[35m(d:ds') = map i2d (if ei > 0 then init is' else is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:88:11: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding: Patterns of type ‘[Char]’ not matched: [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m88 |[0m[0m           [;1m[35md:ds' = map i2d (if ei > 0 then is' else 0:is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m[5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.p_o )
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:20:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    The import of ‘Data.Monoid’ is redundant
[2m[scientific] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[scientific] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m20 |[0m[0m [;1m[35mimport Data.Monoid                  ((<>))[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:64:12: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding:
[2m[scientific] [m        Patterns of type ‘[Char]’ not matched:
[2m[scientific] [m            []
[2m[scientific] [m            []
[2m[scientific] [m            [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m64 |[0m[0m            [;1m[35m(d:ds') = map i2d (if ei > 0 then init is' else is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:94:11: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-62161[0m[0m[;1m] [[;1m[35m-Wincomplete-uni-patterns[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    Pattern match(es) are non-exhaustive
[2m[scientific] [m    In a pattern binding: Patterns of type ‘[Char]’ not matched: [][0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m94 |[0m[0m           [;1m[35md:ds' = map i2d (if ei > 0 then is' else 0:is')[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [mPreprocessing test suite 'test-scientific' for scientific-0.3.8.0..
[2m[scientific] [mBuilding test suite 'test-scientific' for scientific-0.3.8.0..
[2m[scientific] [m[1 of 1] Compiling Main             ( test/test.hs, dist/build/test-scientific/test-scientific-tmp/Main.o )
[2m[duoids-hedgehog] [mDocumentation created: dist/doc/html/duoids-hedgehog/,
[2m[duoids-hedgehog] [mdist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
[2m[duoids-hedgehog] [mPreprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mPreprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
[2m[nothunks] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[nothunks] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[duoids-hedgehog] [m[1;36mPhase: installPhase[m
[2m[duoids-hedgehog] [mInstalling library in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[nothunks] [m[1;36mPhase: unpackPhase[m
[2m[nothunks] [munpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
[2m[nothunks] [msource root is nothunks-0.3.0.0
[2m[nothunks] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
[2m[nothunks] [m[1;36mPhase: patchPhase[m
[2m[duoids-hedgehog] [m[1;36mPhase: fixupPhase[m
[2m[nothunks] [mReplace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
[2m[nothunks] [mRun jailbreak-cabal to lift version restrictions on build inputs.
[2m[nothunks] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[nothunks] [msetupCompileFlags: -package-db=/build/tmp.hkxskjs4A9/setup-package.conf.d -threaded
[2m[duoids-hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mshrinking /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSduoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR-ghc9.8.1.so
[2m[duoids-hedgehog] [mchecking for references to /build/ in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0...
[2m[nothunks] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.hkxskjs4A9/Main.o )
[2m[duoids-hedgehog] [mpatching script interpreter paths in /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mstripping (with command strip and flags -S -p) in  /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/lib
[2m[nothunks] [m[2 of 2] Linking Setup
[2m[duoids-hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc
[2m[duoids-hedgehog] [mchecking for references to /build/ in /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc...
[2m[duoids-hedgehog] [mpatching script interpreter paths in /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc
[2m[duoids-hedgehog:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc[m
[2m[duoids-hedgehog:post-build] [m[2mPushing 2 paths (132 are already present) using zstd to cache sellout ⏳[m
[2m[duoids-hedgehog:post-build] [m[2m[m
[2m[duoids-hedgehog:post-build] [m[2mPushing /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc (297.07 KiB)[m
[2m[duoids-hedgehog:post-build] [m[2mPushing /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 (495.92 KiB)[m
[2m[duoids-hedgehog:post-build] [m[2m[m
[2m[duoids-hedgehog:post-build] [m[2mAll done.[m
[2m[duoids-hedgehog:post-build] [m[2mUploading to the NixCI cache: /nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0 /nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc[m
[2m[duoids-hedgehog:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[duoids-hedgehog:post-build] [m[2mcopying 2 paths...[m
[2m[duoids-hedgehog:post-build] [m[2mcopying path '/nix/store/vhhmijdk1l96rpglrfjrk0mqp796y7yh-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[duoids-hedgehog:post-build] [m[2mcopying path '/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[duoids-hedgehog:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[duoids-hedgehog:post-build] [m[2mcopying 1 paths...[m
[2m[duoids-hedgehog:post-build] [m[2mcopying path '/nix/store/349qlybgg6fyg3x7dx68044ggfs7wkyj-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 35 of 47 built (2 building)[m
[2m[nothunks] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[nothunks] [m[1;36mPhase: configurePhase[m
[2m[nothunks] [mconfigureFlags: --verbose --prefix=/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.hkxskjs4A9/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[nothunks] [mUsing Parsec parser
[2m[nothunks] [mConfiguring nothunks-0.3.0.0...
[2m[nothunks] [mFlags chosen: bytestring=True, text=True, vector=True
[2m[nothunks] [mDependency base: using base-4.19.0.0
[2m[nothunks] [mDependency bytestring >=0.10 && <0.13: using bytestring-0.12.0.2
[2m[nothunks] [mDependency containers: using containers-0.6.8
[2m[nothunks] [mDependency ghc-heap: using ghc-heap-9.8.1
[2m[nothunks] [mDependency stm: using stm-2.5.2.1
[2m[nothunks] [mDependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1
[2m[nothunks] [mDependency time: using time-1.12.2
[2m[nothunks] [mDependency vector >=0.12 && <0.14: using vector-0.13.2.0
[2m[nothunks] [mDependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
[2m[nothunks] [mDependency base: using base-4.19.0.0
[2m[nothunks] [mDependency containers: using containers-0.6.8
[2m[nothunks] [mDependency ghc-prim: using ghc-prim-0.11.0
[2m[nothunks] [mDependency hedgehog: using hedgehog-1.5
[2m[nothunks] [mDependency nothunks: using nothunks-0.3.0.0
[2m[nothunks] [mDependency random: using random-1.2.1.3
[2m[nothunks] [mDependency stm: using stm-2.5.2.1
[2m[nothunks] [mDependency tasty: using tasty-1.5.3
[2m[nothunks] [mDependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
[2m[nothunks] [mSource component graph:
[2m[nothunks] [m    component lib
[2m[nothunks] [m    component test:nothunks-test dependency lib
[2m[nothunks] [mConfigured component graph:
[2m[nothunks] [m    component nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [m        include base-4.19.0.0-b960
[2m[nothunks] [m        include bytestring-0.12.0.2-4690
[2m[nothunks] [m        include containers-0.6.8-4775
[2m[nothunks] [m        include ghc-heap-9.8.1-6b37
[2m[nothunks] [m        include stm-2.5.2.1-83fa
[2m[nothunks] [m        include text-2.1-c36a
[2m[nothunks] [m        include time-1.12.2-d26d
[2m[nothunks] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[nothunks] [m        include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[nothunks] [m    component nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
[2m[nothunks] [m        include base-4.19.0.0-b960
[2m[nothunks] [m        include containers-0.6.8-4775
[2m[nothunks] [m        include ghc-prim-0.11.0-a69e
[2m[nothunks] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[nothunks] [m        include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[nothunks] [m        include stm-2.5.2.1-83fa
[2m[nothunks] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[nothunks] [m        include tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[nothunks] [mLinked component graph:
[2m[nothunks] [m    unit nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [m        include base-4.19.0.0-b960
[2m[nothunks] [m        include bytestring-0.12.0.2-4690
[2m[nothunks] [m        include containers-0.6.8-4775
[2m[nothunks] [m        include ghc-heap-9.8.1-6b37
[2m[nothunks] [m        include stm-2.5.2.1-83fa
[2m[nothunks] [m        include text-2.1-c36a
[2m[nothunks] [m        include time-1.12.2-d26d
[2m[nothunks] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[nothunks] [m        include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[nothunks] [m        NoThunks.Class=nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg:NoThunks.Class
[2m[nothunks] [m    unit nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
[2m[nothunks] [m        include base-4.19.0.0-b960
[2m[nothunks] [m        include containers-0.6.8-4775
[2m[nothunks] [m        include ghc-prim-0.11.0-a69e
[2m[nothunks] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[nothunks] [m        include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[scientific] [m[2 of 2] Linking dist/build/test-scientific/test-scientific
[2m[scientific] [m[1;36mPhase: checkPhase[m
[2m[scientific] [mRunning 1 test suites...
[2m[scientific] [mTest suite test-scientific: RUNNING...
[2m[scientific] [mscientific
[2m[scientific] [m  DoS protection
[2m[scientific] [m    Eq
[2m[scientific] [m      1e1000000:                        OK
[2m[scientific] [m    Ord
[2m[scientific] [m      compare 1234e1000000 123e1000001: OK
[2m[scientific] [m    RealFrac
[2m[scientific] [m      floor
[2m[scientific] [m        1e1000000:                      OK
[2m[scientific] [m        -1e-1000000:                    OK
[2m[scientific] [m        1e-1000000:                     OK
[2m[scientific] [m      ceiling
[2m[scientific] [m        1e1000000:                      OK
[2m[scientific] [m        -1e-1000000:                    OK
[2m[scientific] [m        1e-1000000:                     OK
[2m[scientific] [m      round
[2m[scientific] [m        1e1000000:                      OK
[2m[scientific] [m        -1e-1000000:                    OK
[2m[scientific] [m        1e-1000000:                     OK
[2m[scientific] [m      truncate
[2m[scientific] [m        1e1000000:                      OK
[2m[scientific] [m        -1e-1000000:                    OK
[2m[scientific] [m        1e-1000000:                     OK
[2m[scientific] [m      properFracton
[2m[scientific] [m        1e1000000:                      OK
[2m[scientific] [m        -1e-1000000:                    OK
[2m[scientific] [m        1e-1000000:                     OK
[2m[scientific] [m    toRealFloat
[2m[scientific] [m      1e1000000:                        OK
[2m[scientific] [m      1e-1000000:                       OK
[2m[scientific] [m    toBoundedInteger
[2m[scientific] [m      1e1000000:                        OK
[2m[scientific] [m  normalization
[2m[scientific] [m    smallcheck:                         OK
[2m[scientific] [m      81 tests completed (but 9 did not meet the condition)
[2m[scientific] [m    quickcheck:                         OK
[2m[scientific] [m      +++ OK, passed 100 tests; 27 discarded.
[2m[scientific] [m  Binary
[2m[scientific] [m    decode . encode == id
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  Parsing
[2m[scientific] [m    reads "":                           OK
[2m[scientific] [m    reads "1.":                         OK
[2m[scientific] [m    reads "1.2e":                       OK
[2m[scientific] [m    reads "(1.3 )":                     OK
[2m[scientific] [m    reads "((1.3))":                    OK
[2m[scientific] [m    reads " 1.3":                       OK
[2m[scientific] [m    read " ( ((  -1.0e+3 ) ))":         OK
[2m[scientific] [m    scientificP "3":                    OK
[2m[scientific] [m    scientificP "3.0e2":                OK
[2m[scientific] [m    scientificP "+3.0e+2":              OK
[2m[scientific] [m    scientificP "-3.0e-2":              OK
[2m[scientific] [m  Formatting
[2m[scientific] [m    read . show == id
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    show (Just 1):                      OK
[2m[scientific] [m    show (Just 0):                      OK
[2m[scientific] [m    show (Just (-1)):                   OK
[2m[scientific] [m    toDecimalDigits
[2m[scientific] [m      laws
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          45 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      == Numeric.floatToDigits
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          19 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m    Builder
[2m[scientific] [m      Text
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      ByteString
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m    formatScientific_fromFloatDigits
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        37 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  Eq
[2m[scientific] [m    ==
[2m[scientific] [m      smallcheck:                       OK (0.06s)
[2m[scientific] [m        6561 tests completed
[2m[scientific] [m      quickcheck:                       OK (0.01s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    s == s
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  Ord
[2m[scientific] [m    compare
[2m[scientific] [m      smallcheck:                       OK (0.02s)
[2m[scientific] [m        6561 tests completed
[2m[scientific] [m      quickcheck:                       OK (0.02s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  Num
[2m[scientific] [m    Equal to Rational
[2m[scientific] [m      fromInteger
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          11 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      +
[2m[scientific] [m        smallcheck:                     OK (0.02s)
[2m[nothunks] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[nothunks] [m        include stm-2.5.2.1-83fa
[2m[nothunks] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[nothunks] [m        include tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[nothunks] [mReady component graph:
[2m[nothunks] [m    definite nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [m        depends base-4.19.0.0-b960
[2m[nothunks] [m        depends bytestring-0.12.0.2-4690
[2m[nothunks] [m        depends containers-0.6.8-4775
[2m[nothunks] [m        depends ghc-heap-9.8.1-6b37
[2m[nothunks] [m        depends stm-2.5.2.1-83fa
[2m[nothunks] [m        depends text-2.1-c36a
[2m[nothunks] [m        depends time-1.12.2-d26d
[2m[nothunks] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[nothunks] [m        depends wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
[2m[nothunks] [m    definite nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
[2m[nothunks] [m        depends base-4.19.0.0-b960
[2m[nothunks] [m        depends containers-0.6.8-4775
[2m[nothunks] [m        depends ghc-prim-0.11.0-a69e
[2m[nothunks] [m        depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[nothunks] [m        depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[nothunks] [m        depends stm-2.5.2.1-83fa
[2m[nothunks] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[nothunks] [m        depends tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
[2m[nothunks] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[nothunks] [mUsing compiler: ghc-9.8.1
[2m[nothunks] [mUsing install prefix:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
[2m[nothunks] [mExecutables installed in:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/bin
[2m[nothunks] [mLibraries installed in:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [mDynamic Libraries installed in:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[nothunks] [mPrivate executables installed in:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0
[2m[nothunks] [mData files installed in:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0
[2m[nothunks] [mDocumentation installed in:
[2m[nothunks] [m/nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
[2m[nothunks] [mConfiguration files installed in:
[2m[nothunks] [m/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/etc
[2m[nothunks] [mNo alex found
[2m[nothunks] [mUsing ar found on system at:
[2m[nothunks] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[nothunks] [mNo c2hs found
[2m[nothunks] [mNo cpphs found
[2m[nothunks] [mNo doctest found
[2m[nothunks] [mUsing gcc version 14.3.0 given by user at:
[2m[nothunks] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[nothunks] [mUsing ghc version 9.8.1 found on system at:
[2m[nothunks] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[nothunks] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[nothunks] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[nothunks] [mNo ghcjs found
[2m[nothunks] [mNo ghcjs-pkg found
[2m[nothunks] [mNo greencard found
[2m[nothunks] [mUsing haddock version 2.30.0 found on system at:
[2m[nothunks] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[nothunks] [mNo happy found
[2m[nothunks] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[nothunks] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[nothunks] [mNo hmake found
[2m[nothunks] [mUsing hpc version 0.69 found on system at:
[2m[nothunks] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[nothunks] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[nothunks] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[nothunks] [mUsing hscolour version 1.25 found on system at:
[2m[nothunks] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[nothunks] [mNo jhc found
[2m[nothunks] [mUsing ld found on system at:
[2m[nothunks] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[nothunks] [mNo pkg-config found
[2m[nothunks] [mUsing runghc version 9.8.1 found on system at:
[2m[nothunks] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[nothunks] [mUsing strip version 2.44 found on system at:
[2m[nothunks] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[nothunks] [mUsing tar found on system at:
[2m[nothunks] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[nothunks] [mNo uhc found
[2m[nothunks] [m[1;36mPhase: buildPhase[m
[2m[nothunks] [mPreprocessing library for nothunks-0.3.0.0..
[2m[nothunks] [mBuilding library for nothunks-0.3.0.0..
[2m[nothunks] [m[1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
[2m[scientific] [m          6561 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.04s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      -
[2m[scientific] [m        smallcheck:                     OK (0.02s)
[2m[scientific] [m          6561 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.04s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      *
[2m[scientific] [m        smallcheck:                     OK (0.02s)
[2m[scientific] [m          6561 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.03s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      abs
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.01s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      negate
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.01s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      signum
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m    0 identity of +
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK (2.50s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    1 identity of *
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    0 identity of *
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    associativity of +
[2m[nothunks] [m[1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
[2m[scientific] [m      smallcheck:                       OK (1.54s)
[2m[scientific] [m        531441 tests completed
[2m[scientific] [m      quickcheck:                       OK (2.64s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    commutativity of +
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        6561 tests completed
[2m[nothunks] [mPreprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
[2m[nothunks] [mBuilding test suite 'nothunks-test' for nothunks-0.3.0.0..
[2m[nothunks] [m[1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
[2m[scientific] [m      quickcheck:                       OK (1.49s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    distributivity of * over +
[2m[scientific] [m      smallcheck:                       OK (1.70s)
[2m[scientific] [m        531441 tests completed
[2m[nothunks] [m[2 of 2] Compiling Main             ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
[2m[scientific] [m      quickcheck:                       OK (0.92s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    subtracting the addition
[2m[scientific] [m      smallcheck:                       OK (0.03s)
[2m[scientific] [m        6561 tests completed
[2m[nothunks] [m[3 of 3] Linking dist/build/nothunks-test/nothunks-test
[2m[scientific] [m      quickcheck:                       OK (2.31s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    + and negate
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    - and negate
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    abs . negate == id
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        45 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  Real
[2m[scientific] [m    fromRational . toRational == id
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[nothunks] [m[1;36mPhase: checkPhase[m
[2m[nothunks] [mRunning 1 test suites...
[2m[nothunks] [mTest suite nothunks-test: RUNNING...
[2m[nothunks] [mTests
[2m[nothunks] [m  NoThunks.Class
[2m[nothunks] [m    Sanity
[2m[nothunks] [m      IntNotNF:          OK
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m      IntIsNF:           OK
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m      Pair:              OK
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m      Sum:               OK
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m      Fn:                OK
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m      IO:                OK
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m    InspectHeap
[2m[nothunks] [m      Int:               OK (0.04s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int"] 51% ██████████▏·········
[2m[nothunks] [m            Nothing      49% █████████▊··········
[2m[nothunks] [m      IntInt:            OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","Tuple2"] 38% ███████▋············
[2m[nothunks] [m            Just ["Tuple2"]       49% █████████▊··········
[2m[nothunks] [m            Nothing               12% ██▌·················
[2m[nothunks] [m      SumInt:            OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Either"]       34% ██████▋·············
[2m[nothunks] [m            Just ["Int","Either"] 34% ██████▊·············
[2m[nothunks] [m            Nothing               32% ██████▍·············
[2m[nothunks] [m      ListInt:           OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List"] 22% ████▍···············
[2m[nothunks] [m            Just ["List"]       44% ████████▊···········
[2m[nothunks] [m            Nothing             34% ██████▊·············
[2m[nothunks] [m      IntListInt:        OK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List","Tuple2"]  5% █···················
[2m[nothunks] [m            Just ["Int","Tuple2"]        24% ████▉···············
[2m[nothunks] [m            Just ["List","Tuple2"]       12% ██▍·················
[2m[nothunks] [m            Just ["Tuple2"]              50% █████████▉··········
[2m[nothunks] [m            Nothing                       8% █▋··················
[2m[nothunks] [m      SeqInt:              [91m✗[0m [91mEXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
[2m[nothunks] [m    after 7 tests.
[2m[nothunks] [m    shrink path: 7:[0m
[2m[nothunks] [m    Just ["Int","Seq"][m [0m43%[m [0m████████▌[91m[0m[90m···········[0m[m[0m
[2m[nothunks] [m    Nothing           [m [0m43%[m [0m████████▌[91m[0m[90m···········[0m[m[0m
[2m[nothunks] [m  
[2m[nothunks] [m        [m┏━━[0m [mtest/Test/NoThunks/Class.hs[0m [m━━━[0m
[2m[nothunks] [m    [m166[0m [m┃[0m [mtestWithModel :: forall a. FromModel a[0m
[2m[nothunks] [m    [m167[0m [m┃[0m [m              => (Maybe ThunkInfo -> Maybe [String] -> Bool)[0m
[2m[nothunks] [m    [m168[0m [m┃[0m [m              -> Proxy a[0m
[2m[nothunks] [m    [m169[0m [m┃[0m [m              -- ^ Compare @ThunkInfo@. When we use 'noThunks' this[0m
[2m[nothunks] [m    [m170[0m [m┃[0m [m              -- can just be @(==)@; however, when we use 'isNormalForm', the[0m
[2m[nothunks] [m    [m171[0m [m┃[0m [m              -- context we will get from the model will be too detailed.[0m
[2m[nothunks] [m    [m172[0m [m┃[0m [m              -> Property[0m
[2m[nothunks] [m    [m173[0m [m┃[0m [mtestWithModel compareInfo _proxy = withTests 1000 $ property $ do[0m
[2m[nothunks] [m    [35m174[0m [m┃[0m [m    m :: Model a <- forAll genModel[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35mWrap[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m  { unwrap =[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m      SeqEnqueue[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m        (IntValue 0)[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m        (SeqEnqueue[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m           (IntValue 0)[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m           (SeqEnqueue[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m              (IntValue 0)[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m              (SeqEnqueue[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m                 (IntValue 0)[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m                 (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m     [35m│ [0m[35m  }[0m
[2m[nothunks] [m    [m175[0m [m┃[0m [m    collect $ modelUnexpected [] m[0m
[2m[nothunks] [m    [m176[0m [m┃[0m [m    fromModel m $ \a -> do[0m
[2m[nothunks] [m    [35m177[0m [m┃[0m [m      annotate $ show $ modelIsNF [] m[0m
[2m[nothunks] [m    [35m   [0m [m┃[0m       [35m│ [0m[35mIsNF[0m
[2m[nothunks] [m    [m178[0m [m┃[0m [m      isNF <- liftIO $ noThunks [] a[0m
[2m[nothunks] [m    [91m179[0m [m┃[0m [91;1m      Hedgehog.diff isNF compareInfo (modelUnexpected [] m)[0m
[2m[nothunks] [m    [91m   [0m [m┃[0m       [91m^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m
[2m[nothunks] [m    [91m   [0m [m┃[0m       [m│ [0m[m━━━ Failed ([0m[31m- lhs[0m[m) ([0m[32m+ rhs[0m[m) ━━━[0m
[2m[nothunks] [m    [91m   [0m [m┃[0m       [m│ [0m[31m- Just[0m
[2m[nothunks] [m    [91m   [0m [m┃[0m       [m│ [0m[31m-   ThunkInfo[0m
[2m[nothunks] [m    [91m   [0m [m┃[0m       [m│ [0m[31m-     { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }[0m
[2m[nothunks] [m    [91m   [0m [m┃[0m       [m│ [0m[32m+ Nothing[0m
[2m[nothunks] [m  
[2m[nothunks] [m    [mThis failure can be reproduced by running:[0m
[2m[nothunks] [m    [m>[0m [mrecheckAt (Seed 11937808295631642844 9520887802073393749) "7:" EXPECTED FAILURE[0m
[2m[nothunks] [m  
[2m[nothunks] [mOK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m    Model
[2m[nothunks] [m      Int:               OK (0.01s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int"] 50% ██████████··········
[2m[nothunks] [m            Nothing      50% █████████▉··········
[2m[nothunks] [m      IntInt:            OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","Tuple2"] 40% ███████▉············
[2m[nothunks] [m            Just ["Tuple2"]       47% █████████▍··········
[2m[nothunks] [m            Nothing               13% ██▋·················
[2m[nothunks] [m      SumInt:            OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Either"]       33% ██████▌·············
[2m[nothunks] [m            Just ["Int","Either"] 34% ██████▊·············
[2m[nothunks] [m            Nothing               33% ██████▌·············
[2m[nothunks] [m      ListInt:           OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List"] 23% ████▌···············
[2m[nothunks] [m            Just ["List"]       42% ████████▍···········
[2m[nothunks] [m            Nothing             35% ███████·············
[2m[nothunks] [m      IntListInt:        OK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List","Tuple2"]  6% █▏··················
[2m[nothunks] [m            Just ["Int","Tuple2"]        22% ████▍···············
[2m[nothunks] [m            Just ["List","Tuple2"]       10% ██··················
[2m[nothunks] [m            Just ["Tuple2"]              55% ███████████·········
[2m[nothunks] [m            Nothing                       6% █▎··················
[2m[nothunks] [m      SeqInt:            OK (0.07s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","Seq"] 48% █████████▌··········
[2m[nothunks] [m            Nothing            52% ██████████▍·········
[2m[nothunks] [m      AllowThunksIn:     OK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","field2","Record"] 26% █████▏··············
[2m[nothunks] [m            Just ["Record"]                50% ██████████··········
[2m[nothunks] [m            Nothing                        24% ████▊···············
[2m[nothunks] [m      Fn:                OK (0.01s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["->"] 26% █████···············
[2m[nothunks] [m            Nothing     74% ██████████████▉·····
[2m[nothunks] [m      IO:                OK (0.01s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["IO"] 26% █████▏··············
[2m[nothunks] [m            Nothing     74% ██████████████▊·····
[2m[nothunks] [m      ThunkFreeFn:       OK (0.01s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["->"]       25% ████▉···············
[2m[nothunks] [m            Just ["...","->"] 34% ██████▊·············
[2m[nothunks] [m            Nothing           41% ████████▏···········
[2m[nothunks] [m      ThunkFreeIO:       OK (0.01s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["...","IO"] 40% ███████▉············
[2m[nothunks] [m            Just ["IO"]       26% █████▏··············
[2m[nothunks] [m            Nothing           34% ██████▉·············
[2m[nothunks] [m    MutableVars
[2m[nothunks] [m      IORef
[2m[nothunks] [m        NotNF:           OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NF:              OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NotNFPure:       OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NFPure:          OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NotNFAtomically: OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NFAtomically:    OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m      MVar
[2m[nothunks] [m        NotNF:           OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NF:              OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NotNFPure:       OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NFPure:          OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NotNFAtomically: OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NFAtomically:    OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m      TVar
[2m[nothunks] [m        NotNF:           OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NF:              OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NotNFPure:       OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NFPure:          OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NotNFAtomically: OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m        NFAtomically:    OK
[2m[nothunks] [m            ✓ <interactive> passed 1 test.
[2m[nothunks] [m
[2m[nothunks] [mAll 41 tests passed (0.41s)
[2m[nothunks] [mTest suite nothunks-test: PASS
[2m[nothunks] [mTest suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
[2m[nothunks] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[nothunks] [m[1;36mPhase: haddockPhase[m
[2m[nothunks] [mPreprocessing library for nothunks-0.3.0.0..
[2m[nothunks] [mRunning Haddock on library for nothunks-0.3.0.0..
[2m[nothunks] [mWarning: The documentation for the following packages are not installed. No
[2m[nothunks] [mlinks will be generated to these packages: vector-0.13.2.0
[2m[nothunks] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[nothunks] [m[1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, nothing )
[2m[nothunks] [mHaddock coverage:
[2m[nothunks] [mWarning: 'AllowThunksIn' is ambiguous. It is defined
[2m[nothunks] [m    * at src/NoThunks/Class.hs:334:48
[2m[nothunks] [m    * at src/NoThunks/Class.hs:334:1
[2m[nothunks] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m    by specifying the type/value namespace explicitly.
[2m[nothunks] [m    Defaulting to the one defined at src/NoThunks/Class.hs:334:1
[2m[nothunks] [mWarning: 'InspectHeap' is ambiguous. It is defined
[2m[nothunks] [m    * at src/NoThunks/Class.hs:353:25
[2m[nothunks] [m    * at src/NoThunks/Class.hs:353:1
[2m[nothunks] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m    by specifying the type/value namespace explicitly.
[2m[nothunks] [m    Defaulting to the one defined at src/NoThunks/Class.hs:353:1
[2m[nothunks] [mWarning: 'InspectHeapNamed' is ambiguous. It is defined
[2m[nothunks] [m    * at src/NoThunks/Class.hs:358:47
[2m[nothunks] [m    * at src/NoThunks/Class.hs:358:1
[2m[nothunks] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m    by specifying the type/value namespace explicitly.
[2m[nothunks] [m    Defaulting to the one defined at src/NoThunks/Class.hs:358:1
[2m[nothunks] [mWarning: 'OnlyCheckWhnf' is ambiguous. It is defined
[2m[nothunks] [m    * at src/NoThunks/Class.hs:308:27
[2m[nothunks] [m    * at src/NoThunks/Class.hs:308:1
[2m[nothunks] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m    by specifying the type/value namespace explicitly.
[2m[nothunks] [m    Defaulting to the one defined at src/NoThunks/Class.hs:308:1
[2m[nothunks] [mWarning: 'ThunkInfo' is ambiguous. It is defined
[2m[nothunks] [m    * at src/NoThunks/Class.hs:230:18
[2m[nothunks] [m    * at src/NoThunks/Class.hs:230:1
[2m[nothunks] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[nothunks] [m    by specifying the type/value namespace explicitly.
[2m[nothunks] [m    Defaulting to the one defined at src/NoThunks/Class.hs:230:1
[2m[nothunks] [mWarning: 'GHC' is out of scope.
[2m[nothunks] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[nothunks] [mWarning: 'a' is out of scope.
[2m[nothunks] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[nothunks] [m  95% ( 20 / 21) in 'NoThunks.Class'
[2m[nothunks] [m  Missing documentation for:
[2m[nothunks] [m    Module header
[2m[scientific] [m      quickcheck:                       OK (3.07s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  RealFrac
[2m[scientific] [m    Equal to Rational
[2m[scientific] [m      properFraction
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[nothunks] [mWarning: NoThunks.Class: could not find link destinations for: 
[2m[nothunks] [m	- Data.Vector.Vector
[2m[nothunks] [m	- Data.Vector.Unboxed.Base.Vector
[2m[nothunks] [m	- NoThunks.Class.HasFields
[2m[nothunks] [m	- NoThunks.Class.Elem
[2m[nothunks] [m	- NoThunks.Class.GShowTypeOf
[2m[nothunks] [m	- NoThunks.Class.GWRecordField
[2m[nothunks] [m	- NoThunks.Class.checkContainsThunks
[2m[scientific] [m        quickcheck:                     OK (3.32s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      round
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.01s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      truncate
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      ceiling
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK (0.01s)
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      floor
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m    properFraction_laws
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK (1.25s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    round
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    truncate
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    ceiling
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    floor
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m  Conversions
[2m[scientific] [m    fromRationalRepetend
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        189 tests completed
[2m[scientific] [m      quickcheck:                       OK
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    Float
[2m[scientific] [m      toRealFloat
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          37 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      toRealFloat . fromFloatDigits == id
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          37 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m    Double
[2m[scientific] [m      toRealFloat
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          37 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      toRealFloat . fromFloatDigits == id
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          37 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m    floatingOrInteger
[2m[scientific] [m      correct conversion
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          81 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      Integer == Right
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          11 tests completed
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests.
[2m[scientific] [m      Double == Left
[2m[scientific] [m        smallcheck:                     OK
[2m[scientific] [m          37 tests completed (but 21 did not meet the condition)
[2m[scientific] [m        quickcheck:                     OK
[2m[scientific] [m          +++ OK, passed 100 tests; 58 discarded.
[2m[scientific] [m    toBoundedInteger
[2m[scientific] [m      correct conversion
[2m[scientific] [m        Int64
[2m[scientific] [m          smallcheck:                   OK
[2m[scientific] [m            81 tests completed
[2m[scientific] [m          quickcheck:                   OK
[2m[scientific] [m            +++ OK, passed 100 tests.
[2m[scientific] [m        Word64
[2m[scientific] [m          smallcheck:                   OK
[2m[scientific] [m            81 tests completed
[2m[scientific] [m          quickcheck:                   OK
[2m[scientific] [m            +++ OK, passed 100 tests.
[2m[scientific] [m        NegativeNum
[2m[scientific] [m          smallcheck:                   OK
[2m[scientific] [m            81 tests completed
[2m[scientific] [m          quickcheck:                   OK
[2m[scientific] [m            +++ OK, passed 100 tests.
[2m[scientific] [m  toBoundedRealFloat
[2m[scientific] [m    0 * 10^1000 == 0:                   OK
[2m[scientific] [m  toBoundedInteger
[2m[scientific] [m    to Int64
[2m[scientific] [m      succ of maxBound:                 OK
[2m[scientific] [m      pred of minBound:                 OK
[2m[scientific] [m      0 * 10^1000 == 0:                 OK
[2m[scientific] [m  Predicates
[2m[scientific] [m    isFloating
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[nothunks] [mDocumentation created: dist/doc/html/nothunks/,
[2m[nothunks] [mdist/doc/html/nothunks/nothunks.txt
[2m[nothunks] [mPreprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
[2m[nothunks] [m[1;36mPhase: installPhase[m
[2m[nothunks] [mInstalling library in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[nothunks] [m[1;36mPhase: fixupPhase[m
[2m[nothunks] [mshrinking RPATHs of ELF executables and libraries in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
[2m[nothunks] [mshrinking /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSnothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg-ghc9.8.1.so
[2m[nothunks] [mchecking for references to /build/ in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0...
[2m[nothunks] [mpatching script interpreter paths in /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0
[2m[nothunks] [mstripping (with command strip and flags -S -p) in  /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0/lib
[2m[scientific] [m      quickcheck:                       OK (1.08s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m    isInteger
[2m[scientific] [m      smallcheck:                       OK
[2m[scientific] [m        81 tests completed
[2m[nothunks] [mshrinking RPATHs of ELF executables and libraries in /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc
[2m[nothunks] [mchecking for references to /build/ in /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc...
[2m[nothunks] [mpatching script interpreter paths in /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc
[2m[nothunks:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0[m
[2m[nothunks:post-build] [m[2mPushing 2 paths (96 are already present) using zstd to cache sellout ⏳[m
[2m[nothunks:post-build] [m[2m[m
[2m[nothunks:post-build] [m[2mPushing /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc (841.92 KiB)[m
[2m[nothunks:post-build] [m[2mPushing /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0 (2.71 MiB)[m
[2m[nothunks:post-build] [m[2m[m
[2m[nothunks:post-build] [m[2mAll done.[m
[2m[nothunks:post-build] [m[2mUploading to the NixCI cache: /nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc /nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0[m
[2m[nothunks:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[nothunks:post-build] [m[2mcopying 2 paths...[m
[2m[nothunks:post-build] [m[2mcopying path '/nix/store/di3hbzmp4pafzwyclnn2ygxy4lqvfw94-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[nothunks:post-build] [m[2mcopying path '/nix/store/kqpiwx6wmxx2mmssgjffvi26i0jnyk71-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...[m
[2m[nothunks:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[nothunks:post-build] [m[2mcopying 1 paths...[m
[2m[nothunks:post-build] [m[2mcopying path '/nix/store/w1l3ywx2hi2wfc49gx8mlzxfb6sxzkmw-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 36 of 46 built (1 building)[m
[1;34mBuilding /nix/store/sl4dwg6r5dr8h3npvwjsv9kdvg0gwxn6-unordered-containers-0.2.20.drv[m
[2m[scientific] [m      quickcheck:                       OK (0.50s)
[2m[scientific] [m        +++ OK, passed 100 tests.
[2m[scientific] [m
[2m[scientific] [mAll 142 tests passed (22.79s)
[2m[scientific] [mTest suite test-scientific: PASS
[2m[scientific] [mTest suite logged to: dist/test/scientific-0.3.8.0-test-scientific.log
[2m[scientific] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[scientific] [m[1;36mPhase: haddockPhase[m
[2m[scientific] [mPreprocessing library for scientific-0.3.8.0..
[2m[scientific] [mRunning Haddock on library for scientific-0.3.8.0..
[2m[scientific] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[scientific] [m[1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, nothing )
[2m[scientific] [m[2 of 5] Compiling Utils            ( src/Utils.hs, nothing )
[2m[scientific] [m[3 of 5] Compiling Data.Scientific  ( src/Data/Scientific.hs, nothing )
[2m[scientific] [m[4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, nothing )
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/Text/Lazy/Builder/Scientific.hs:19:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    The import of ‘Data.Monoid’ is redundant
[2m[scientific] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[scientific] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m19 |[0m[0m [;1m[35mimport Data.Monoid                  ((<>))[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [m[5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, nothing )
[2m[scientific] [m
[2m[scientific] [m[;1msrc/Data/ByteString/Builder/Scientific.hs:20:1: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[scientific] [m    The import of ‘Data.Monoid’ is redundant
[2m[scientific] [m      except perhaps to import instances from ‘Data.Monoid’
[2m[scientific] [m    To import instances alone, use: import Data.Monoid()[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m
[2m[scientific] [m[;1m[34m20 |[0m[0m [;1m[35mimport Data.Monoid                  ((<>))[0m[0m
[2m[scientific] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[scientific] [mHaddock coverage:
[2m[scientific] [mWarning: 'Scientific' is ambiguous. It is defined
[2m[scientific] [m    * at src/Data/Scientific.hs:139:19
[2m[scientific] [m    * at src/Data/Scientific.hs:139:1
[2m[scientific] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[scientific] [m    by specifying the type/value namespace explicitly.
[2m[scientific] [m    Defaulting to the one defined at src/Data/Scientific.hs:139:1
[2m[scientific] [mWarning: 'base10exponent' is out of scope.
[2m[scientific] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[scientific] [mWarning: 'base10Exponent' is out of scope.
[2m[scientific] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[scientific] [m 100% ( 31 / 31) in 'Data.Scientific'
[2m[scientific] [m  75% (  3 /  4) in 'Data.Text.Lazy.Builder.Scientific'
[2m[scientific] [m  Missing documentation for:
[2m[scientific] [m    Module header
[2m[scientific] [m  75% (  3 /  4) in 'Data.ByteString.Builder.Scientific'
[2m[scientific] [m  Missing documentation for:
[2m[scientific] [m    Module header
[2m[scientific] [mDocumentation created: dist/doc/html/scientific/,
[2m[scientific] [mdist/doc/html/scientific/scientific.txt
[2m[scientific] [mPreprocessing test suite 'test-scientific' for scientific-0.3.8.0..
[2m[scientific] [m[1;36mPhase: installPhase[m
[2m[scientific] [mInstalling library in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[unordered-containers] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[unordered-containers] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[scientific] [m[1;36mPhase: fixupPhase[m
[2m[scientific] [mshrinking RPATHs of ELF executables and libraries in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
[2m[scientific] [mshrinking /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSscientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X-ghc9.8.1.so
[2m[scientific] [mchecking for references to /build/ in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0...
[2m[scientific] [mpatching script interpreter paths in /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0
[2m[scientific] [mstripping (with command strip and flags -S -p) in  /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0/lib
[2m[unordered-containers] [m[1;36mPhase: unpackPhase[m
[2m[unordered-containers] [munpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
[2m[unordered-containers] [msource root is unordered-containers-0.2.20
[2m[unordered-containers] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
[2m[unordered-containers] [m[1;36mPhase: patchPhase[m
[2m[unordered-containers] [mReplace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
[2m[unordered-containers] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[unordered-containers] [msetupCompileFlags: -package-db=/build/tmp.2oC7ggLua1/setup-package.conf.d -threaded
[2m[unordered-containers] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.2oC7ggLua1/Main.o )
[2m[scientific] [mshrinking RPATHs of ELF executables and libraries in /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc
[2m[scientific] [mchecking for references to /build/ in /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc...
[2m[scientific] [mpatching script interpreter paths in /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc
[2m[scientific:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0[m
[2m[scientific:post-build] [m[2mPushing 2 paths (74 are already present) using zstd to cache sellout ⏳[m
[2m[scientific:post-build] [m[2m[m
[2m[scientific:post-build] [m[2mPushing /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc (988.15 KiB)[m
[2m[scientific:post-build] [m[2mPushing /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0 (2.93 MiB)[m
[2m[scientific:post-build] [m[2m[m
[2m[scientific:post-build] [m[2mAll done.[m
[2m[scientific:post-build] [m[2mUploading to the NixCI cache: /nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc /nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0[m
[2m[scientific:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[scientific:post-build] [m[2mcopying 2 paths...[m
[2m[scientific:post-build] [m[2mcopying path '/nix/store/c34b2d5vc04jl24wxwdhvg1yg83if47v-scientific-0.3.8.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[scientific:post-build] [m[2mcopying path '/nix/store/g60vbzdibaxxs4vwsapvlxvarxs87wxd-scientific-0.3.8.0' to 'https://cache.nix-ci.com'...[m
[2m[scientific:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[scientific:post-build] [m[2mcopying 1 paths...[m
[2m[scientific:post-build] [m[2mcopying path '/nix/store/kmwyd33dsb5b986dg2s1ywr8cchd9p33-scientific-0.3.8.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 37 of 46 built (1 building)[m
[2m[unordered-containers] [m[2 of 2] Linking Setup
[2m[unordered-containers] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[unordered-containers] [m[1;36mPhase: configurePhase[m
[2m[unordered-containers] [mconfigureFlags: --verbose --prefix=/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.2oC7ggLua1/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[unordered-containers] [mUsing Parsec parser
[2m[unordered-containers] [mConfiguring unordered-containers-0.2.20...
[2m[unordered-containers] [mFlags chosen: debug=False
[2m[unordered-containers] [mDependency base >=4.10 && <5: using base-4.19.0.0
[2m[unordered-containers] [mDependency deepseq >=1.4.3: using deepseq-1.5.0.0
[2m[unordered-containers] [mDependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
[2m[unordered-containers] [mDependency template-haskell <2.24: using template-haskell-2.21.0.0
[2m[unordered-containers] [mDependency ChasingBottoms: using ChasingBottoms-1.3.1.15
[2m[unordered-containers] [mDependency HUnit: using HUnit-1.6.2.0
[2m[unordered-containers] [mDependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
[2m[unordered-containers] [mDependency base: using base-4.19.0.0
[2m[unordered-containers] [mDependency containers >=0.5.8: using containers-0.6.8
[2m[unordered-containers] [mDependency hashable: using hashable-1.4.7.0
[2m[unordered-containers] [mDependency nothunks >=0.1.3: using nothunks-0.3.0.0
[2m[unordered-containers] [mDependency random: using random-1.2.1.3
[2m[unordered-containers] [mDependency tasty >=1.4.0.3: using tasty-1.5.3
[2m[unordered-containers] [mDependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
[2m[unordered-containers] [mDependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
[2m[unordered-containers] [mDependency unordered-containers: using unordered-containers-0.2.20
[2m[unordered-containers] [mSource component graph:
[2m[unordered-containers] [m    component lib
[2m[unordered-containers] [m    component test:unordered-containers-tests dependency lib
[2m[unordered-containers] [mConfigured component graph:
[2m[unordered-containers] [m    component unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [m        include base-4.19.0.0-b960
[2m[unordered-containers] [m        include deepseq-1.5.0.0-412f
[2m[unordered-containers] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[unordered-containers] [m        include template-haskell-2.21.0.0-8831
[2m[unordered-containers] [m    component unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
[2m[unordered-containers] [m        include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
[2m[unordered-containers] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[unordered-containers] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[unordered-containers] [m        include base-4.19.0.0-b960
[2m[unordered-containers] [m        include containers-0.6.8-4775
[2m[unordered-containers] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[unordered-containers] [m        include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[unordered-containers] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[unordered-containers] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[unordered-containers] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[unordered-containers] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[unordered-containers] [m        include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [mLinked component graph:
[2m[unordered-containers] [m    unit unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [m        include base-4.19.0.0-b960
[2m[unordered-containers] [m        include deepseq-1.5.0.0-412f
[2m[unordered-containers] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[unordered-containers] [m        include template-haskell-2.21.0.0-8831
[2m[unordered-containers] [m        Data.HashMap.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet.Internal
[2m[unordered-containers] [m    unit unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
[2m[unordered-containers] [m        include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
[2m[unordered-containers] [m        include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[unordered-containers] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[unordered-containers] [m        include base-4.19.0.0-b960
[2m[unordered-containers] [m        include containers-0.6.8-4775
[2m[unordered-containers] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[unordered-containers] [m        include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[unordered-containers] [m        include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[unordered-containers] [m        include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[unordered-containers] [m        include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[unordered-containers] [m        include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[unordered-containers] [m        include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [mReady component graph:
[2m[unordered-containers] [m    definite unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [m        depends base-4.19.0.0-b960
[2m[unordered-containers] [m        depends deepseq-1.5.0.0-412f
[2m[unordered-containers] [m        depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[unordered-containers] [m        depends template-haskell-2.21.0.0-8831
[2m[unordered-containers] [m    definite unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
[2m[unordered-containers] [m        depends ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
[2m[unordered-containers] [m        depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
[2m[unordered-containers] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[unordered-containers] [m        depends base-4.19.0.0-b960
[2m[unordered-containers] [m        depends containers-0.6.8-4775
[2m[unordered-containers] [m        depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[unordered-containers] [m        depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
[2m[unordered-containers] [m        depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
[2m[unordered-containers] [m        depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
[2m[unordered-containers] [m        depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
[2m[unordered-containers] [m        depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
[2m[unordered-containers] [m        depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[unordered-containers] [mUsing compiler: ghc-9.8.1
[2m[unordered-containers] [mUsing install prefix:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
[2m[unordered-containers] [mExecutables installed in:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/bin
[2m[unordered-containers] [mLibraries installed in:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [mDynamic Libraries installed in:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[unordered-containers] [mPrivate executables installed in:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
[2m[unordered-containers] [mData files installed in:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
[2m[unordered-containers] [mDocumentation installed in:
[2m[unordered-containers] [m/nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
[2m[unordered-containers] [mConfiguration files installed in:
[2m[unordered-containers] [m/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/etc
[2m[unordered-containers] [mNo alex found
[2m[unordered-containers] [mUsing ar found on system at:
[2m[unordered-containers] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[unordered-containers] [mNo c2hs found
[2m[unordered-containers] [mNo cpphs found
[2m[unordered-containers] [mNo doctest found
[2m[unordered-containers] [mUsing gcc version 14.3.0 given by user at:
[2m[unordered-containers] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[unordered-containers] [mUsing ghc version 9.8.1 found on system at:
[2m[unordered-containers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[unordered-containers] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[unordered-containers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[unordered-containers] [mNo ghcjs found
[2m[unordered-containers] [mNo ghcjs-pkg found
[2m[unordered-containers] [mNo greencard found
[2m[unordered-containers] [mUsing haddock version 2.30.0 found on system at:
[2m[unordered-containers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[unordered-containers] [mNo happy found
[2m[unordered-containers] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[unordered-containers] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[unordered-containers] [mNo hmake found
[2m[unordered-containers] [mUsing hpc version 0.69 found on system at:
[2m[unordered-containers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[unordered-containers] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[unordered-containers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[unordered-containers] [mUsing hscolour version 1.25 found on system at:
[2m[unordered-containers] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[unordered-containers] [mNo jhc found
[2m[unordered-containers] [mUsing ld found on system at:
[2m[unordered-containers] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[unordered-containers] [mNo pkg-config found
[2m[unordered-containers] [mUsing runghc version 9.8.1 found on system at:
[2m[unordered-containers] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[unordered-containers] [mUsing strip version 2.44 found on system at:
[2m[unordered-containers] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[unordered-containers] [mUsing tar found on system at:
[2m[unordered-containers] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[unordered-containers] [mNo uhc found
[2m[unordered-containers] [m[1;36mPhase: buildPhase[m
[2m[unordered-containers] [mPreprocessing library for unordered-containers-0.2.20..
[2m[unordered-containers] [mBuilding library for unordered-containers-0.2.20..
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-53692[0m[0m[;1m] [[;1m[35m-Wdeprecated-flags[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m12 |[0m[0m {-# LANGUAGE [;1m[35mTypeInType[0m[0m            #-}
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m              ^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    The import of ‘Control.Applicative’ is redundant
[2m[unordered-containers] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[unordered-containers] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m83 |[0m[0m [;1m[35mimport Control.Applicative (liftA2)[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m[3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m[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 )
[2m[unordered-containers] [m[6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
[2m[unordered-containers] [m[7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
[2m[unordered-containers] [m[8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
[2m[unordered-containers] [m[9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-53692[0m[0m[;1m] [[;1m[35m-Wdeprecated-flags[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m12 |[0m[0m {-# LANGUAGE [;1m[35mTypeInType[0m[0m            #-}
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m              ^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    The import of ‘Control.Applicative’ is redundant
[2m[unordered-containers] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[unordered-containers] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m83 |[0m[0m [;1m[35mimport Control.Applicative (liftA2)[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
[2m[unordered-containers] [m[3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
[2m[unordered-containers] [m[4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
[2m[unordered-containers] [m[5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
[2m[unordered-containers] [m[6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
[2m[unordered-containers] [m[7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
[2m[unordered-containers] [m[8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
[2m[unordered-containers] [m[9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
[2m[unordered-containers] [mPreprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
[2m[unordered-containers] [mBuilding test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
[2m[unordered-containers] [m[1 of 9] Compiling Properties.List  ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
[2m[unordered-containers] [m[2 of 9] Compiling Regressions      ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mtests/Regressions.hs:91:16: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    In the use of ‘head’
[2m[unordered-containers] [m    (imported from Prelude, but defined in GHC.List):
[2m[unordered-containers] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m91 |[0m[0m       k      = [;1m[35mhead[0m[0m keys
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m                ^^^^[0m[0m
[2m[unordered-containers] [m[3 of 9] Compiling Util.Key         ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
[2m[unordered-containers] [m[4 of 9] Compiling Strictness       ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
[2m[unordered-containers] [m[5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
[2m[unordered-containers] [m[6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
[2m[unordered-containers] [m[7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
[2m[unordered-containers] [m[8 of 9] Compiling Properties       ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
[2m[unordered-containers] [m[9 of 9] Compiling Main             ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
[2m[unordered-containers] [m[10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
[2m[unordered-containers] [mbuildPhase completed in 39 seconds
[2m[unordered-containers] [m[1;36mPhase: checkPhase[m
[2m[unordered-containers] [mRunning 1 test suites...
[2m[unordered-containers] [mTest suite unordered-containers-tests: RUNNING...
[2m[unordered-containers] [mAll
[2m[unordered-containers] [m  Properties
[2m[unordered-containers] [m    Data.HashMap.Lazy
[2m[unordered-containers] [m      instances
[2m[unordered-containers] [m        Eq
[2m[unordered-containers] [m          ==:                              OK (0.04s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          /=:                              OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Ord
[2m[unordered-containers] [m          compare reflexive:               OK (0.06s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare transitive:              OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare antisymmetric:           OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          Ord => Eq:                       OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Read/Show:                         OK (0.30s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Functor:                           OK (0.16s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Foldable:                          OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Bifoldable
[2m[unordered-containers] [m          bifoldMap:                       OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          bifoldr:                         OK (0.04s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          bifoldl:                         OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Hashable:                          OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      empty
[2m[unordered-containers] [m        valid:                             OK
[2m[unordered-containers] [m          +++ OK, passed 1 test.
[2m[unordered-containers] [m      singleton
[2m[unordered-containers] [m        valid:                             OK
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      size:                                OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      lookup:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      !?:                                  OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insertWith
[2m[unordered-containers] [m        insertWith:                        OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      delete
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      adjust
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      update
[2m[unordered-containers] [m        model:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      alter
[2m[unordered-containers] [m        model:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      alterF
[2m[unordered-containers] [m        model
[2m[unordered-containers] [m          []:                              OK (0.12s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          adjust:                          OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insert:                          OK (0.01s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insertWith:                      OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          delete:                          OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          lookup:                          OK (0.02s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      isSubmapOf
[2m[unordered-containers] [m        model:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m ⊆ m:                             OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ⊆ m1 ∪ m2:                      OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ⊈ m2  ⇒  m1 ∪ m2 ⊈ m1:          OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 15 discarded.
[2m[unordered-containers] [m        m1\m2 ⊆ m1:                        OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 190 discarded.
[2m[unordered-containers] [m        delete k m ⊆ m:                    OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 17 discarded.
[2m[unordered-containers] [m        m ⊈ delete k m :                   OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 17 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  m ⊆ insert k v m:        OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 5 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  insert k v m ⊈ m:        OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 6 discarded.
[2m[unordered-containers] [m      union
[2m[unordered-containers] [m        model:                             OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unionWith
[2m[unordered-containers] [m        model:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unionWithKey
[2m[unordered-containers] [m        model:                             OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unions
[2m[unordered-containers] [m        model:                             OK (1.65s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.70s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      difference
[2m[unordered-containers] [m        model:                             OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      differenceWith
[2m[unordered-containers] [m        model:                             OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersection
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersectionWith
[2m[unordered-containers] [m        model:                             OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersectionWithKey
[2m[unordered-containers] [m        model:                             OK (0.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      compose
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      map
[2m[unordered-containers] [m        model:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      traverseWithKey
[2m[unordered-containers] [m        model:                             OK (0.17s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapKeys
[2m[unordered-containers] [m        model:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.71s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr:                               OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl:                               OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey:                        OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey:                        OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey':                       OK (0.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey':                       OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl':                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr':                              OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldMapWithKey:                      OK (0.08s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filter
[2m[unordered-containers] [m        model:                             OK (0.12s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filterWithKey
[2m[unordered-containers] [m        model:                             OK (1.76s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (1.34s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybe
[2m[unordered-containers] [m        model:                             OK (0.28s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybeWithKey
[2m[unordered-containers] [m        model:                             OK (1.83s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (1.21s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      elems:                               OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      keys:                                OK (0.07s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromList
[2m[unordered-containers] [m        model:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWith
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWithKey
[2m[unordered-containers] [m        model:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      toList:                              OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m    Data.HashMap.Strict
[2m[unordered-containers] [m      instances
[2m[unordered-containers] [m        Eq
[2m[unordered-containers] [m          ==:                              OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          /=:                              OK (0.08s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Ord
[2m[unordered-containers] [m          compare reflexive:               OK (0.06s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare transitive:              OK (0.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare antisymmetric:           OK (0.02s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          Ord => Eq:                       OK (0.02s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Read/Show:                         OK (0.66s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Functor:                           OK (0.24s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Foldable:                          OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Bifoldable
[2m[unordered-containers] [m          bifoldMap:                       OK (0.01s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          bifoldr:                         OK (0.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          bifoldl:                         OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Hashable:                          OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      empty
[2m[unordered-containers] [m        valid:                             OK
[2m[unordered-containers] [m          +++ OK, passed 1 test.
[2m[unordered-containers] [m      singleton
[2m[unordered-containers] [m        valid:                             OK
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      size:                                OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member:                              OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      lookup:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      !?:                                  OK (0.08s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert
[2m[unordered-containers] [m        model:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.08s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insertWith
[2m[unordered-containers] [m        insertWith:                        OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      delete
[2m[unordered-containers] [m        model:                             OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      adjust
[2m[unordered-containers] [m        model:                             OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      update
[2m[unordered-containers] [m        model:                             OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      alter
[2m[unordered-containers] [m        model:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      alterF
[2m[unordered-containers] [m        model
[2m[unordered-containers] [m          []:                              OK (0.23s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          adjust:                          OK (0.04s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insert:                          OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insertWith:                      OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          delete:                          OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          lookup:                          OK (0.02s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      isSubmapOf
[2m[unordered-containers] [m        model:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m ⊆ m:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ⊆ m1 ∪ m2:                      OK (0.16s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ⊈ m2  ⇒  m1 ∪ m2 ⊈ m1:          OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 13 discarded.
[2m[unordered-containers] [m        m1\m2 ⊆ m1:                        OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 166 discarded.
[2m[unordered-containers] [m        delete k m ⊆ m:                    OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 20 discarded.
[2m[unordered-containers] [m        m ⊈ delete k m :                   OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 12 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  m ⊆ insert k v m:        OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 10 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  insert k v m ⊈ m:        OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 5 discarded.
[2m[unordered-containers] [m      union
[2m[unordered-containers] [m        model:                             OK (0.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unionWith
[2m[unordered-containers] [m        model:                             OK (0.15s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.08s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unionWithKey
[2m[unordered-containers] [m        model:                             OK (0.15s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unions
[2m[unordered-containers] [m        model:                             OK (1.40s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.84s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      difference
[2m[unordered-containers] [m        model:                             OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      differenceWith
[2m[unordered-containers] [m        model:                             OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersection
[2m[unordered-containers] [m        model:                             OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersectionWith
[2m[unordered-containers] [m        model:                             OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersectionWithKey
[2m[unordered-containers] [m        model:                             OK (0.19s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      compose
[2m[unordered-containers] [m        valid:                             OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      map
[2m[unordered-containers] [m        model:                             OK (0.17s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      traverseWithKey
[2m[unordered-containers] [m        model:                             OK (0.29s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapKeys
[2m[unordered-containers] [m        model:                             OK
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.65s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr:                               OK (0.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl:                               OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey:                        OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey:                        OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey':                       OK (0.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey':                       OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl':                              OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr':                              OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldMapWithKey:                      OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filter
[2m[unordered-containers] [m        model:                             OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filterWithKey
[2m[unordered-containers] [m        model:                             OK (1.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.86s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybe
[2m[unordered-containers] [m        model:                             OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybeWithKey
[2m[unordered-containers] [m        model:                             OK (1.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.80s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      elems:                               OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      keys:                                OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromList
[2m[unordered-containers] [m        model:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWith
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWithKey
[2m[unordered-containers] [m        model:                             OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      toList:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m    Data.HashSet
[2m[unordered-containers] [m      instances
[2m[unordered-containers] [m        Eq
[2m[unordered-containers] [m          ==:                              OK (0.02s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          == permutations:                 OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          /=:                              OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Ord
[2m[unordered-containers] [m          compare reflexive:               OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare transitive:              OK (0.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare antisymmetric:           OK (0.03s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          Ord => Eq:                       OK (0.08s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Read/Show:                         OK (0.38s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Foldable:                          OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Hashable:                          OK (0.09s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      size:                                OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert:                              OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      delete:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      union:                               OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      map:                                 OK (0.69s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr:                               OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl':                              OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filter:                              OK (0.69s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      toList:                              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m    Data.HashMap.Internal.List
[2m[unordered-containers] [m      isPermutationBy:                     OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      isPermutationBy of different length: OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests; 15 discarded.
[2m[unordered-containers] [m      pUnorderedCompare:                   OK (0.07s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      modelUnorderedCompare
[2m[unordered-containers] [m        reflexive:                         OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        anti-symmetric:                    OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        transitive:                        OK (0.04s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m  Regression tests
[2m[unordered-containers] [m    issue32:                               OK
[2m[unordered-containers] [m    issue39a:                              OK
[2m[unordered-containers] [m    issue39b:                              OK (0.01s)
[2m[unordered-containers] [m      +++ OK, passed 100 tests.
[2m[unordered-containers] [m    issue254 lazy:                         OK (0.05s)
[2m[unordered-containers] [m    issue254 strict:                       OK
[2m[unordered-containers] [m    issue379
[2m[unordered-containers] [m      Lazy.unionWith:                      OK
[2m[unordered-containers] [m      union:                               OK
[2m[unordered-containers] [m      Strict.unionWith:                    OK
[2m[unordered-containers] [m      Strict.unionWithKey:                 OK
[2m[unordered-containers] [m    issue381
[2m[unordered-containers] [m      mapMaybe:                            OK
[2m[unordered-containers] [m      mapMaybeWithKey:                     OK
[2m[unordered-containers] [m    issue382:                              OK
[2m[unordered-containers] [m    issue383:                              OK (0.03s)
[2m[unordered-containers] [m    issue420:                              OK
[2m[unordered-containers] [m  Strictness
[2m[unordered-containers] [m    HashMap.Strict
[2m[unordered-containers] [m      singleton is key-strict:             OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      singleton is value-strict:           OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member is key-strict:                OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      lookup is key-strict:                OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      lookupDefault is key-strict:         OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      findWithDefault is key-strict:       OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      ! is key-strict:                     OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      delete is key-strict:                OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      adjust is key-strict:                OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      adjust is value-strict:              OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert is key-strict:                OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert is value-strict:              OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insertWith is key-strict:            OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insertWith is value-strict:          OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromList is key-strict:              OK
[2m[unordered-containers] [m        +++ OK, passed 1 test.
[2m[unordered-containers] [m      fromList is value-strict:            OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWith is key-strict:          OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWith is value-strict:        OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m
[2m[unordered-containers] [mAll 256 tests passed (2.19s)
[2m[unordered-containers] [mTest suite unordered-containers-tests: PASS
[2m[unordered-containers] [mTest suite logged to:
[2m[unordered-containers] [mdist/test/unordered-containers-0.2.20-unordered-containers-tests.log
[2m[unordered-containers] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[unordered-containers] [m[1;36mPhase: haddockPhase[m
[2m[unordered-containers] [mPreprocessing library for unordered-containers-0.2.20..
[2m[unordered-containers] [mRunning Haddock on library for unordered-containers-0.2.20..
[2m[unordered-containers] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-53692[0m[0m[;1m] [[;1m[35m-Wdeprecated-flags[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m12 |[0m[0m {-# LANGUAGE [;1m[35mTypeInType[0m[0m            #-}
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m              ^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
[2m[unordered-containers] [m
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-66111[0m[0m[;1m] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    The import of ‘Control.Applicative’ is redundant
[2m[unordered-containers] [m      except perhaps to import instances from ‘Control.Applicative’
[2m[unordered-containers] [m    To import instances alone, use: import Control.Applicative()[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m83 |[0m[0m [;1m[35mimport Control.Applicative (liftA2)[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m[2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
[2m[unordered-containers] [m[3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
[2m[unordered-containers] [m[4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
[2m[unordered-containers] [m[5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
[2m[unordered-containers] [m[6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
[2m[unordered-containers] [m[7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, nothing )
[2m[unordered-containers] [m[8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
[2m[unordered-containers] [m[9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
[2m[unordered-containers] [mHaddock coverage:
[2m[unordered-containers] [m  33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
[2m[unordered-containers] [m  Missing documentation for:
[2m[unordered-containers] [m    Array (Data/HashMap/Internal/Array.hs:125)
[2m[unordered-containers] [m    MArray (Data/HashMap/Internal/Array.hs:157)
[2m[unordered-containers] [m    new_ (Data/HashMap/Internal/Array.hs:208)
[2m[unordered-containers] [m    singleton (Data/HashMap/Internal/Array.hs:225)
[2m[unordered-containers] [m    singletonM (Data/HashMap/Internal/Array.hs:229)
[2m[unordered-containers] [m    snoc (Data/HashMap/Internal/Array.hs:233)
[2m[unordered-containers] [m    pair (Data/HashMap/Internal/Array.hs:242)
[2m[unordered-containers] [m    length (Data/HashMap/Internal/Array.hs:154)
[2m[unordered-containers] [m    lengthM (Data/HashMap/Internal/Array.hs:162)
[2m[unordered-containers] [m    read (Data/HashMap/Internal/Array.hs:249)
[2m[unordered-containers] [m    write (Data/HashMap/Internal/Array.hs:255)
[2m[unordered-containers] [m    index (Data/HashMap/Internal/Array.hs:262)
[2m[unordered-containers] [m    indexM (Data/HashMap/Internal/Array.hs:274)
[2m[unordered-containers] [m    index# (Data/HashMap/Internal/Array.hs:268)
[2m[unordered-containers] [m    sameArray1 (Data/HashMap/Internal/Array.hs:140)
[2m[unordered-containers] [m    unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
[2m[unordered-containers] [m    unsafeThaw (Data/HashMap/Internal/Array.hs:286)
[2m[unordered-containers] [m    unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
[2m[unordered-containers] [m    run (Data/HashMap/Internal/Array.hs:292)
[2m[unordered-containers] [m    cloneM (Data/HashMap/Internal/Array.hs:314)
[2m[unordered-containers] [m    foldl (Data/HashMap/Internal/Array.hs:404)
[2m[unordered-containers] [m    foldl' (Data/HashMap/Internal/Array.hs:375)
[2m[unordered-containers] [m    foldr (Data/HashMap/Internal/Array.hs:394)
[2m[unordered-containers] [m    foldr' (Data/HashMap/Internal/Array.hs:385)
[2m[unordered-containers] [m    foldMap (Data/HashMap/Internal/Array.hs:417)
[2m[unordered-containers] [m    thaw (Data/HashMap/Internal/Array.hs:436)
[2m[unordered-containers] [m    map (Data/HashMap/Internal/Array.hs:461)
[2m[unordered-containers] [m    traverse (Data/HashMap/Internal/Array.hs:537)
[2m[unordered-containers] [m    traverse' (Data/HashMap/Internal/Array.hs:553)
[2m[unordered-containers] [m    toList (Data/HashMap/Internal/Array.hs:529)
[2m[unordered-containers] [m    fromList (Data/HashMap/Internal/Array.hs:494)
[2m[unordered-containers] [m    fromList' (Data/HashMap/Internal/Array.hs:506)
[2m[unordered-containers] [m  25% (  1 /  4) in 'Data.HashMap.Internal.List'
[2m[unordered-containers] [m  Missing documentation for:
[2m[unordered-containers] [m    isPermutationBy (Data/HashMap/Internal/List.hs:40)
[2m[unordered-containers] [m    deleteBy (Data/HashMap/Internal/List.hs:83)
[2m[unordered-containers] [m    unorderedCompare (Data/HashMap/Internal/List.hs:68)
[2m[unordered-containers] [mWarning: 'hash' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘Data.Hashable.Class’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:183:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal.hs:183:1
[2m[unordered-containers] [mWarning: 'Leaf' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:225:7
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:185:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
[2m[unordered-containers] [mWarning: 'lookup' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘GHC.List’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:632:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
[2m[unordered-containers] [mWarning: 'update' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1289:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Array.hs:341:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal/Array.hs:341:1
[2m[unordered-containers] [mWarning: 'at' is out of scope.
[2m[unordered-containers] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[unordered-containers] [mWarning: '!?' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘GHC.List’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:741:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal.hs:741:1
[2m[unordered-containers] [mWarning: 'index' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:2460:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Array.hs:262:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal/Array.hs:262:1
[2m[unordered-containers] [mWarning: 'union' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘Data.OldList’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1586:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal.hs:1586:1
[2m[unordered-containers] [m  88% ( 93 /105) in 'Data.HashMap.Internal'
[2m[unordered-containers] [m  Missing documentation for:
[2m[unordered-containers] [m    Leaf (Data/HashMap/Internal.hs:185)
[2m[unordered-containers] [m    intersectionWithKey# (Data/HashMap/Internal.hs:1855)
[2m[unordered-containers] [m    updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
[2m[unordered-containers] [m    equalKeys (Data/HashMap/Internal.hs:511)
[2m[unordered-containers] [m    equalKeys1 (Data/HashMap/Internal.hs:495)
[2m[unordered-containers] [m    lookupRecordCollision (Data/HashMap/Internal.hs:678)
[2m[unordered-containers] [m    LookupRes (Data/HashMap/Internal.hs:657)
[2m[unordered-containers] [m    lookupResToMaybe (Data/HashMap/Internal.hs:660)
[2m[unordered-containers] [m    insert' (Data/HashMap/Internal.hs:806)
[2m[unordered-containers] [m    delete' (Data/HashMap/Internal.hs:1124)
[2m[unordered-containers] [m    insertNewKey (Data/HashMap/Internal.hs:848)
[2m[unordered-containers] [m    insertKeyExists (Data/HashMap/Internal.hs:883)
[2m[unordered-containers] [m  50% (  3 /  6) in 'Data.HashMap.Internal.Debug'
[2m[unordered-containers] [m  Missing documentation for:
[2m[unordered-containers] [m    valid (Data/HashMap/Internal/Debug.hs:98)
[2m[unordered-containers] [m    Validity (Data/HashMap/Internal/Debug.hs:43)
[2m[unordered-containers] [m    SubHashPath (Data/HashMap/Internal/Debug.hs:75)
[2m[unordered-containers] [mWarning: 'update' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1289:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Array.hs:341:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Strict.hs:296:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:296:1
[2m[unordered-containers] [mWarning: 'alter' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1302:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Strict.hs:308:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:308:1
[2m[unordered-containers] [mWarning: 'lookup' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘GHC.List’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:632:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
[2m[unordered-containers] [mWarning: 'alterF' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1333:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Strict.hs:339:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:339:1
[2m[unordered-containers] [mWarning: 'at' is out of scope.
[2m[unordered-containers] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[unordered-containers] [mWarning: 'map' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘GHC.Base’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1767:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Array.hs:461:1
[2m[unordered-containers] [m    * at Data/HashMap/Internal/Strict.hs:557:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:557:1
[2m[unordered-containers] [m 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
[2m[unordered-containers] [mWarning: 'HashSet' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashSet/Internal.hs:112:21
[2m[unordered-containers] [m    * at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [mWarning: 'empty' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:594:1
[2m[unordered-containers] [m    * at Data/HashSet/Internal.hs:255:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashSet/Internal.hs:255:1
[2m[unordered-containers] [mWarning: 'union' is ambiguous. It is defined
[2m[unordered-containers] [m    * in ‘Data.OldList’
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:1586:1
[2m[unordered-containers] [m    * at Data/HashSet/Internal.hs:310:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashSet/Internal.hs:310:1
[2m[unordered-containers] [m 100% ( 35 / 35) in 'Data.HashSet.Internal'
[2m[unordered-containers] [mWarning: 'HashSet' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashSet/Internal.hs:112:21
[2m[unordered-containers] [m    * at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[unordered-containers] [m    by specifying the type/value namespace explicitly.
[2m[unordered-containers] [m    Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
[2m[unordered-containers] [m 100% ( 32 / 32) in 'Data.HashSet'
[2m[unordered-containers] [m 100% ( 69 / 69) in 'Data.HashMap.Strict'
[2m[unordered-containers] [m 100% ( 69 / 69) in 'Data.HashMap.Lazy'
[2m[unordered-containers] [mWarning: Data.HashMap.Internal: could not find link destinations for: 
[2m[unordered-containers] [m	- Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mWarning: Data.HashMap.Internal.Strict: could not find link destinations for: 
[2m[unordered-containers] [m	- Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mWarning: Data.HashSet.Internal: could not find link destinations for: 
[2m[unordered-containers] [m	- Data.HashSet.Internal.D:R:ItemHashSet
[2m[unordered-containers] [mWarning: Data.HashSet: could not find link destinations for: 
[2m[unordered-containers] [m	- Data.HashSet.Internal.D:R:ItemHashSet
[2m[unordered-containers] [mWarning: Data.HashMap.Strict: could not find link destinations for: 
[2m[unordered-containers] [m	- Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mWarning: Data.HashMap.Lazy: could not find link destinations for: 
[2m[unordered-containers] [m	- Data.HashMap.Internal.D:R:ItemHashMap
[2m[unordered-containers] [mDocumentation created: dist/doc/html/unordered-containers/,
[2m[unordered-containers] [mdist/doc/html/unordered-containers/unordered-containers.txt
[2m[unordered-containers] [mPreprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
[2m[unordered-containers] [m[1;36mPhase: installPhase[m
[2m[unordered-containers] [mInstalling library in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[unordered-containers] [m[1;36mPhase: fixupPhase[m
[2m[unordered-containers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
[2m[unordered-containers] [mshrinking /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSunordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq-ghc9.8.1.so
[2m[unordered-containers] [mchecking for references to /build/ in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20...
[2m[unordered-containers] [mpatching script interpreter paths in /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20
[2m[unordered-containers] [mstripping (with command strip and flags -S -p) in  /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20/lib
[2m[unordered-containers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc
[2m[unordered-containers] [mchecking for references to /build/ in /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc...
[2m[unordered-containers] [mpatching script interpreter paths in /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc
[2m[unordered-containers:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20[m
[2m[unordered-containers:post-build] [m[2mPushing 2 paths (70 are already present) using zstd to cache sellout ⏳[m
[2m[unordered-containers:post-build] [m[2m[m
[2m[unordered-containers:post-build] [m[2mPushing /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20 (9.28 MiB)[m
[2m[unordered-containers:post-build] [m[2mPushing /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc (4.50 MiB)[m
[2m[unordered-containers:post-build] [m[2m[m
[2m[unordered-containers:post-build] [m[2mAll done.[m
[2m[unordered-containers:post-build] [m[2mUploading to the NixCI cache: /nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc /nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20[m
[2m[unordered-containers:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[unordered-containers:post-build] [m[2mcopying 2 paths...[m
[2m[unordered-containers:post-build] [m[2mcopying path '/nix/store/mw2rji63r6qs0h1bkaayfbmaw2a14xi4-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...[m
[2m[unordered-containers:post-build] [m[2mcopying path '/nix/store/qnrzn26jsb4nffqnan7rrqy8dzx0klvh-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...[m
[2m[unordered-containers:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[unordered-containers:post-build] [m[2mcopying 1 paths...[m
[2m[unordered-containers:post-build] [m[2mcopying path '/nix/store/sl4dwg6r5dr8h3npvwjsv9kdvg0gwxn6-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 38 of 46 built[m
[1;34mBuilding /nix/store/zb93y8x0dvbjy13nrbg8syz8g82r2xaw-quickcheck-instances-0.3.32.drv[m
[2m[quickcheck-instances] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[quickcheck-instances] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[quickcheck-instances] [m[1;36mPhase: unpackPhase[m
[2m[quickcheck-instances] [munpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
[2m[quickcheck-instances] [msource root is quickcheck-instances-0.3.32
[2m[quickcheck-instances] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
[2m[quickcheck-instances] [m[1;36mPhase: patchPhase[m
[2m[quickcheck-instances] [mReplace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
[2m[quickcheck-instances] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[quickcheck-instances] [msetupCompileFlags: -package-db=/build/tmp.DEOi1JRYCP/setup-package.conf.d -threaded
[2m[quickcheck-instances] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.DEOi1JRYCP/Main.o )
[2m[quickcheck-instances] [m[2 of 2] Linking Setup
[2m[quickcheck-instances] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[quickcheck-instances] [m[1;36mPhase: configurePhase[m
[2m[quickcheck-instances] [mconfigureFlags: --verbose --prefix=/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.DEOi1JRYCP/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[quickcheck-instances] [mUsing Parsec parser
[2m[quickcheck-instances] [mConfiguring quickcheck-instances-0.3.32...
[2m[quickcheck-instances] [mDependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
[2m[quickcheck-instances] [mDependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
[2m[quickcheck-instances] [mDependency array >=0.5.3.0 && <0.6: using array-0.5.6.0
[2m[quickcheck-instances] [mDependency base >=4.12.0.0 && <4.22: using base-4.19.0.0
[2m[quickcheck-instances] [mDependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
[2m[quickcheck-instances] [mDependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
[2m[quickcheck-instances] [mDependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
[2m[quickcheck-instances] [mDependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
[2m[quickcheck-instances] [mDependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
[2m[quickcheck-instances] [mDependency integer-logarithms >=1.0.3.1 && <1.1: using
[2m[quickcheck-instances] [minteger-logarithms-1.0.4
[2m[quickcheck-instances] [mDependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
[2m[quickcheck-instances] [mDependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
[2m[quickcheck-instances] [mDependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
[2m[quickcheck-instances] [mDependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
[2m[quickcheck-instances] [mDependency strict >=0.5 && <0.6: using strict-0.5.1
[2m[quickcheck-instances] [mDependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
[2m[quickcheck-instances] [mDependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
[2m[quickcheck-instances] [mDependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
[2m[quickcheck-instances] [mDependency these >=1.2.1 && <1.3: using these-1.2.1
[2m[quickcheck-instances] [mDependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
[2m[quickcheck-instances] [mDependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
[2m[quickcheck-instances] [mDependency unordered-containers >=0.2.20 && <0.3: using
[2m[quickcheck-instances] [munordered-containers-0.2.20
[2m[quickcheck-instances] [mDependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
[2m[quickcheck-instances] [mDependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
[2m[quickcheck-instances] [mDependency QuickCheck: using QuickCheck-2.14.3
[2m[quickcheck-instances] [mDependency base: using base-4.19.0.0
[2m[quickcheck-instances] [mDependency containers: using containers-0.6.8
[2m[quickcheck-instances] [mDependency primitive: using primitive-0.9.1.0
[2m[quickcheck-instances] [mDependency quickcheck-instances: using quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mDependency tagged: using tagged-0.8.8
[2m[quickcheck-instances] [mDependency uuid-types: using uuid-types-1.0.6
[2m[quickcheck-instances] [mSource component graph:
[2m[quickcheck-instances] [m    component lib
[2m[quickcheck-instances] [m    component test:self-test dependency lib
[2m[quickcheck-instances] [mConfigured component graph:
[2m[quickcheck-instances] [m    component quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m        include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
[2m[quickcheck-instances] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[quickcheck-instances] [m        include array-0.5.6.0-dc89
[2m[quickcheck-instances] [m        include base-4.19.0.0-b960
[2m[quickcheck-instances] [m        include bytestring-0.12.0.2-4690
[2m[quickcheck-instances] [m        include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
[2m[quickcheck-instances] [m        include containers-0.6.8-4775
[2m[quickcheck-instances] [m        include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
[2m[quickcheck-instances] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[quickcheck-instances] [m        include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[quickcheck-instances] [m        include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[quickcheck-instances] [m        include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[quickcheck-instances] [m        include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
[2m[quickcheck-instances] [m        include strict-0.5.1-GVSVdbGTOCS56r31yJq782
[2m[quickcheck-instances] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[quickcheck-instances] [m        include text-2.1-c36a
[2m[quickcheck-instances] [m        include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
[2m[quickcheck-instances] [m        include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
[2m[quickcheck-instances] [m        include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
[2m[quickcheck-instances] [m        include transformers-0.6.1.0-c3ec
[2m[quickcheck-instances] [m        include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
[2m[quickcheck-instances] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[quickcheck-instances] [m    component quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
[2m[quickcheck-instances] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[quickcheck-instances] [m        include base-4.19.0.0-b960
[2m[quickcheck-instances] [m        include containers-0.6.8-4775
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[quickcheck-instances] [m        include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
[2m[quickcheck-instances] [mLinked component graph:
[2m[quickcheck-instances] [m    unit quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m        include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
[2m[quickcheck-instances] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[quickcheck-instances] [m        include array-0.5.6.0-dc89
[2m[quickcheck-instances] [m        include base-4.19.0.0-b960
[2m[quickcheck-instances] [m        include bytestring-0.12.0.2-4690
[2m[quickcheck-instances] [m        include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
[2m[quickcheck-instances] [m        include containers-0.6.8-4775
[2m[quickcheck-instances] [m        include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
[2m[quickcheck-instances] [m        include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[quickcheck-instances] [m        include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[quickcheck-instances] [m        include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[quickcheck-instances] [m        include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[quickcheck-instances] [m        include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
[2m[quickcheck-instances] [m        include strict-0.5.1-GVSVdbGTOCS56r31yJq782
[2m[quickcheck-instances] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[quickcheck-instances] [m        include text-2.1-c36a
[2m[quickcheck-instances] [m        include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
[2m[quickcheck-instances] [m        include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
[2m[quickcheck-instances] [m        include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
[2m[quickcheck-instances] [m        include transformers-0.6.1.0-c3ec
[2m[quickcheck-instances] [m        include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
[2m[quickcheck-instances] [m        include vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[quickcheck-instances] [m        Test.QuickCheck.Instances=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Void
[2m[quickcheck-instances] [m    unit quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
[2m[quickcheck-instances] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[quickcheck-instances] [m        include base-4.19.0.0-b960
[2m[quickcheck-instances] [m        include containers-0.6.8-4775
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[quickcheck-instances] [m        include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m        include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
[2m[quickcheck-instances] [mReady component graph:
[2m[quickcheck-instances] [m    definite quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m        depends OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
[2m[quickcheck-instances] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[quickcheck-instances] [m        depends array-0.5.6.0-dc89
[2m[quickcheck-instances] [m        depends base-4.19.0.0-b960
[2m[quickcheck-instances] [m        depends bytestring-0.12.0.2-4690
[2m[quickcheck-instances] [m        depends case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
[2m[quickcheck-instances] [m        depends containers-0.6.8-4775
[2m[quickcheck-instances] [m        depends data-fix-0.3.4-90kAYHfhdX433d7z3npPya
[2m[quickcheck-instances] [m        depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
[2m[quickcheck-instances] [m        depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
[2m[quickcheck-instances] [m        depends old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
[2m[quickcheck-instances] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[quickcheck-instances] [m        depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
[2m[quickcheck-instances] [m        depends splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
[2m[quickcheck-instances] [m        depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
[2m[quickcheck-instances] [m        depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[quickcheck-instances] [m        depends text-2.1-c36a
[2m[quickcheck-instances] [m        depends text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
[2m[quickcheck-instances] [m        depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
[2m[quickcheck-instances] [m        depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
[2m[quickcheck-instances] [m        depends transformers-0.6.1.0-c3ec
[2m[quickcheck-instances] [m        depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
[2m[quickcheck-instances] [m        depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
[2m[quickcheck-instances] [m        depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
[2m[quickcheck-instances] [m    definite quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
[2m[quickcheck-instances] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[quickcheck-instances] [m        depends base-4.19.0.0-b960
[2m[quickcheck-instances] [m        depends containers-0.6.8-4775
[2m[quickcheck-instances] [m        depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
[2m[quickcheck-instances] [m        depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m        depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
[2m[quickcheck-instances] [m        depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
[2m[quickcheck-instances] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[quickcheck-instances] [mUsing compiler: ghc-9.8.1
[2m[quickcheck-instances] [mUsing install prefix:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mExecutables installed in:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/bin
[2m[quickcheck-instances] [mLibraries installed in:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [mDynamic Libraries installed in:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[quickcheck-instances] [mPrivate executables installed in:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mData files installed in:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mDocumentation installed in:
[2m[quickcheck-instances] [m/nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mConfiguration files installed in:
[2m[quickcheck-instances] [m/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/etc
[2m[quickcheck-instances] [mNo alex found
[2m[quickcheck-instances] [mUsing ar found on system at:
[2m[quickcheck-instances] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[quickcheck-instances] [mNo c2hs found
[2m[quickcheck-instances] [mNo cpphs found
[2m[quickcheck-instances] [mNo doctest found
[2m[quickcheck-instances] [mUsing gcc version 14.3.0 given by user at:
[2m[quickcheck-instances] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[quickcheck-instances] [mUsing ghc version 9.8.1 found on system at:
[2m[quickcheck-instances] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[quickcheck-instances] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[quickcheck-instances] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[quickcheck-instances] [mNo ghcjs found
[2m[quickcheck-instances] [mNo ghcjs-pkg found
[2m[quickcheck-instances] [mNo greencard found
[2m[quickcheck-instances] [mUsing haddock version 2.30.0 found on system at:
[2m[quickcheck-instances] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[quickcheck-instances] [mNo happy found
[2m[quickcheck-instances] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[quickcheck-instances] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[quickcheck-instances] [mNo hmake found
[2m[quickcheck-instances] [mUsing hpc version 0.69 found on system at:
[2m[quickcheck-instances] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[quickcheck-instances] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[quickcheck-instances] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[quickcheck-instances] [mUsing hscolour version 1.25 found on system at:
[2m[quickcheck-instances] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[quickcheck-instances] [mNo jhc found
[2m[quickcheck-instances] [mUsing ld found on system at:
[2m[quickcheck-instances] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[quickcheck-instances] [mNo pkg-config found
[2m[quickcheck-instances] [mUsing runghc version 9.8.1 found on system at:
[2m[quickcheck-instances] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[quickcheck-instances] [mUsing strip version 2.44 found on system at:
[2m[quickcheck-instances] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[quickcheck-instances] [mUsing tar found on system at:
[2m[quickcheck-instances] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[quickcheck-instances] [mNo uhc found
[2m[quickcheck-instances] [m[1;36mPhase: buildPhase[m
[2m[quickcheck-instances] [mPreprocessing library for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [mBuilding library for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[ 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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
[2m[quickcheck-instances] [m[ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
[2m[quickcheck-instances] [m[ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
[2m[quickcheck-instances] [m[ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
[2m[quickcheck-instances] [m[ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
[2m[quickcheck-instances] [m[ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
[2m[quickcheck-instances] [m[ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
[2m[quickcheck-instances] [m[ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
[2m[quickcheck-instances] [m[ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
[2m[quickcheck-instances] [m[10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
[2m[quickcheck-instances] [m[13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
[2m[quickcheck-instances] [m[14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
[2m[quickcheck-instances] [m[15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
[2m[quickcheck-instances] [m[16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
[2m[quickcheck-instances] [m[17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
[2m[quickcheck-instances] [m[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 )
[2m[quickcheck-instances] [m[19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
[2m[quickcheck-instances] [m[20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
[2m[quickcheck-instances] [m[21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
[2m[quickcheck-instances] [m[22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
[2m[quickcheck-instances] [m[23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
[2m[quickcheck-instances] [m[24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
[2m[quickcheck-instances] [m[25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
[2m[quickcheck-instances] [m[26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
[2m[quickcheck-instances] [mPreprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [mBuilding test suite 'self-test' for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [m[1 of 1] Compiling Main             ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
[2m[quickcheck-instances] [m[2 of 2] Linking dist/build/self-test/self-test
[2m[quickcheck-instances] [m[1;36mPhase: checkPhase[m
[2m[quickcheck-instances] [mRunning 1 test suites...
[2m[quickcheck-instances] [mTest suite self-test: RUNNING...
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [m+++ OK, passed 100 tests.
[2m[quickcheck-instances] [mTest suite self-test: PASS
[2m[quickcheck-instances] [mTest suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
[2m[quickcheck-instances] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[quickcheck-instances] [m[1;36mPhase: haddockPhase[m
[2m[quickcheck-instances] [mPreprocessing library for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [mRunning Haddock on library for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [mWarning: The documentation for the following packages are not installed. No
[2m[quickcheck-instances] [mlinks will be generated to these packages: vector-0.13.2.0
[2m[quickcheck-instances] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[quickcheck-instances] [m[ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
[2m[quickcheck-instances] [m[ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
[2m[quickcheck-instances] [m[ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
[2m[quickcheck-instances] [m[ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
[2m[quickcheck-instances] [m[ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
[2m[quickcheck-instances] [m[ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
[2m[quickcheck-instances] [m[ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
[2m[quickcheck-instances] [m[ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
[2m[quickcheck-instances] [m[ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
[2m[quickcheck-instances] [m[10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
[2m[quickcheck-instances] [m[11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
[2m[quickcheck-instances] [m[12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
[2m[quickcheck-instances] [m[13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
[2m[quickcheck-instances] [m[14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
[2m[quickcheck-instances] [m[15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
[2m[quickcheck-instances] [m[16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
[2m[quickcheck-instances] [m[17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
[2m[quickcheck-instances] [m[18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
[2m[quickcheck-instances] [m[19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
[2m[quickcheck-instances] [m[20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
[2m[quickcheck-instances] [m[21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
[2m[quickcheck-instances] [m[22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
[2m[quickcheck-instances] [m[23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
[2m[quickcheck-instances] [m[24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
[2m[quickcheck-instances] [m[25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
[2m[quickcheck-instances] [m[26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
[2m[quickcheck-instances] [mHaddock coverage:
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Containers'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.CaseInsensitive'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.ByteString'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Array'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.DataFix'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Hashable'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Natural'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.OldTime'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Primitive'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Array.Byte'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Scientific'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Semigroup'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Solo'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Strict'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Tagged'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Text'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Text.Short'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.These'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Time'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Transformer'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.UUID'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.UnorderedContainers'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Vector'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m   0% (  0 /  1) in 'Test.QuickCheck.Instances.Void'
[2m[quickcheck-instances] [m  Missing documentation for:
[2m[quickcheck-instances] [m    Module header
[2m[quickcheck-instances] [m 100% (  1 /  1) in 'Test.QuickCheck.Instances'
[2m[quickcheck-instances] [mWarning: Test.QuickCheck.Instances.Vector: could not find link destinations for: 
[2m[quickcheck-instances] [m	- Data.Vector.Vector
[2m[quickcheck-instances] [m	- Data.Vector.Primitive.Vector
[2m[quickcheck-instances] [m	- Data.Vector.Storable.Vector
[2m[quickcheck-instances] [m	- Data.Vector.Unboxed.Base.Unbox
[2m[quickcheck-instances] [m	- Data.Vector.Unboxed.Base.Vector
[2m[quickcheck-instances] [mDocumentation created: dist/doc/html/quickcheck-instances/,
[2m[quickcheck-instances] [mdist/doc/html/quickcheck-instances/quickcheck-instances.txt
[2m[quickcheck-instances] [mPreprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
[2m[quickcheck-instances] [m[1;36mPhase: installPhase[m
[2m[quickcheck-instances] [mInstalling library in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[quickcheck-instances] [m[1;36mPhase: fixupPhase[m
[2m[quickcheck-instances] [mshrinking RPATHs of ELF executables and libraries in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mshrinking /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSquickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA-ghc9.8.1.so
[2m[quickcheck-instances] [mchecking for references to /build/ in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32...
[2m[quickcheck-instances] [mpatching script interpreter paths in /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32
[2m[quickcheck-instances] [mstripping (with command strip and flags -S -p) in  /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32/lib
[2m[quickcheck-instances] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc
[2m[quickcheck-instances] [mchecking for references to /build/ in /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc...
[2m[quickcheck-instances] [mpatching script interpreter paths in /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc
[2m[quickcheck-instances:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32[m
[2m[quickcheck-instances:post-build] [m[2mPushing 2 paths (130 are already present) using zstd to cache sellout ⏳[m
[2m[quickcheck-instances:post-build] [m[2m[m
[2m[quickcheck-instances:post-build] [m[2mPushing /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc (1.48 MiB)[m
[2m[quickcheck-instances:post-build] [m[2mPushing /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32 (5.35 MiB)[m
[2m[quickcheck-instances:post-build] [m[2m[m
[2m[quickcheck-instances:post-build] [m[2mAll done.[m
[2m[quickcheck-instances:post-build] [m[2mUploading to the NixCI cache: /nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc /nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32[m
[2m[quickcheck-instances:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[quickcheck-instances:post-build] [m[2mcopying 2 paths...[m
[2m[quickcheck-instances:post-build] [m[2mcopying path '/nix/store/2yzlz1g0kzs79m5vvrb3b8wfw0cqfm9w-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...[m
[2m[quickcheck-instances:post-build] [m[2mcopying path '/nix/store/a55yrknn4qw73i4w3gsxcpq309j2367r-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...[m
[2m[quickcheck-instances:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[quickcheck-instances:post-build] [m[2mcopying 1 paths...[m
[2m[quickcheck-instances:post-build] [m[2mcopying path '/nix/store/zb93y8x0dvbjy13nrbg8syz8g82r2xaw-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 39 of 46 built[m
[1;34mBuilding /nix/store/9p7f127bf99874y0pziszzcc3pkbckn3-extra-1.7.16.drv[m
[2m[extra] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[extra] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[extra] [m[1;36mPhase: unpackPhase[m
[2m[extra] [munpacking source archive /nix/store/zap07ayqyv48lfcxp4yva8sylcvy2knk-extra-1.7.16.tar.gz
[2m[extra] [msource root is extra-1.7.16
[2m[extra] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.7.16/test/TestUtil.hs"
[2m[extra] [m[1;36mPhase: patchPhase[m
[2m[extra] [mReplace Cabal file with edited version from mirror://hackage/extra-1.7.16/revision/1.cabal.
[2m[extra] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[extra] [msetupCompileFlags: -package-db=/build/tmp.9jyZczK3Jh/setup-package.conf.d -threaded
[2m[extra] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.9jyZczK3Jh/Main.o )
[2m[extra] [m[2 of 2] Linking Setup
[2m[extra] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[extra] [m[1;36mPhase: configurePhase[m
[2m[extra] [mconfigureFlags: --verbose --prefix=/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc/share/doc/extra-1.7.16 --with-gcc=gcc --package-db=/build/tmp.9jyZczK3Jh/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
[2m[extra] [mUsing Parsec parser
[2m[extra] [mConfiguring extra-1.7.16...
[2m[extra] [mDependency base >=4.9 && <4.21: using base-4.19.0.0
[2m[extra] [mDependency clock >=0.7: using clock-0.8.4
[2m[extra] [mDependency directory: using directory-1.3.8.1
[2m[extra] [mDependency filepath: using filepath-1.4.100.4
[2m[extra] [mDependency process: using process-1.6.18.0
[2m[extra] [mDependency time: using time-1.12.2
[2m[extra] [mDependency unix: using unix-2.8.3.0
[2m[extra] [mDependency QuickCheck >=2.10: using QuickCheck-2.14.3
[2m[extra] [mDependency base >=4 && <5: using base-4.19.0.0
[2m[extra] [mDependency directory: using directory-1.3.8.1
[2m[extra] [mDependency extra: using extra-1.7.16
[2m[extra] [mDependency filepath: using filepath-1.4.100.4
[2m[extra] [mDependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
[2m[extra] [mDependency unix: using unix-2.8.3.0
[2m[extra] [mSource component graph:
[2m[extra] [m    component lib
[2m[extra] [m    component test:extra-test dependency lib
[2m[extra] [mConfigured component graph:
[2m[extra] [m    component extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m        include base-4.19.0.0-b960
[2m[extra] [m        include clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
[2m[extra] [m        include directory-1.3.8.1-6a8e
[2m[extra] [m        include filepath-1.4.100.4-fa1c
[2m[extra] [m        include process-1.6.18.0-26fa
[2m[extra] [m        include time-1.12.2-d26d
[2m[extra] [m        include unix-2.8.3.0-8aa6
[2m[extra] [m    component extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
[2m[extra] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[extra] [m        include base-4.19.0.0-b960
[2m[extra] [m        include directory-1.3.8.1-6a8e
[2m[extra] [m        include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m        include filepath-1.4.100.4-fa1c
[2m[extra] [m        include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[extra] [m        include unix-2.8.3.0-8aa6
[2m[extra] [mLinked component graph:
[2m[extra] [m    unit extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m        include base-4.19.0.0-b960
[2m[extra] [m        include clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
[2m[extra] [m        include directory-1.3.8.1-6a8e
[2m[extra] [m        include filepath-1.4.100.4-fa1c
[2m[extra] [m        include process-1.6.18.0-26fa
[2m[extra] [m        include time-1.12.2-d26d
[2m[extra] [m        include unix-2.8.3.0-8aa6
[2m[extra] [m        Control.Concurrent.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Exception.Extra,Control.Monad.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Monad.Extra,Data.Either.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Either.Extra,Data.Foldable.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Foldable.Extra,Data.IORef.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.IORef.Extra,Data.List.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Typeable.Extra,Data.Version.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Version.Extra,Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Extra,Numeric.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Numeric.Extra,System.Directory.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Directory.Extra,System.Environment.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Environment.Extra,System.IO.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.IO.Extra,System.Info.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Info.Extra,System.Process.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Process.Extra,System.Time.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Time.Extra,Text.Read.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Text.Read.Extra
[2m[extra] [m    unit extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
[2m[extra] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[extra] [m        include base-4.19.0.0-b960
[2m[extra] [m        include directory-1.3.8.1-6a8e
[2m[extra] [m        include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m        include filepath-1.4.100.4-fa1c
[2m[extra] [m        include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[extra] [m        include unix-2.8.3.0-8aa6
[2m[extra] [mReady component graph:
[2m[extra] [m    definite extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m        depends base-4.19.0.0-b960
[2m[extra] [m        depends clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
[2m[extra] [m        depends directory-1.3.8.1-6a8e
[2m[extra] [m        depends filepath-1.4.100.4-fa1c
[2m[extra] [m        depends process-1.6.18.0-26fa
[2m[extra] [m        depends time-1.12.2-d26d
[2m[extra] [m        depends unix-2.8.3.0-8aa6
[2m[extra] [m    definite extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
[2m[extra] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[extra] [m        depends base-4.19.0.0-b960
[2m[extra] [m        depends directory-1.3.8.1-6a8e
[2m[extra] [m        depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m        depends filepath-1.4.100.4-fa1c
[2m[extra] [m        depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
[2m[extra] [m        depends unix-2.8.3.0-8aa6
[2m[extra] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[extra] [mUsing compiler: ghc-9.8.1
[2m[extra] [mUsing install prefix: /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
[2m[extra] [mExecutables installed in:
[2m[extra] [m/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/bin
[2m[extra] [mLibraries installed in:
[2m[extra] [m/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [mDynamic Libraries installed in:
[2m[extra] [m/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[extra] [mPrivate executables installed in:
[2m[extra] [m/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/libexec/x86_64-linux-ghc-9.8.1/extra-1.7.16
[2m[extra] [mData files installed in:
[2m[extra] [m/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/share/x86_64-linux-ghc-9.8.1/extra-1.7.16
[2m[extra] [mDocumentation installed in:
[2m[extra] [m/nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc/share/doc/extra-1.7.16
[2m[extra] [mConfiguration files installed in:
[2m[extra] [m/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/etc
[2m[extra] [mNo alex found
[2m[extra] [mUsing ar found on system at:
[2m[extra] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[extra] [mNo c2hs found
[2m[extra] [mNo cpphs found
[2m[extra] [mNo doctest found
[2m[extra] [mUsing gcc version 14.3.0 given by user at:
[2m[extra] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[extra] [mUsing ghc version 9.8.1 found on system at:
[2m[extra] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[extra] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[extra] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[extra] [mNo ghcjs found
[2m[extra] [mNo ghcjs-pkg found
[2m[extra] [mNo greencard found
[2m[extra] [mUsing haddock version 2.30.0 found on system at:
[2m[extra] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[extra] [mNo happy found
[2m[extra] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[extra] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[extra] [mNo hmake found
[2m[extra] [mUsing hpc version 0.69 found on system at:
[2m[extra] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[extra] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[extra] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[extra] [mUsing hscolour version 1.25 found on system at:
[2m[extra] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[extra] [mNo jhc found
[2m[extra] [mUsing ld found on system at:
[2m[extra] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[extra] [mNo pkg-config found
[2m[extra] [mUsing runghc version 9.8.1 found on system at:
[2m[extra] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[extra] [mUsing strip version 2.44 found on system at:
[2m[extra] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[extra] [mUsing tar found on system at:
[2m[extra] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[extra] [mNo uhc found
[2m[extra] [m[1;36mPhase: buildPhase[m
[2m[extra] [mPreprocessing library for extra-1.7.16..
[2m[extra] [mBuilding library for extra-1.7.16..
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
[2m[extra] [m[ 6 of 22] Compiling Partial          ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[ 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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[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 )
[2m[extra] [m[21 of 22] Compiling Extra            ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
[2m[extra] [m[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 )
[2m[extra] [m[ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
[2m[extra] [m[ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
[2m[extra] [m[ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
[2m[extra] [m[ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
[2m[extra] [m[ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
[2m[extra] [m[ 6 of 22] Compiling Partial          ( src/Partial.hs, dist/build/Partial.p_o )
[2m[extra] [m[ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
[2m[extra] [m[ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
[2m[extra] [m[ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
[2m[extra] [m[10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
[2m[extra] [m[11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
[2m[extra] [m[12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
[2m[extra] [m[13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
[2m[extra] [m[14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
[2m[extra] [m[15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
[2m[extra] [m[16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
[2m[extra] [m[17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
[2m[extra] [m[18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
[2m[extra] [m[19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
[2m[extra] [m[20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
[2m[extra] [m[21 of 22] Compiling Extra            ( src/Extra.hs, dist/build/Extra.p_o )
[2m[extra] [m[22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
[2m[extra] [mPreprocessing test suite 'extra-test' for extra-1.7.16..
[2m[extra] [mBuilding test suite 'extra-test' for extra-1.7.16..
[2m[extra] [m[1 of 4] Compiling TestUtil         ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
[2m[extra] [m[2 of 4] Compiling TestGen          ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
[2m[extra] [m[3 of 4] Compiling TestCustom       ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
[2m[extra] [m[4 of 4] Compiling Test             ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
[2m[extra] [m[5 of 5] Linking dist/build/extra-test/extra-test
[2m[extra] [m[1;36mPhase: checkPhase[m
[2m[extra] [mRunning 1 test suites...
[2m[extra] [mTest suite extra-test: RUNNING...
[2m[extra] [mwithTempFile
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcaptureOutput
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(x :: IO Int) -> void (once x) == pure ()
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> join (once x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> (do y <- once x; y; y) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> (do y <- once x; y ||| y) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> join (onceFork x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: IO Int) -> (do a <- onceFork x; a; a) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException "test"                           == pure "test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstringException ("test" ++ undefined)            == pure "test<Exception>"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstringException ['t','e','s','t',undefined]      == pure "test<Exception>"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mignore (print 1)    == print 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mignore (fail "die") == pure ()
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcatch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mseq (errorIO "foo") (print 1) == print 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcatch (assertIO True  >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mseq (assertIO False) (print 1) == print 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mretry 1 (print "x")  == print "x"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mretry 3 (fail "die") == fail "die"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwhenJust Nothing  print == pure ()
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwhenJust (Just 1) print == print 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mpureIf @Maybe True  5 == Just 5
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mpureIf @Maybe False 5 == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mpureIf @[]    True  5 == [5]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mpureIf @[]    False 5 == []
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwhenMaybe True  (print 1) == fmap Just (print 1)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwhenMaybe False (print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(x :: Maybe ()) -> unit x == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfold1M (\x y -> Just x) [] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mpartitionM (Just . even) [1,2,3] == Just ([2], [1,3])
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mpartitionM (const Nothing) [1,2,3] == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mloop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mJust True  ||^ undefined  == Just True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mJust False ||^ Just True  == Just True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mJust False ||^ Just False == Just False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mJust False &&^ undefined  == Just False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mJust True  &&^ Just True  == Just True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mJust True  &&^ Just False == Just False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [manyM Just [False,True ,undefined] == Just True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [manyM Just [False,False,undefined] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallM Just [True,False,undefined] == Just False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mallM Just [True,True ,undefined] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [morM [Just False,Just True ,undefined] == Just True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [morM [Just False,Just False,undefined] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> Just (or xs) == orM (map Just xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mandM [Just True,Just False,undefined] == Just False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mandM [Just True,Just True ,undefined] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> Just (and xs) == andM (map Just xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfindM (Just . isUpper) "teST"             == Just (Just 'S')
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfindM (Just . isUpper) "test"             == Just Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfindM (Just . const True) ["x",undefined] == Just (Just "x")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfromLeft 1 (Left 3) == 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfromLeft 1 (Right "foo") == 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfromRight 1 (Right 3) == 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfromRight 1 (Left "foo") == 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\x -> fromLeft' (Left  x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromLeft' (Right x) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromRight' (Right x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromRight' (Left  x) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromEither (Left x ) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> fromEither (Right x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\a b -> maybeToEither a (Just b) == Right b
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\a -> maybeToEither a Nothing == Left a
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> eitherToMaybe (Left x) == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\x -> eitherToMaybe (Right x) == Just x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapLeft show (Left 1) == Left "1"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmapLeft show (Right True) == Right True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmapRight show (Left 1) == Left 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmapRight show (Right True) == Right "True"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> repeatedly (splitAt 3) xs  == chunksOf 3 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> repeatedly word1 (trim xs) == words xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> repeatedly line1 xs == lines xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjoint [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdisjoint [1,2,3] [4,1] == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdisjointOrd [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdisjointOrd [1,2,3] [4,1] == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdisjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdisjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [manySame [1,1,2] == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [manySame [1,2,3] == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [manySame (1:2:1:undefined) == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [manySame [] == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> anySame xs == (length (nub xs) < length xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame [1,1,2] == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mallSame [1,1,1] == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mallSame [1]     == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mallSame []      == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mallSame (1:1:2:undefined) == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> allSame xs == (length (nub xs) <= 1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mheadDef 1 []      == 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mheadDef 1 [2,3,4] == 2
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlastDef 1 []      == 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlastDef 1 [2,3,4] == 4
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\x xs -> lastDef x xs == last (x:xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m[2,3,4] !? 1    == Just 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m[2,3,4] !? (-1) == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m[]      !? 0    == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnotNull []  == False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnotNull [1] == True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> notNull xs == not (null xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlist 1 (\v _ -> v - 2) [5,6,7] == 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlist 1 (\v _ -> v - 2) []      == 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [munsnoc "test" == Just ("tes",'t')
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [munsnoc ""     == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcons 't' "est" == "test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\x xs -> uncons (cons x xs) == Just (x,xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msnoc "tes" 't' == "test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs x -> unsnoc (snoc xs x) == Just (xs,x)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [menumerate == [False, True]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtakeEnd 3 "hello"  == "llo"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtakeEnd 5 "bye"    == "bye"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtakeEnd (-1) "bye" == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\i xs -> takeEnd i xs `isSuffixOf` xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd 3 "hello"  == "he"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropEnd 5 "bye"    == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropEnd (-1) "bye" == "bye"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\i xs -> dropEnd i xs `isPrefixOf` xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitAtEnd 3 "hello" == ("he","llo")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplitAtEnd 3 "he"    == ("", "he")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\i xs -> uncurry (++) (splitAt i xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\i xs -> zip [i..] xs == zipFrom i xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipFrom False [1..3] == [(False,1),(True, 2)]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\i xs -> zipWithFrom (,) i xs == zipFrom i xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mconcatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mconcatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtakeWhileEnd even [2,3,4,6] == [4,6]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtrim      "  hello   " == "hello"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtrimStart "  hello   " == "hello   "
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtrimEnd   "  hello   " == "  hello"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\s -> trim s == trimEnd (trimStart s)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlower "This is A TEST" == "this is a test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlower "" == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mupper "This is A TEST" == "THIS IS A TEST"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mupper "" == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mword1 "" == ("", "")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mword1 "keyword rest of string" == ("keyword","rest of string")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mword1 "  keyword\n  rest of string" == ("keyword","rest of string")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\s -> fst (word1 s) == concat (take 1 $ words s)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> words (snd $ word1 s) == drop 1 (words s)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "" == ("", "")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mline1 "test" == ("test","")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mline1 "test\n" == ("test","")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mline1 "test\nrest" == ("test","rest")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mline1 "test\nrest\nmore" == ("test","rest\nmore")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mescapeHTML "this is a test" == "this is a test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mescapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mescapeHTML "t'was another test" == "t&#39;was another test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> unescapeHTML (escapeHTML xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeJSON "this is a test" == "this is a test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mescapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mescapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> unescapeJSON (escapeJSON xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupOn abs [1,-1,2] == [[1,-1], [2]]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mgroupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmaximumOn id [] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmaximumOn length ["test","extra","a"] == "extra"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mminimumOn id [] == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mminimumOn length ["test","extra","a"] == "a"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mgroupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> map fst (groupSort xs) == sort (nub (map fst xs))
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mgroupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msum' [1, 2, 3] == 6
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msumOn' read ["1", "2", "3"] == 6
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mproduct' [1, 2, 4] == 8
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mproductOn' read ["1", "2", "4"] == 8
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmerge "ace" "bd" == "abcde"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "el" "_" "Hello Bella" == "H_lo B_la"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mreplace "el" "e" "Hello"       == "Helo"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mreplace "" "x" "Hello"         == "xHxexlxlxox"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mreplace "" "x" ""              == "x"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs ys -> replace xs xs ys == ys
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakEnd isLower "youRE" == ("you","RE")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mbreakEnd isLower "youre" == ("youre","")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mbreakEnd isLower "YOURE" == ("","YOURE")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\f xs -> breakEnd (not . f) xs == spanEnd f  xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mspanEnd isUpper "youRE" == ("you","RE")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mspanEnd (not . isSpace) "x y z" == ("x y ","z")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\f xs -> uncurry (++) (spanEnd f xs) == xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\s -> wordsBy isSpace s == words s
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlinesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\s -> linesBy (== '\n') s == lines s
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlinesBy (== ';') "my;list;here;" == ["my","list","here"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfirstJust id [Nothing,Just 3]  == Just 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfirstJust id [Nothing,Nothing] == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdrop1 ""         == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdrop1 "test"     == "est"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> drop 1 xs == drop1 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd1 ""         == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropEnd1 "test"     == "tes"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> dropEnd 1 xs == dropEnd1 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmconcatMap Sum [1,2,3] == Sum 6
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\f xs -> mconcatMap f xs == concatMap f xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakOn "::" "a::b::c" == ("a", "::b::c")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mbreakOn "/" "foobar"   == ("foobar", "")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakOnEnd "::" "a::b::c" == ("a::b::", "c")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplitOn "aaa"  "aaaXaaaXaaaXaaa"  == ["","X","X","X",""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplitOn "x"    "x"                == ["",""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplitOn "x"    ""                 == [""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\s x -> s /= "" ==> intercalate s (splitOn s x) == x
[2m[extra] [m+++ OK, passed 100 tests; 14 discarded.
[2m[extra] [m\c x -> splitOn [c] x                           == split (==c) x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== 'a') "aabbaca" == ["","","bb","c",""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplit (== 'a') ""        == [""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplit (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msplit (== ',') "my,list,here" == ["my","list","here"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropWhileEnd  isSpace "ab cde  " == "ab cde"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropWhileEnd' isSpace "ab cde  " == "ab cde"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlast (dropWhileEnd  even [undefined,3]) == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlast (dropWhileEnd' even [undefined,3]) == 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mhead (dropWhileEnd  even (3:undefined)) == 3
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mhead (dropWhileEnd' even (3:undefined)) == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropPrefix "Mr. " "Mr. Men" == "Men"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropPrefix "Mr. " "Dr. Men" == "Dr. Men"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropSuffix "!" "Hello World!"  == "Hello World"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropSuffix "!" "Hello World!!" == "Hello World!"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdropSuffix "!" "Hello World."  == "Hello World."
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstripSuffix "bar" "foobar" == Just "foo"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstripSuffix ""    "baz"    == Just "baz"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstripSuffix "foo" "quux"   == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstripInfix "::" "a::b::c" == Just ("a", "b::c")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstripInfix "/" "foobar"   == Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mstripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mchunksOf 3 "my test" == ["my ","tes","t"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mchunksOf 3 "mytest"  == ["myt","est"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mchunksOf 8 ""        == []
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mchunksOf 0 "test"    == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnubSort "this is a test" == " aehist"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> nubSort xs == nub (sort xs)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubSortOn length ["a","test","of","this"] == ["a","of","test"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnubOrd "this is a test" == "this ae"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnubOrd (take 4 ("this" ++ undefined)) == "this"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\xs -> nubOrd xs == nub xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrdOn length ["a","test","of","this"] == ["a","test","of"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mnubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mzipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mzipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mzipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcompareLength [1,2,3] 1 == GT
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcompareLength [1,2] 2 == EQ
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(xs :: [Int]) n -> compareLength xs n == compare (length xs) n
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcompareLength (1:2:3:undefined) 2 == GT
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcomparingLength [1,2,3] [False] == GT
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcomparingLength [1,2] "ab" == EQ
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength [1,2] (1:2:3:undefined) == LT
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mcomparingLength (1:2:3:undefined) [1,2] == GT
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmwhen True  "test" == "test"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mmwhen False "test" == ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfirst succ (1,"test") == (2,"test")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msecond reverse (1,"test") == (1,"tset")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfirstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msecondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m(succ *** reverse) (1,"test") == (2,"tset")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m(succ &&& pred) 1 == (2,0)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdupe 12 == (12, 12)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mboth succ (1,2) == (2,3)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfirst3 succ (1,1,1) == (2,1,1)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [msecond3 succ (1,1,1) == (1,2,1)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mthird3 succ (1,1,1) == (1,1,2)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\x -> readVersion (showVersion x) == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreadVersion "hello" == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDP 4 pi == "3.1416"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDP 0 pi == "3"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDP 2 3  == "3.00"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlistTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlistTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlistTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlistTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlistTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName)    ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mlistTest (listFilesInside $ const $ pure False) ["bar.txt"] []
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [misWindows == (os == "mingw32")
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m\(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcaptureOutput (print 1) == pure ("1\n",())
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile doesFileExist == pure True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m(doesFileExist =<< withTempFile pure) == pure False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile readFile' == pure ""
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempDir doesDirectoryExist == pure True
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [m(doesDirectoryExist =<< withTempDir pure) == pure False
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempDir listFiles == pure []
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfileEq "does_not_exist1" "does_not_exist2" == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfileEq "does_not_exist" "does_not_exist" == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mfmap (round . fst) (duration $ sleep 1) == pure 1
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtimeout (-3) (print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtimeout 0.1  (print 1) == fmap Just (print 1)
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdo (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
[2m[extra] [m0.104603652
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mtimeout 0.1  (sleep 2 >> print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDuration 3.435   == "3.44s"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDuration 623.8   == "10m24s"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDuration 62003.8 == "17h13m"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mshowDuration 1e8     == "27777h47m"
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdo f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mdo (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mExtra export
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mwithTempFile
[2m[extra] [m....done
[2m[extra] [mwithTempDir
[2m[extra] [m....done
[2m[extra] [mretry
[2m[extra] [m+++ OK, passed 1 test.
[2m[extra] [mbarrier
[2m[extra] [mSuccess (323 tests)
[2m[extra] [mTest suite extra-test: PASS
[2m[extra] [mTest suite logged to: dist/test/extra-1.7.16-extra-test.log
[2m[extra] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[extra] [m[1;36mPhase: haddockPhase[m
[2m[extra] [mPreprocessing library for extra-1.7.16..
[2m[extra] [mRunning Haddock on library for extra-1.7.16..
[2m[extra] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[extra] [m[ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
[2m[extra] [m[ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
[2m[extra] [m[ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
[2m[extra] [m[ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
[2m[extra] [m[ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, nothing )
[2m[extra] [m[ 6 of 22] Compiling Partial          ( src/Partial.hs, nothing )
[2m[extra] [m[ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, nothing )
[2m[extra] [m[ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
[2m[extra] [m[ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
[2m[extra] [m[10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
[2m[extra] [m[11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
[2m[extra] [m[12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
[2m[extra] [m[13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
[2m[extra] [m[14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
[2m[extra] [m[15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
[2m[extra] [m[16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
[2m[extra] [m[17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, nothing )
[2m[extra] [m[18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
[2m[extra] [m[19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
[2m[extra] [m[20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
[2m[extra] [m[21 of 22] Compiling Extra            ( src/Extra.hs, nothing )
[2m[extra] [m[22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, nothing )
[2m[extra] [mHaddock coverage:
[2m[extra] [m 100% (  6 /  6) in 'Data.IORef.Extra'
[2m[extra] [m 100% (  4 /  4) in 'Data.Monoid.Extra'
[2m[extra] [m 100% ( 28 / 28) in 'Data.Tuple.Extra'
[2m[extra] [m 100% (  2 /  2) in 'Data.Typeable.Extra'
[2m[extra] [m 100% (  7 /  7) in 'Numeric.Extra'
[2m[extra] [mWarning: '(:)' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [mWarning: 'unzip' is ambiguous. It is defined
[2m[extra] [m    * in ‘Data.Functor’
[2m[extra] [m    * in ‘GHC.List’
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined in ‘GHC.List’
[2m[extra] [mWarning: 'firstJustM' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 85 / 85) in 'Data.List.Extra'
[2m[extra] [mWarning: 'Version' is ambiguous. It is defined
[2m[extra] [m    * in ‘Data.Version’
[2m[extra] [m    * in ‘Data.Version’
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined in ‘Data.Version’
[2m[extra] [m 100% (  3 /  3) in 'Data.Version.Extra'
[2m[extra] [mWarning: '(!?)' is ambiguous. It is defined
[2m[extra] [m    * in ‘GHC.List’
[2m[extra] [m    * at src/Data/List/NonEmpty/Extra.hs:48:1
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:48:1
[2m[extra] [mWarning: 'union' is ambiguous. It is defined
[2m[extra] [m    * in ‘Data.OldList’
[2m[extra] [m    * at src/Data/List/NonEmpty/Extra.hs:80:1
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:80:1
[2m[extra] [m 100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
[2m[extra] [mWarning: 'fromJust' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 11 / 11) in 'Data.Either.Extra'
[2m[extra] [mWarning: 'ErrorCall' is ambiguous. It is defined
[2m[extra] [m    * in ‘GHC.Exception’
[2m[extra] [m    * in ‘GHC.Exception’
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined in ‘GHC.Exception’
[2m[extra] [mWarning: 'AssertionFailed' is ambiguous. It is defined
[2m[extra] [m    * in ‘GHC.IO.Exception’
[2m[extra] [m    * in ‘GHC.IO.Exception’
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined in ‘GHC.IO.Exception’
[2m[extra] [mWarning: 'SomeException' is ambiguous. It is defined
[2m[extra] [m    * in ‘GHC.Exception.Type’
[2m[extra] [m    * in ‘GHC.Exception.Type’
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined in ‘GHC.Exception.Type’
[2m[extra] [m 100% ( 21 / 21) in 'Control.Exception.Extra'
[2m[extra] [mWarning: 'partition' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [mWarning: 'mconcatMap' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [mWarning: 'find' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 38 / 38) in 'Control.Monad.Extra'
[2m[extra] [m  92% ( 12 / 13) in 'Data.Foldable.Extra'
[2m[extra] [m  Missing documentation for:
[2m[extra] [m    Module header
[2m[extra] [mWarning: 'Lock' is ambiguous. It is defined
[2m[extra] [m    * at src/Control/Concurrent/Extra.hs:106:16
[2m[extra] [m    * at src/Control/Concurrent/Extra.hs:106:1
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
[2m[extra] [mWarning: 'Var' is ambiguous. It is defined
[2m[extra] [m    * at src/Control/Concurrent/Extra.hs:146:17
[2m[extra] [m    * at src/Control/Concurrent/Extra.hs:146:1
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
[2m[extra] [mWarning: 'Barrier' is ambiguous. It is defined
[2m[extra] [m    * at src/Control/Concurrent/Extra.hs:210:21
[2m[extra] [m    * at src/Control/Concurrent/Extra.hs:210:1
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
[2m[extra] [m 100% ( 27 / 27) in 'Control.Concurrent.Extra'
[2m[extra] [mWarning: 'createDirectory' is ambiguous. It is defined
[2m[extra] [m    * in ‘System.Directory’
[2m[extra] [m    * in ‘System.Posix.Directory’
[2m[extra] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[extra] [m    by specifying the type/value namespace explicitly.
[2m[extra] [m    Defaulting to the one defined in ‘System.Posix.Directory’
[2m[extra] [m 100% (  8 /  8) in 'System.Directory.Extra'
[2m[extra] [m 100% (  2 /  2) in 'System.Environment.Extra'
[2m[extra] [m 100% ( 26 / 26) in 'System.IO.Extra'
[2m[extra] [m 100% (  4 /  4) in 'System.Info.Extra'
[2m[extra] [m 100% (  5 /  5) in 'System.Process.Extra'
[2m[extra] [m 100% (  8 /  8) in 'System.Time.Extra'
[2m[extra] [m 100% (268 /268) in 'Extra'
[2m[extra] [m 100% (  2 /  2) in 'Text.Read.Extra'
[2m[extra] [mWarning: Data.Tuple.Extra: could not find link destinations for: 
[2m[extra] [m	- GHC.Generics.Rep1_Solo
[2m[extra] [m	- GHC.Generics.Rep_Solo
[2m[extra] [mDocumentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
[2m[extra] [mPreprocessing test suite 'extra-test' for extra-1.7.16..
[2m[extra] [m[1;36mPhase: installPhase[m
[2m[extra] [mInstalling library in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[extra] [m[1;36mPhase: fixupPhase[m
[2m[extra] [mshrinking RPATHs of ELF executables and libraries in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
[2m[extra] [mshrinking /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSextra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ-ghc9.8.1.so
[2m[extra] [mchecking for references to /build/ in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16...
[2m[extra] [mpatching script interpreter paths in /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16
[2m[extra] [mstripping (with command strip and flags -S -p) in  /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16/lib
[2m[extra] [mshrinking RPATHs of ELF executables and libraries in /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc
[2m[extra] [mchecking for references to /build/ in /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc...
[2m[extra] [mpatching script interpreter paths in /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc
[2m[extra:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16[m
[2m[extra:post-build] [m[2mPushing 2 paths (68 are already present) using zstd to cache sellout ⏳[m
[2m[extra:post-build] [m[2m[m
[2m[extra:post-build] [m[2mPushing /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16 (4.07 MiB)[m
[2m[extra:post-build] [m[2mPushing /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc (3.06 MiB)[m
[2m[extra:post-build] [m[2m[m
[2m[extra:post-build] [m[2mAll done.[m
[2m[extra:post-build] [m[2mUploading to the NixCI cache: /nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc /nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16[m
[2m[extra:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[extra:post-build] [m[2mcopying 2 paths...[m
[2m[extra:post-build] [m[2mcopying path '/nix/store/qhjajnqkdmyr9s62q5s3byl8mixj4ylh-extra-1.7.16-doc' to 'https://cache.nix-ci.com'...[m
[2m[extra:post-build] [m[2mcopying path '/nix/store/w4jc8ja35iv3rcccxynrdpbybvbjy39p-extra-1.7.16' to 'https://cache.nix-ci.com'...[m
[2m[extra:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[extra:post-build] [m[2mcopying 1 paths...[m
[2m[extra:post-build] [m[2mcopying path '/nix/store/9p7f127bf99874y0pziszzcc3pkbckn3-extra-1.7.16.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 40 of 46 built[m
[1;34mBuilding /nix/store/95fb9gb6crg1i0pfri43y25jsra3fcj4-algebraic-graphs-0.7.drv[m
[2m[algebraic-graphs] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[algebraic-graphs] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[algebraic-graphs] [m[1;36mPhase: unpackPhase[m
[2m[algebraic-graphs] [munpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
[2m[algebraic-graphs] [msource root is algebraic-graphs-0.7
[2m[algebraic-graphs] [msetting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
[2m[algebraic-graphs] [m[1;36mPhase: patchPhase[m
[2m[algebraic-graphs] [mReplace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
[2m[algebraic-graphs] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[algebraic-graphs] [msetupCompileFlags: -package-db=/build/tmp.MslengsmfE/setup-package.conf.d -threaded
[2m[algebraic-graphs] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.MslengsmfE/Main.o )
[2m[algebraic-graphs] [m[2 of 2] Linking Setup
[2m[algebraic-graphs] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[algebraic-graphs] [m[1;36mPhase: configurePhase[m
[2m[algebraic-graphs] [mconfigureFlags: --verbose --prefix=/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.MslengsmfE/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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
[2m[algebraic-graphs] [mUsing Parsec parser
[2m[algebraic-graphs] [mConfiguring algebraic-graphs-0.7...
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.6.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.19.0.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
[2m[algebraic-graphs] [mDependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
[2m[algebraic-graphs] [mDependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
[2m[algebraic-graphs] [mDependency algebraic-graphs: using algebraic-graphs-0.7
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.6.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.19.0.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
[2m[algebraic-graphs] [mDependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
[2m[algebraic-graphs] [mDependency extra >=1.4 && <2: using extra-1.7.16
[2m[algebraic-graphs] [mDependency inspection-testing >=0.4.2.2 && <0.6: using
[2m[algebraic-graphs] [minspection-testing-0.5.0.3
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
[2m[algebraic-graphs] [mSource component graph:
[2m[algebraic-graphs] [m    component lib
[2m[algebraic-graphs] [m    component test:main dependency lib
[2m[algebraic-graphs] [mConfigured component graph:
[2m[algebraic-graphs] [m    component algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m        include array-0.5.6.0-dc89
[2m[algebraic-graphs] [m        include base-4.19.0.0-b960
[2m[algebraic-graphs] [m        include containers-0.6.8-4775
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-412f
[2m[algebraic-graphs] [m        include transformers-0.6.1.0-c3ec
[2m[algebraic-graphs] [m    component algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
[2m[algebraic-graphs] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[algebraic-graphs] [m        include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m        include array-0.5.6.0-dc89
[2m[algebraic-graphs] [m        include base-4.19.0.0-b960
[2m[algebraic-graphs] [m        include containers-0.6.8-4775
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-412f
[2m[algebraic-graphs] [m        include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[algebraic-graphs] [m        include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
[2m[algebraic-graphs] [m        include transformers-0.6.1.0-c3ec
[2m[algebraic-graphs] [mLinked component graph:
[2m[algebraic-graphs] [m    unit algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m        include array-0.5.6.0-dc89
[2m[algebraic-graphs] [m        include base-4.19.0.0-b960
[2m[algebraic-graphs] [m        include containers-0.6.8-4775
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-412f
[2m[algebraic-graphs] [m        include transformers-0.6.1.0-c3ec
[2m[algebraic-graphs] [m        Algebra.Graph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Data.Graph.Typed
[2m[algebraic-graphs] [m    unit algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
[2m[algebraic-graphs] [m        include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[algebraic-graphs] [m        include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m        include array-0.5.6.0-dc89
[2m[algebraic-graphs] [m        include base-4.19.0.0-b960
[2m[algebraic-graphs] [m        include containers-0.6.8-4775
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-412f
[2m[algebraic-graphs] [m        include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[algebraic-graphs] [m        include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
[2m[algebraic-graphs] [m        include transformers-0.6.1.0-c3ec
[2m[algebraic-graphs] [mReady component graph:
[2m[algebraic-graphs] [m    definite algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m        depends array-0.5.6.0-dc89
[2m[algebraic-graphs] [m        depends base-4.19.0.0-b960
[2m[algebraic-graphs] [m        depends containers-0.6.8-4775
[2m[algebraic-graphs] [m        depends deepseq-1.5.0.0-412f
[2m[algebraic-graphs] [m        depends transformers-0.6.1.0-c3ec
[2m[algebraic-graphs] [m    definite algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
[2m[algebraic-graphs] [m        depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
[2m[algebraic-graphs] [m        depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m        depends array-0.5.6.0-dc89
[2m[algebraic-graphs] [m        depends base-4.19.0.0-b960
[2m[algebraic-graphs] [m        depends containers-0.6.8-4775
[2m[algebraic-graphs] [m        depends deepseq-1.5.0.0-412f
[2m[algebraic-graphs] [m        depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
[2m[algebraic-graphs] [m        depends inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
[2m[algebraic-graphs] [m        depends transformers-0.6.1.0-c3ec
[2m[algebraic-graphs] [mUsing Cabal-3.10.2.0 compiled by ghc-9.8
[2m[algebraic-graphs] [mUsing compiler: ghc-9.8.1
[2m[algebraic-graphs] [mUsing install prefix:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
[2m[algebraic-graphs] [mExecutables installed in:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/bin
[2m[algebraic-graphs] [mLibraries installed in:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [mDynamic Libraries installed in:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
[2m[algebraic-graphs] [mPrivate executables installed in:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
[2m[algebraic-graphs] [mData files installed in:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
[2m[algebraic-graphs] [mDocumentation installed in:
[2m[algebraic-graphs] [m/nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
[2m[algebraic-graphs] [mConfiguration files installed in:
[2m[algebraic-graphs] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/etc
[2m[algebraic-graphs] [mNo alex found
[2m[algebraic-graphs] [mUsing ar found on system at:
[2m[algebraic-graphs] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[algebraic-graphs] [mNo c2hs found
[2m[algebraic-graphs] [mNo cpphs found
[2m[algebraic-graphs] [mNo doctest found
[2m[algebraic-graphs] [mUsing gcc version 14.3.0 given by user at:
[2m[algebraic-graphs] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[algebraic-graphs] [mUsing ghc version 9.8.1 found on system at:
[2m[algebraic-graphs] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[algebraic-graphs] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[algebraic-graphs] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[algebraic-graphs] [mNo ghcjs found
[2m[algebraic-graphs] [mNo ghcjs-pkg found
[2m[algebraic-graphs] [mNo greencard found
[2m[algebraic-graphs] [mUsing haddock version 2.30.0 found on system at:
[2m[algebraic-graphs] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[algebraic-graphs] [mNo happy found
[2m[algebraic-graphs] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[algebraic-graphs] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[algebraic-graphs] [mNo hmake found
[2m[algebraic-graphs] [mUsing hpc version 0.69 found on system at:
[2m[algebraic-graphs] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[algebraic-graphs] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[algebraic-graphs] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[algebraic-graphs] [mUsing hscolour version 1.25 found on system at:
[2m[algebraic-graphs] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[algebraic-graphs] [mNo jhc found
[2m[algebraic-graphs] [mUsing ld found on system at:
[2m[algebraic-graphs] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[algebraic-graphs] [mNo pkg-config found
[2m[algebraic-graphs] [mUsing runghc version 9.8.1 found on system at:
[2m[algebraic-graphs] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[algebraic-graphs] [mUsing strip version 2.44 found on system at:
[2m[algebraic-graphs] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[algebraic-graphs] [mUsing tar found on system at:
[2m[algebraic-graphs] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[algebraic-graphs] [mNo uhc found
[2m[algebraic-graphs] [m[1;36mPhase: buildPhase[m
[2m[algebraic-graphs] [mPreprocessing library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mBuilding library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘head’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m384 |[0m[0m     exit v = do newComponent <- (v==).snd.[;1m[35mhead[0m[0m <$> gets boundaryStack
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘tail’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m391 |[0m[0m              pth' = [;1m[35mtail[0m[0m v_pth' -- Here we know that v_pth' starts with v
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                     ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘head’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m395 |[0m[0m              p_v = fst $ [;1m[35mhead[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                          ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘tail’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m397 |[0m[0m              bnd' = [;1m[35mtail[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                     ^^^^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m     vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m     preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                             ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m     postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m     toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                     ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m     toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                    ^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                         ^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                               ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                                              ^[0m[0m
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
[2m[algebraic-graphs] [m[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
[2m[algebraic-graphs] [m[ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
[2m[algebraic-graphs] [m[ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
[2m[algebraic-graphs] [m[ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
[2m[algebraic-graphs] [m[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘head’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m384 |[0m[0m     exit v = do newComponent <- (v==).snd.[;1m[35mhead[0m[0m <$> gets boundaryStack
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘tail’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m391 |[0m[0m              pth' = [;1m[35mtail[0m[0m v_pth' -- Here we know that v_pth' starts with v
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                     ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘head’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m395 |[0m[0m              p_v = fst $ [;1m[35mhead[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                          ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘tail’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m397 |[0m[0m              bnd' = [;1m[35mtail[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                     ^^^^[0m[0m
[2m[algebraic-graphs] [m[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m     vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m     preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                             ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m     postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m     toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                     ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m     toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                    ^[0m[0m
[2m[algebraic-graphs] [m[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
[2m[algebraic-graphs] [m[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
[2m[algebraic-graphs] [m[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
[2m[algebraic-graphs] [m[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
[2m[algebraic-graphs] [m[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                         ^[0m[0m
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                               ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                                              ^[0m[0m
[2m[algebraic-graphs] [m[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
[2m[algebraic-graphs] [m[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
[2m[algebraic-graphs] [m[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
[2m[algebraic-graphs] [m[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
[2m[algebraic-graphs] [m[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
[2m[algebraic-graphs] [m[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
[2m[algebraic-graphs] [m[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
[2m[algebraic-graphs] [mPreprocessing test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mBuilding test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[ 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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [mtest/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
[2m[algebraic-graphs] [minspection testing successful
[2m[algebraic-graphs] [m      expected successes: 58
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[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 )
[2m[algebraic-graphs] [m[23 of 23] Compiling Main             ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
[2m[algebraic-graphs] [m[24 of 24] Linking dist/build/main/main
[2m[algebraic-graphs] [mbuildPhase completed in 42 seconds
[2m[algebraic-graphs] [m[1;36mPhase: checkPhase[m
[2m[algebraic-graphs] [mRunning 1 test suites...
[2m[algebraic-graphs] [mTest suite main: RUNNING...
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show empty                == "empty"
[2m[algebraic-graphs] [mOK: show (shrink 1)           == "vertex 1"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 + 2)     == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2)     == "(fromJust . toAcyclic) (edge 1 2)"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
[2m[algebraic-graphs] [mOK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.fromAcyclic ============
[2m[algebraic-graphs] [mOK: fromAcyclic empty                == empty
[2m[algebraic-graphs] [mOK: fromAcyclic . vertex             == vertex
[2m[algebraic-graphs] [mOK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
[2m[algebraic-graphs] [mOK: vertexCount . fromAcyclic        == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount   . fromAcyclic        == edgeCount
[2m[algebraic-graphs] [mOK: isAcyclic   . fromAcyclic        == const True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.union ============
[2m[algebraic-graphs] [mOK: vertexSet (union x y) == <correct result>
[2m[algebraic-graphs] [mOK: edgeSet   (union x y) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.join ============
[2m[algebraic-graphs] [mOK: vertexSet (join x y) == <correct result>
[2m[algebraic-graphs] [mOK: edgeSet   (join x y) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty        x          ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)   empty      ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x          ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x (transitiveClosure x) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                     ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                             == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                        == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x)       == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge 1 2 (shrink $ 1 * 2) == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty            == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x)       == 0
[2m[algebraic-graphs] [mOK: edgeCount (shrink $ 1 * 2) == 1
[2m[algebraic-graphs] [mOK: edgeCount                  == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty            == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)       == []
[2m[algebraic-graphs] [mOK: edgeList (shrink $ 2 * 1) == [(2,1)]
[2m[algebraic-graphs] [mOK: edgeList . transpose      == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty            == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)       == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty            == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x)       == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty            == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x)       == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (shrink $ 1 * 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
[2m[algebraic-graphs] [mOK: Set.member x . preSet x   == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty            == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x)       == Set.empty
[2m[algebraic-graphs] [mOK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
[2m[algebraic-graphs] [mOK: postSet 2 (shrink $ 1 * 2) == Set.empty
[2m[algebraic-graphs] [mOK: Set.member x . postSet x   == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (shrink $ 1 * 2)     == vertices [1,2]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y     == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x     == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing) == empty
[2m[algebraic-graphs] [mOK: induceJust . vertex . Just  == vertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box x y               ~~ box y x
[2m[algebraic-graphs] [mOK: box x (vertex ())     ~~ x
[2m[algebraic-graphs] [mOK: box x empty           ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z)       ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty                    == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)               == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure      == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort empty                          == []
[2m[algebraic-graphs] [mOK: topSort (vertex x)                     == [x]
[2m[algebraic-graphs] [mOK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
[2m[algebraic-graphs] [mOK: topSort (join x y)                     == fmap Left (topSort x) ++ fmap Right (topSort y)
[2m[algebraic-graphs] [mOK: Right . topSort                        == AM.topSort . fromAcyclic
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.scc ============
[2m[algebraic-graphs] [mOK:            scc empty               == empty
[2m[algebraic-graphs] [mOK:            scc (vertex x)          == vertex (NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK:            scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
[2m[algebraic-graphs] [mOK: edgeList $ scc (edge 1 2)          == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
[2m[algebraic-graphs] [mOK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.toAcyclic ============
[2m[algebraic-graphs] [mOK: toAcyclic (path    [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
[2m[algebraic-graphs] [mOK: toAcyclic (clique  [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
[2m[algebraic-graphs] [mOK: toAcyclic (circuit [1,2,3]) == Nothing
[2m[algebraic-graphs] [mOK: toAcyclic . fromAcyclic     == Just
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.toAcyclicOrd ============
[2m[algebraic-graphs] [mOK: toAcyclicOrd empty       == empty
[2m[algebraic-graphs] [mOK: toAcyclicOrd . vertex    == vertex
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 + 2)     == shrink (1 + 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2)     == shrink (1 * 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (2 * 1)     == shrink (1 + 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
[2m[algebraic-graphs] [mOK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.shrink ============
[2m[algebraic-graphs] [mOK: shrink . AM.vertex   == vertex
[2m[algebraic-graphs] [mOK: shrink . AM.vertices == vertices
[2m[algebraic-graphs] [mOK: shrink . fromAcyclic == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Acyclic.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: Arbitrary
[2m[algebraic-graphs] [mOK: empty
[2m[algebraic-graphs] [mOK: vertex
[2m[algebraic-graphs] [mOK: vertices
[2m[algebraic-graphs] [mOK: union
[2m[algebraic-graphs] [mOK: join
[2m[algebraic-graphs] [mOK: transpose
[2m[algebraic-graphs] [mOK: box
[2m[algebraic-graphs] [mOK: transitiveClosure
[2m[algebraic-graphs] [mOK: scc
[2m[algebraic-graphs] [mOK: toAcyclic
[2m[algebraic-graphs] [mOK: toAcyclicOrd
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.fromAdjacencyMap ============
[2m[algebraic-graphs] [mOK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.fromAdjacencyIntSets ============
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets []                                     == empty
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [(x, IntSet.empty)]                    == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets [(x, IntSet.singleton y)]              == edge x y
[2m[algebraic-graphs] [mOK: fromAdjacencyIntSets . map (fmap IntSet.fromList)           == stars
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty           == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.bfsForest ============
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0]        == empty
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ bfsForest x vs) x == True
[2m[algebraic-graphs] [mOK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
[2m[algebraic-graphs] [mOK: bfsForest x []                           == []
[2m[algebraic-graphs] [mOK: bfsForest empty vs                       == []
[2m[algebraic-graphs] [mOK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
[2m[algebraic-graphs] [mOK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.bfs ============
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [0]                                   == []
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1]                                   == [[1], [2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2]                                   == [[2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 1) [1]                                   == [[1]]
[2m[algebraic-graphs] [mOK: bfs empty vs                                         == []
[2m[algebraic-graphs] [mOK: bfs x []                                             == []
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
[2m[algebraic-graphs] [mOK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
[2m[algebraic-graphs] [mOK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
[2m[algebraic-graphs] [mOK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
[2m[algebraic-graphs] [mOK: map concat . transpose . map levels . bfsForest x    == bfs x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfsForest ============
[2m[algebraic-graphs] [mOK: forest $ dfsForest empty              == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 1)         == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest x) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForest x) x         == True
[2m[algebraic-graphs] [mOK: dfsForest . forest . dfsForest        == dfsForest
[2m[algebraic-graphs] [mOK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
[2m[algebraic-graphs] [mOK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom empty      vs             == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom x (vertexList x)                   == dfsForest x
[2m[algebraic-graphs] [mOK: dfsForestFrom x []                               == []
[2m[algebraic-graphs] [mOK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfs ============
[2m[algebraic-graphs] [mOK: dfs empty      vs    == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 1) [1]   == [1]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [0]   == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1]   == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2]   == [2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs x          []    == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs x vs ]       == True
[2m[algebraic-graphs] [mOK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
[2m[algebraic-graphs] [mOK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.dfs ============
[2m[algebraic-graphs] [mOK: reachable empty              x == []
[2m[algebraic-graphs] [mOK: reachable (vertex 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         0 == []
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         1 == [1,2]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         2 == [2]
[2m[algebraic-graphs] [mOK: reachable (path    [1..8]  ) 4 == [4..8]
[2m[algebraic-graphs] [mOK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
[2m[algebraic-graphs] [mOK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- reachable x y ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
[2m[algebraic-graphs] [mOK: topSort (path [1..5])                      == Right [1..5]
[2m[algebraic-graphs] [mOK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
[2m[algebraic-graphs] [mOK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
[2m[algebraic-graphs] [mOK: fmap (flip isTopSortOf x) (topSort x) /= Right False
[2m[algebraic-graphs] [mOK: topSort . vertices     == Right . nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.testIsAcyclic ============
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 2 * 1) == False
[2m[algebraic-graphs] [mOK: isAcyclic . circuit       == null
[2m[algebraic-graphs] [mOK: isAcyclic                 == isRight . topSort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isDfsForestOf ============
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              empty            == True
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyIntMap.isTopSortOf ============
[2m[algebraic-graphs] [mOK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      empty           == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (vertex x)      == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (edge x x)      == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.fromAdjacencySets ============
[2m[algebraic-graphs] [mOK: fromAdjacencySets []                                  == empty
[2m[algebraic-graphs] [mOK: fromAdjacencySets [(x, Set.empty)]                    == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencySets [(x, Set.singleton y)]              == edge x y
[2m[algebraic-graphs] [mOK: fromAdjacencySets . map (fmap Set.fromList)           == stars
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty           == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: box x y               ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z)   == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ())     ~~ x
[2m[algebraic-graphs] [mOK: box x empty           ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z)       ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.bfsForest ============
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0]        == empty
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
[2m[algebraic-graphs] [mOK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ bfsForest x vs) x == True
[2m[algebraic-graphs] [mOK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
[2m[algebraic-graphs] [mOK: bfsForest x []                           == []
[2m[algebraic-graphs] [mOK: bfsForest empty vs                       == []
[2m[algebraic-graphs] [mOK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
[2m[algebraic-graphs] [mOK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.bfs ============
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [0]                                   == []
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1]                                   == [[1], [2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2]                                   == [[2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
[2m[algebraic-graphs] [mOK: bfs (edge 1 1) [1]                                   == [[1]]
[2m[algebraic-graphs] [mOK: bfs empty vs                                         == []
[2m[algebraic-graphs] [mOK: bfs x []                                             == []
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
[2m[algebraic-graphs] [mOK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
[2m[algebraic-graphs] [mOK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
[2m[algebraic-graphs] [mOK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
[2m[algebraic-graphs] [mOK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
[2m[algebraic-graphs] [mOK: map concat . transpose . map levels . bfsForest x    == bfs x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfsForest ============
[2m[algebraic-graphs] [mOK: forest $ dfsForest empty              == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 1)         == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest x) x == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForest x) x         == True
[2m[algebraic-graphs] [mOK: dfsForest . forest . dfsForest        == dfsForest
[2m[algebraic-graphs] [mOK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
[2m[algebraic-graphs] [mOK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom empty      vs             == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
[2m[algebraic-graphs] [mOK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom x (vertexList x)                   == dfsForest x
[2m[algebraic-graphs] [mOK: dfsForestFrom x []                               == []
[2m[algebraic-graphs] [mOK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
[2m[algebraic-graphs] [mOK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfs ============
[2m[algebraic-graphs] [mOK: dfs empty      vs    == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 1) [1]   == [1]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [0]   == []
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1]   == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2]   == [2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs (edge 1 2) [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs x          []    == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs x vs ]       == True
[2m[algebraic-graphs] [mOK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
[2m[algebraic-graphs] [mOK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.dfs ============
[2m[algebraic-graphs] [mOK: reachable empty              x == []
[2m[algebraic-graphs] [mOK: reachable (vertex 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 1)         1 == [1]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         0 == []
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         1 == [1,2]
[2m[algebraic-graphs] [mOK: reachable (edge 1 2)         2 == [2]
[2m[algebraic-graphs] [mOK: reachable (path    [1..8]  ) 4 == [4..8]
[2m[algebraic-graphs] [mOK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
[2m[algebraic-graphs] [mOK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- reachable x y ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.topSort ============
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
[2m[algebraic-graphs] [mOK: topSort (path [1..5])                      == Right [1..5]
[2m[algebraic-graphs] [mOK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
[2m[algebraic-graphs] [mOK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
[2m[algebraic-graphs] [mOK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
[2m[algebraic-graphs] [mOK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
[2m[algebraic-graphs] [mOK: fmap (flip isTopSortOf x) (topSort x) /= Right False
[2m[algebraic-graphs] [mOK: topSort . vertices     == Right . nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.testIsAcyclic ============
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isAcyclic (1 * 2 + 2 * 1) == False
[2m[algebraic-graphs] [mOK: isAcyclic . circuit       == null
[2m[algebraic-graphs] [mOK: isAcyclic                 == isRight . topSort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isDfsForestOf ============
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              empty            == True
[2m[algebraic-graphs] [mOK: isDfsForestOf []                              (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
[2m[algebraic-graphs] [mOK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.isTopSortOf ============
[2m[algebraic-graphs] [mOK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
[2m[algebraic-graphs] [mOK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      (1 * 2 + 3 * 1) == False
[2m[algebraic-graphs] [mOK: isTopSortOf []      empty           == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (vertex x)      == True
[2m[algebraic-graphs] [mOK: isTopSortOf [x]     (edge x x)      == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ AdjacencyMap.scc ============
[2m[algebraic-graphs] [mOK: scc empty               == empty
[2m[algebraic-graphs] [mOK: scc (vertex x)          == vertex (NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc (vertices xs)       == vertices (map NonEmpty.vertex xs)
[2m[algebraic-graphs] [mOK: scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
[2m[algebraic-graphs] [mOK: scc (edge 1 2)          == edge   (NonEmpty.vertex 1) (NonEmpty.vertex 2)
[2m[algebraic-graphs] [mOK: scc (circuit (1:xs))    == vertex (NonEmpty.circuit1 (1 :| xs))
[2m[algebraic-graphs] [mOK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
[2m[algebraic-graphs] [mOK: isAcyclic . scc == const True
[2m[algebraic-graphs] [mOK: isAcyclic x     == (scc x == gmap NonEmpty.vertex x)
[2m[algebraic-graphs] [mOK: scc g == KL.scc g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Num ============
[2m[algebraic-graphs] [mOK: 0                     == rightVertex 0
[2m[algebraic-graphs] [mOK: swap 1                == leftVertex 1
[2m[algebraic-graphs] [mOK: swap 1 + 2            == vertices [1] [2]
[2m[algebraic-graphs] [mOK: swap 1 * 2            == edge 1 2
[2m[algebraic-graphs] [mOK: swap 1 + 2 * swap 3   == overlay (leftVertex 1) (edge 3 2)
[2m[algebraic-graphs] [mOK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Show ============
[2m[algebraic-graphs] [mOK: show empty                 == "empty"
[2m[algebraic-graphs] [mOK: show 1                     == "rightVertex 1"
[2m[algebraic-graphs] [mOK: show (swap 2)              == "leftVertex 2"
[2m[algebraic-graphs] [mOK: show 1 + 2                 == "vertices [] [1,2]"
[2m[algebraic-graphs] [mOK: show (swap (1 + 2))        == "vertices [1,2] []"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2)          == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
[2m[algebraic-graphs] [mOK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Eq ============
[2m[algebraic-graphs] [mOK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK:         x + y == y + x
[2m[algebraic-graphs] [mOK:   x + (y + z) == (x + y) + z
[2m[algebraic-graphs] [mOK:     x * empty == x
[2m[algebraic-graphs] [mOK:     empty * x == x
[2m[algebraic-graphs] [mOK:         x * y == y * x
[2m[algebraic-graphs] [mOK:   x * (y * z) == (x * y) * z
[2m[algebraic-graphs] [mOK:   x * (y + z) == x * y + x * z
[2m[algebraic-graphs] [mOK:   (x + y) * z == x * z + y * z
[2m[algebraic-graphs] [mOK:     x * y * z == x * y + x * z + y * z
[2m[algebraic-graphs] [mOK:     x + empty == x
[2m[algebraic-graphs] [mOK:     empty + x == x
[2m[algebraic-graphs] [mOK:         x + x == x
[2m[algebraic-graphs] [mOK: x * y + x + y == x * y
[2m[algebraic-graphs] [mOK:     x * x * x == x * x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK:  leftVertex x * leftVertex y  ==  leftVertex x + leftVertex y 
[2m[algebraic-graphs] [mOK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap empty           == Map.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (rightVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (edge x y)      == Map.singleton x (Set.singleton y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
[2m[algebraic-graphs] [mOK: rightAdjacencyMap empty           == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (leftVertex x)  == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (edge x y)      == Map.singleton y (Set.singleton x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty empty           == True
[2m[algebraic-graphs] [mOK: leftAdjacencyMap empty  == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap empty == Map.empty
[2m[algebraic-graphs] [mOK: hasVertex x empty       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertex ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (leftVertex x) == Map.empty
[2m[algebraic-graphs] [mOK: hasLeftVertex x (leftVertex y)   == (x == y)
[2m[algebraic-graphs] [mOK: hasRightVertex x (leftVertex y)  == False
[2m[algebraic-graphs] [mOK: hasEdge x y (leftVertex z)       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertex ============
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (rightVertex x)  == Map.empty
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
[2m[algebraic-graphs] [mOK: hasLeftVertex x (rightVertex y)   == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (rightVertex y)  == (x == y)
[2m[algebraic-graphs] [mOK: hasEdge x y (rightVertex z)       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: vertex . Left  == leftVertex
[2m[algebraic-graphs] [mOK: vertex . Right == rightVertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y                     == connect (leftVertex x) (rightVertex y)
[2m[algebraic-graphs] [mOK: leftAdjacencyMap (edge x y)  == Map.singleton x (Set.singleton y)
[2m[algebraic-graphs] [mOK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge 1 2 (edge 2 1)       == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: connect (leftVertex x)     (leftVertex y)     == vertices [x,y] []
[2m[algebraic-graphs] [mOK: connect (leftVertex x)     (rightVertex y)    == edge x y
[2m[algebraic-graphs] [mOK: connect (rightVertex x)    (leftVertex y)     == edge y x
[2m[algebraic-graphs] [mOK: connect (rightVertex x)    (rightVertex y)    == vertices [] [x,y]
[2m[algebraic-graphs] [mOK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y)                     == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y)                     == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y)                     >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y)                     <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y)                     >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y)                     >= leftVertexCount x * rightVertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y)                     <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices [] []                    == empty
[2m[algebraic-graphs] [mOK: vertices [x] []                   == leftVertex x
[2m[algebraic-graphs] [mOK: vertices [] [x]                   == rightVertex x
[2m[algebraic-graphs] [mOK: vertices xs ys                    == overlays (map leftVertex xs ++ map rightVertex ys)
[2m[algebraic-graphs] [mOK: hasLeftVertex  x (vertices xs ys) == elem x xs
[2m[algebraic-graphs] [mOK: hasRightVertex y (vertices xs ys) == elem y ys
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges []            == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]       == edge x y
[2m[algebraic-graphs] [mOK: edges               == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: hasEdge x y . edges == elem (x,y)
[2m[algebraic-graphs] [mOK: edgeCount   . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.swap ============
[2m[algebraic-graphs] [mOK: swap empty            == empty
[2m[algebraic-graphs] [mOK: swap . leftVertex     == rightVertex
[2m[algebraic-graphs] [mOK: swap (vertices xs ys) == vertices ys xs
[2m[algebraic-graphs] [mOK: swap (edge x y)       == edge y x
[2m[algebraic-graphs] [mOK: swap . edges          == edges . map Data.Tuple.swap
[2m[algebraic-graphs] [mOK: swap . swap           == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.toBipartite ============
[2m[algebraic-graphs] [mOK: toBipartite empty                      == empty
[2m[algebraic-graphs] [mOK: toBipartite (vertex (Left x))          == leftVertex x
[2m[algebraic-graphs] [mOK: toBipartite (vertex (Right x))         == rightVertex x
[2m[algebraic-graphs] [mOK: toBipartite (edge (Left x) (Left y))   == vertices [x,y] []
[2m[algebraic-graphs] [mOK: toBipartite (edge (Left x) (Right y))  == edge x y
[2m[algebraic-graphs] [mOK: toBipartite (edge (Right x) (Left y))  == edge y x
[2m[algebraic-graphs] [mOK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
[2m[algebraic-graphs] [mOK: toBipartite . clique                   == uncurry biclique . partitionEithers
[2m[algebraic-graphs] [mOK: toBipartite . fromBipartite            == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.toBipartiteWith ============
[2m[algebraic-graphs] [mOK: toBipartiteWith f empty == empty
[2m[algebraic-graphs] [mOK: toBipartiteWith Left x  == vertices (vertexList x) []
[2m[algebraic-graphs] [mOK: toBipartiteWith Right x == vertices [] (vertexList x)
[2m[algebraic-graphs] [mOK: toBipartiteWith f       == toBipartite . gmap f
[2m[algebraic-graphs] [mOK: toBipartiteWith id      == toBipartite
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.fromBipartite ============
[2m[algebraic-graphs] [mOK: fromBipartite empty          == empty
[2m[algebraic-graphs] [mOK: fromBipartite (leftVertex x) == vertex (Left x)
[2m[algebraic-graphs] [mOK: fromBipartite (edge x y)     == edges [(Left x, Right y), (Right y, Left x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.fromBipartiteWith ============
[2m[algebraic-graphs] [mOK: fromBipartiteWith Left Right             == fromBipartite
[2m[algebraic-graphs] [mOK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
[2m[algebraic-graphs] [mOK: fromBipartiteWith id id . edges          == symmetricClosure . edges
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                 == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty) == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)            == False
[2m[algebraic-graphs] [mOK: isEmpty                       == (==) empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasLeftVertex ============
[2m[algebraic-graphs] [mOK: hasLeftVertex x empty           == False
[2m[algebraic-graphs] [mOK: hasLeftVertex x (leftVertex y)  == (x == y)
[2m[algebraic-graphs] [mOK: hasLeftVertex x (rightVertex y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasRightVertex ============
[2m[algebraic-graphs] [mOK: hasRightVertex x empty           == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (leftVertex y)  == False
[2m[algebraic-graphs] [mOK: hasRightVertex x (rightVertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex . Left  == hasLeftVertex
[2m[algebraic-graphs] [mOK: hasVertex . Right == hasRightVertex
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty      == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z) == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: hasEdge x y            == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexCount ============
[2m[algebraic-graphs] [mOK: leftVertexCount empty           == 0
[2m[algebraic-graphs] [mOK: leftVertexCount (leftVertex x)  == 1
[2m[algebraic-graphs] [mOK: leftVertexCount (rightVertex x) == 0
[2m[algebraic-graphs] [mOK: leftVertexCount (edge x y)      == 1
[2m[algebraic-graphs] [mOK: leftVertexCount . edges         == length . nub . map fst
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexCount ============
[2m[algebraic-graphs] [mOK: rightVertexCount empty           == 0
[2m[algebraic-graphs] [mOK: rightVertexCount (leftVertex x)  == 0
[2m[algebraic-graphs] [mOK: rightVertexCount (rightVertex x) == 1
[2m[algebraic-graphs] [mOK: rightVertexCount (edge x y)      == 1
[2m[algebraic-graphs] [mOK: rightVertexCount . edges         == length . nub . map snd
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty      == 0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge x y) == 2
[2m[algebraic-graphs] [mOK: vertexCount x          == leftVertexCount x + rightVertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount . edges    == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexList ============
[2m[algebraic-graphs] [mOK: leftVertexList empty              == []
[2m[algebraic-graphs] [mOK: leftVertexList (leftVertex x)     == [x]
[2m[algebraic-graphs] [mOK: leftVertexList (rightVertex x)    == []
[2m[algebraic-graphs] [mOK: leftVertexList . flip vertices [] == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexList ============
[2m[algebraic-graphs] [mOK: rightVertexList empty           == []
[2m[algebraic-graphs] [mOK: rightVertexList (leftVertex x)  == []
[2m[algebraic-graphs] [mOK: rightVertexList (rightVertex x) == [x]
[2m[algebraic-graphs] [mOK: rightVertexList . vertices []   == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty                             == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x)                        == [x]
[2m[algebraic-graphs] [mOK: vertexList (edge x y)                        == [Left x, Right y]
[2m[algebraic-graphs] [mOK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty      == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x) == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y) == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList . edges    == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftVertexSet ============
[2m[algebraic-graphs] [mOK: leftVertexSet empty              == Set.empty
[2m[algebraic-graphs] [mOK: leftVertexSet . leftVertex       == Set.singleton
[2m[algebraic-graphs] [mOK: leftVertexSet . rightVertex      == const Set.empty
[2m[algebraic-graphs] [mOK: leftVertexSet . flip vertices [] == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightVertexSet ============
[2m[algebraic-graphs] [mOK: rightVertexSet empty         == Set.empty
[2m[algebraic-graphs] [mOK: rightVertexSet . leftVertex  == const Set.empty
[2m[algebraic-graphs] [mOK: rightVertexSet . rightVertex == Set.singleton
[2m[algebraic-graphs] [mOK: rightVertexSet . vertices [] == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty                             == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex                          == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet (edge x y)                        == Set.fromList [Left x, Right y]
[2m[algebraic-graphs] [mOK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.leftAdjacencyList ============
[2m[algebraic-graphs] [mOK: leftAdjacencyList empty            == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (vertices [] xs) == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (vertices xs []) == []
[2m[algebraic-graphs] [mOK: leftAdjacencyList (edge x y)       == [(x, [y])]
[2m[algebraic-graphs] [mOK: leftAdjacencyList (star x ys)      == [(x, nub (sort ys))]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.rightAdjacencyList ============
[2m[algebraic-graphs] [mOK: rightAdjacencyList empty            == []
[2m[algebraic-graphs] [mOK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
[2m[algebraic-graphs] [mOK: rightAdjacencyList (vertices xs []) == []
[2m[algebraic-graphs] [mOK: rightAdjacencyList (edge x y)       == [(y, [x])]
[2m[algebraic-graphs] [mOK: rightAdjacencyList (star x ys)      == [(y, [x])  | y <- nub (sort ys)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.evenList ============
[2m[algebraic-graphs] [mOK: evenList []                 == Nil
[2m[algebraic-graphs] [mOK: evenList [(1,2), (3,4)]     == [1, 2, 3, 4] :: List Int Int
[2m[algebraic-graphs] [mOK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.oddList ============
[2m[algebraic-graphs] [mOK: oddList 1 []                 == Cons 1 Nil
[2m[algebraic-graphs] [mOK: oddList 1 [(2,3), (4,5)]     == [1, 2, 3, 4, 5] :: List Int Int
[2m[algebraic-graphs] [mOK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.path ============
[2m[algebraic-graphs] [mOK: path Nil                   == empty
[2m[algebraic-graphs] [mOK: path (Cons x Nil)          == leftVertex x
[2m[algebraic-graphs] [mOK: path (Cons x (Cons y Nil)) == edge x y
[2m[algebraic-graphs] [mOK: path [1, 2, 3, 4, 5]       == edges [(1,2), (3,2), (3,4), (5,4)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.circuit ============
[2m[algebraic-graphs] [mOK: circuit []                    == empty
[2m[algebraic-graphs] [mOK: circuit [(x,y)]               == edge x y
[2m[algebraic-graphs] [mOK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
[2m[algebraic-graphs] [mOK: circuit . reverse             == swap . circuit . map Data.Tuple.swap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.biclique ============
[2m[algebraic-graphs] [mOK: biclique [] [] == empty
[2m[algebraic-graphs] [mOK: biclique xs [] == vertices xs []
[2m[algebraic-graphs] [mOK: biclique [] ys == vertices [] ys
[2m[algebraic-graphs] [mOK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == leftVertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (leftVertex x) (vertices [] ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == leftVertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: star x [y,z]                  == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.mesh ============
[2m[algebraic-graphs] [mOK: mesh xs []           == empty
[2m[algebraic-graphs] [mOK: mesh [] ys           == empty
[2m[algebraic-graphs] [mOK: mesh [x] [y]         == leftVertex (x,y)
[2m[algebraic-graphs] [mOK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
[2m[algebraic-graphs] [mOK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeLeftVertex ============
[2m[algebraic-graphs] [mOK: removeLeftVertex x (leftVertex x)       == empty
[2m[algebraic-graphs] [mOK: removeLeftVertex 1 (leftVertex 2)       == leftVertex 2
[2m[algebraic-graphs] [mOK: removeLeftVertex x (rightVertex y)      == rightVertex y
[2m[algebraic-graphs] [mOK: removeLeftVertex x (edge x y)           == rightVertex y
[2m[algebraic-graphs] [mOK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeRightVertex ============
[2m[algebraic-graphs] [mOK: removeRightVertex x (rightVertex x)       == empty
[2m[algebraic-graphs] [mOK: removeRightVertex 1 (rightVertex 2)       == rightVertex 2
[2m[algebraic-graphs] [mOK: removeRightVertex x (leftVertex y)        == leftVertex y
[2m[algebraic-graphs] [mOK: removeRightVertex y (edge x y)            == leftVertex x
[2m[algebraic-graphs] [mOK: removeRightVertex x . removeRightVertex x == removeRightVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)            == vertices [x] [y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y      == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeLeftVertex x  == removeLeftVertex x
[2m[algebraic-graphs] [mOK: removeEdge x y . removeRightVertex y == removeRightVertex y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.bimap ============
[2m[algebraic-graphs] [mOK: bimap f g empty           == empty
[2m[algebraic-graphs] [mOK: bimap f g . vertex        == vertex . Data.Bifunctor.bimap f g
[2m[algebraic-graphs] [mOK: bimap f g (edge x y)      == edge (f x) (g y)
[2m[algebraic-graphs] [mOK: bimap id id               == id
[2m[algebraic-graphs] [mOK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.box ============
[2m[algebraic-graphs] [mOK: box (path [0,1]) (path ['a','b']) == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box x y                ~~ box y x
[2m[algebraic-graphs] [mOK: box x (box y z)        ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: box x (box y z)        ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: box x (leftVertex ())  ~~ x
[2m[algebraic-graphs] [mOK: box x (rightVertex ()) ~~ swap x
[2m[algebraic-graphs] [mOK: box x empty            ~~ empty
[2m[algebraic-graphs] [mOK: vertexCount (box x y)  <= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount (box x y)    <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: box == boxWith (,) (,) (,) (,)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: consistent empty            == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)       == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)       == True
[2m[algebraic-graphs] [mOK: consistent (edges x)        == True
[2m[algebraic-graphs] [mOK: consistent (toBipartite x)  == True
[2m[algebraic-graphs] [mOK: consistent (swap x)         == True
[2m[algebraic-graphs] [mOK: consistent (circuit xs)     == True
[2m[algebraic-graphs] [mOK: consistent (biclique xs ys) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
[2m[algebraic-graphs] [mOK: detectParts empty                                       == Right empty
[2m[algebraic-graphs] [mOK: detectParts (vertex 1)                                  == Right (leftVertex 1)
[2m[algebraic-graphs] [mOK: detectParts (edge 1 1)                                  == Left [1]
[2m[algebraic-graphs] [mOK: detectParts (edge 1 2)                                  == Right (edge 1 2)
[2m[algebraic-graphs] [mOK: detectParts (edge 0 (-1))                               == Right (edge (-1) 0)
[2m[algebraic-graphs] [mOK: detectParts (1 * (2 + 3))                               == Right (edges [(1, 2), (1, 3)])
[2m[algebraic-graphs] [mOK: detectParts ((1 + 3) * (2 + 4) + 6 * 5)                 == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
[2m[algebraic-graphs] [mOK: detectParts ((1 + 2) * (3 + 4) * (5 + 6))               == Left [1, 3, 2, 4, 5]
[2m[algebraic-graphs] [mOK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5)           == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
[2m[algebraic-graphs] [mOK: detectParts (1 * 2 * 3)                                 == Left [2, 3, 1]
[2m[algebraic-graphs] [mOK: detectParts ((1 * 3 * 4) + 2 * (1 + 2))                 == Left [2]
[2m[algebraic-graphs] [mOK: detectParts (clique [1..10])                            == Left [1, 2, 3]
[2m[algebraic-graphs] [mOK: detectParts (circuit [1..11])                           == Left [1..11]
[2m[algebraic-graphs] [mOK: detectParts (circuit [1..10])                           == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
[2m[algebraic-graphs] [mOK: detectParts (biclique [] xs)                            == Right (vertices xs [])
[2m[algebraic-graphs] [mOK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
[2m[algebraic-graphs] [mOK: isRight (detectParts (star x ys))                       == not (elem x ys)
[2m[algebraic-graphs] [mOK: isRight (detectParts (fromBipartite (toBipartite x)))   == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
[2m[algebraic-graphs] [mOK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [mOK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
[2m[algebraic-graphs] [mOK: show (matching [])                == "matching []"
[2m[algebraic-graphs] [mOK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
[2m[algebraic-graphs] [mOK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
[2m[algebraic-graphs] [mOK: pairOfLeft (matching [])                 == Map.empty
[2m[algebraic-graphs] [mOK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
[2m[algebraic-graphs] [mOK: Map.size . pairOfLeft                    == Map.size . pairOfRight
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
[2m[algebraic-graphs] [mOK: pairOfRight (matching [])                 == Map.empty
[2m[algebraic-graphs] [mOK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
[2m[algebraic-graphs] [mOK: Map.size . pairOfRight                    == Map.size . pairOfLeft
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.matching ============
[2m[algebraic-graphs] [mOK: matching [(1,'a'), (1,'b')]                   == matching [(1,'b')]
[2m[algebraic-graphs] [mOK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
[2m[algebraic-graphs] [mOK: isMatchingOf (matching []) x               == True
[2m[algebraic-graphs] [mOK: isMatchingOf (matching xs) empty           == null xs
[2m[algebraic-graphs] [mOK: isMatchingOf (matching [(x,y)]) (edge x y) == True
[2m[algebraic-graphs] [mOK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
[2m[algebraic-graphs] [mOK: matchingSize (matching [])                 == 0
[2m[algebraic-graphs] [mOK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
[2m[algebraic-graphs] [mOK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
[2m[algebraic-graphs] [mOK: matchingSize (matching xs)                 <= length xs
[2m[algebraic-graphs] [mOK: matchingSize x                             == Map.size . pairOfLeft
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
[2m[algebraic-graphs] [mOK: maxMatching empty                                          == matching []
[2m[algebraic-graphs] [mOK: maxMatching (vertices xs ys)                               == matching []
[2m[algebraic-graphs] [mOK: maxMatching (path [1,2,3,4])                               == matching [(1,2), (3,4)]
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (star x (y:ys)))                 == 1
[2m[algebraic-graphs] [mOK: matchingSize (maxMatching (biclique xs ys))                == min (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: isMatchingOf (maxMatching x) x                             == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
[2m[algebraic-graphs] [mOK: isVertexCoverOf (Set.empty      , Set.empty      ) (edge x y)     == False
[2m[algebraic-graphs] [mOK: isVertexCoverOf (Set.singleton x, ys             ) (edge x y)     == Set.isSubsetOf ys (Set.singleton y)
[2m[algebraic-graphs] [mOK: isVertexCoverOf (xs             , Set.singleton y) (edge x y)     == Set.isSubsetOf xs (Set.singleton x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
[2m[algebraic-graphs] [mOK: minVertexCover empty                              == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: minVertexCover (vertices xs ys)                   == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: minVertexCover (path [1,2,3])                     == (Set.empty, Set.singleton 2)
[2m[algebraic-graphs] [mOK: minVertexCover (star x (1:2:ys))                  == (Set.singleton x, Set.empty)
[2m[algebraic-graphs] [mOK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: vertexCoverSize . minVertexCover                  == matchingSize . maxMatching
[2m[algebraic-graphs] [mOK: isVertexCoverOf (minVertexCover x) x              == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (Set.empty      , Set.empty      ) (edge x y)     == True
[2m[algebraic-graphs] [mOK: isIndependentSetOf (Set.singleton x, ys             ) (edge x y)     == Set.null ys
[2m[algebraic-graphs] [mOK: isIndependentSetOf (xs             , Set.singleton y) (edge x y)     == Set.null xs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
[2m[algebraic-graphs] [mOK: maxIndependentSet empty                                 == (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: maxIndependentSet (vertices xs ys)                      == (Set.fromList xs, Set.fromList ys)
[2m[algebraic-graphs] [mOK: maxIndependentSet (path [1,2,3])                        == (Set.fromList [1,3], Set.empty)
[2m[algebraic-graphs] [mOK: maxIndependentSet (star x (1:2:ys))                     == (Set.empty, Set.fromList (1:2:ys))
[2m[algebraic-graphs] [mOK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
[2m[algebraic-graphs] [mOK: independentSetSize (maxIndependentSet x)                == vertexCount x - vertexCoverSize (minVertexCover x)
[2m[algebraic-graphs] [mOK: isIndependentSetOf (maxIndependentSet x) x              == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
[2m[algebraic-graphs] [mOK: augmentingPath (matching [])      empty            == Left (Set.empty, Set.empty)
[2m[algebraic-graphs] [mOK: augmentingPath (matching [])      (edge 1 2)       == Right [1,2]
[2m[algebraic-graphs] [mOK: augmentingPath (matching [(1,2)]) (path [1,2,3])   == Left (Set.empty, Set.singleton 2)
[2m[algebraic-graphs] [mOK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
[2m[algebraic-graphs] [mOK: isLeft (augmentingPath (maxMatching x) x)          == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
[2m[algebraic-graphs] [mOK: consistentMatching (matching xs)   == True
[2m[algebraic-graphs] [mOK: consistentMatching (maxMatching x) == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Eq ============
[2m[algebraic-graphs] [mOK: mempty /= literal ""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Ord ============
[2m[algebraic-graphs] [mOK: mempty <  literal ""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty mempty       == True
[2m[algebraic-graphs] [mOK: isEmpty (literal "") == False
[2m[algebraic-graphs] [mOK: isEmpty x            == (x == mempty)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.literal ============
[2m[algebraic-graphs] [mOK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
[2m[algebraic-graphs] [mOK: literal "I am just a string literal"  == "I am just a string literal"
[2m[algebraic-graphs] [mOK: render . literal                      == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.render ============
[2m[algebraic-graphs] [mOK: render (literal "al" <> literal "ga") == "alga"
[2m[algebraic-graphs] [mOK: render mempty                         == mempty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.<+> ============
[2m[algebraic-graphs] [mOK: x <+> mempty         == x
[2m[algebraic-graphs] [mOK: mempty <+> x         == x
[2m[algebraic-graphs] [mOK: x <+> (y <+> z)      == (x <+> y) <+> z
[2m[algebraic-graphs] [mOK: "name" <+> "surname" == "name surname"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.brackets ============
[2m[algebraic-graphs] [mOK: brackets "i"    == "[i]"
[2m[algebraic-graphs] [mOK: brackets mempty == "[]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.doubleQuotes ============
[2m[algebraic-graphs] [mOK: doubleQuotes "/path/with spaces"   == "\"/path/with spaces\""
[2m[algebraic-graphs] [mOK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.indent ============
[2m[algebraic-graphs] [mOK: indent 0        == id
[2m[algebraic-graphs] [mOK: indent 1 mempty == " "
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.unlines ============
[2m[algebraic-graphs] [mOK: unlines []                    == mempty
[2m[algebraic-graphs] [mOK: unlines [mempty]              == "\n"
[2m[algebraic-graphs] [mOK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.export ============
[2m[algebraic-graphs] [mOK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.export ============
[2m[algebraic-graphs] [mOK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m=========== Export.Dot.attributeQuoting ============
[2m[algebraic-graphs] [mOK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.exportAsIs ============
[2m[algebraic-graphs] [mOK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Export.Dot.exportViaShow ============
[2m[algebraic-graphs] [mOK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [mOK: Theorems of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.size ============
[2m[algebraic-graphs] [mOK: size empty         == 1
[2m[algebraic-graphs] [mOK: size (vertex x)    == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x             >= 1
[2m[algebraic-graphs] [mOK: size x             >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: size (removeEdge x y z)         <= 3 * size z
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [mOK: size (compose x y)                        <= edgeCount x + edgeCount y + 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.(===) ============
[2m[algebraic-graphs] [mOK:     x === x         == True
[2m[algebraic-graphs] [mOK:     x === x + empty == False
[2m[algebraic-graphs] [mOK: x + y === x + y     == True
[2m[algebraic-graphs] [mOK: 1 + 2 === 2 + 1     == False
[2m[algebraic-graphs] [mOK: x + y === x * y     == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.mesh ============
[2m[algebraic-graphs] [mOK: mesh xs     []    == empty
[2m[algebraic-graphs] [mOK: mesh []     ys    == empty
[2m[algebraic-graphs] [mOK: mesh [x]    [y]   == vertex (x, y)
[2m[algebraic-graphs] [mOK: mesh xs     ys    == box (path xs) (path ys)
[2m[algebraic-graphs] [mOK: mesh [1..3] "ab"  == <correct result>
[2m[algebraic-graphs] [mOK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.torus ============
[2m[algebraic-graphs] [mOK: torus xs     []    == empty
[2m[algebraic-graphs] [mOK: torus []     ys    == empty
[2m[algebraic-graphs] [mOK: torus [x]    [y]   == edge (x,y) (x,y)
[2m[algebraic-graphs] [mOK: torus xs     ys    == box (circuit xs) (circuit ys)
[2m[algebraic-graphs] [mOK: torus [1,2]  "ab"  == <correct result>
[2m[algebraic-graphs] [mOK: size (torus xs ys) == max 1 (3 * length xs * length ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.deBruijn ============
[2m[algebraic-graphs] [mOK:           deBruijn 0 xs               == edge [] []
[2m[algebraic-graphs] [mOK: n > 0 ==> deBruijn n []               == empty
[2m[algebraic-graphs] [mOK:           deBruijn 1 [0,1]            == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
[2m[algebraic-graphs] [mOK:           deBruijn 2 "0"              == edge "00" "00"
[2m[algebraic-graphs] [mOK:           deBruijn 2 "01"             == <correct result>
[2m[algebraic-graphs] [mOK:           transpose   (deBruijn n xs) == gmap reverse $ deBruijn n xs
[2m[algebraic-graphs] [mOK:           vertexCount (deBruijn n xs) == (length $ nub xs)^n
[2m[algebraic-graphs] [mOK: n > 0 ==> edgeCount   (deBruijn n xs) == (length $ nub xs)^(n + 1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.splitVertex ============
[2m[algebraic-graphs] [mOK: splitVertex x []                   == removeVertex x
[2m[algebraic-graphs] [mOK: splitVertex x [x]                  == id
[2m[algebraic-graphs] [mOK: splitVertex x [y]                  == replaceVertex x y
[2m[algebraic-graphs] [mOK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.bind ============
[2m[algebraic-graphs] [mOK: bind empty f         == empty
[2m[algebraic-graphs] [mOK: bind (vertex x) f    == f x
[2m[algebraic-graphs] [mOK: bind (edge x y) f    == connect (f x) (f y)
[2m[algebraic-graphs] [mOK: bind (vertices xs) f == overlays (map f xs)
[2m[algebraic-graphs] [mOK: bind x (const empty) == empty
[2m[algebraic-graphs] [mOK: bind x vertex        == x
[2m[algebraic-graphs] [mOK: bind (bind x f) g    == bind x (\y -> bind (f y) g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.simplify ============
[2m[algebraic-graphs] [mOK: simplify              == id
[2m[algebraic-graphs] [mOK: size (simplify x)     <= size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.box ============
[2m[algebraic-graphs] [mOK: box x y               ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z)   == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ())     ~~ x
[2m[algebraic-graphs] [mOK: box x empty           ~~ empty
[2m[algebraic-graphs] [mOK: box x (box y z)       ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y) == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y) == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.sparsify ============
[2m[algebraic-graphs] [mOK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
[2m[algebraic-graphs] [mOK: vertexCount (sparsify x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: edgeCount   (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [mOK: size        (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.sparsifyKL ============
[2m[algebraic-graphs] [mOK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
[2m[algebraic-graphs] [mOK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: length (edges    $ sparsifyKL n x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.context ============
[2m[algebraic-graphs] [mOK: context (const False) x                   == Nothing
[2m[algebraic-graphs] [mOK: context (== 1)        (edge 1 2)          == Just (Context [   ] [2  ])
[2m[algebraic-graphs] [mOK: context (== 2)        (edge 1 2)          == Just (Context [1  ] [   ])
[2m[algebraic-graphs] [mOK: context (const True ) (edge 1 2)          == Just (Context [1  ] [2  ])
[2m[algebraic-graphs] [mOK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.buildg ============
[2m[algebraic-graphs] [mOK: buildg (\e _ _ _ -> e)                                     == empty
[2m[algebraic-graphs] [mOK: buildg (\_ v _ _ -> v x)                                   == vertex x
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
[2m[algebraic-graphs] [mOK: buildg (\e v o _ -> foldr o e (map v xs))                  == vertices xs
[2m[algebraic-graphs] [mOK: buildg (\e v o c -> foldg e v o (flip c) g)                == transpose g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Internal.List ============
[2m[algebraic-graphs] [mOK: pure 1 <> pure 4 == [1, 4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Label ============
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Any: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Distance Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Capacity Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Minimum (Path Int): instances ============
[2m[algebraic-graphs] [mOK: LeftNearRing
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ PowerSet (Path Int): instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: Dioid
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Count Int: instances ============
[2m[algebraic-graphs] [mOK: Semiring
[2m[algebraic-graphs] [mOK: StarSemiring
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.consistent ============
[2m[algebraic-graphs] [mOK: arbitraryLabelledAdjacencyMap
[2m[algebraic-graphs] [mOK: empty
[2m[algebraic-graphs] [mOK: vertex
[2m[algebraic-graphs] [mOK: edge
[2m[algebraic-graphs] [mOK: overlay
[2m[algebraic-graphs] [mOK: connect
[2m[algebraic-graphs] [mOK: vertices
[2m[algebraic-graphs] [mOK: edges
[2m[algebraic-graphs] [mOK: overlays
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps
[2m[algebraic-graphs] [mOK: removeVertex
[2m[algebraic-graphs] [mOK: removeEdge
[2m[algebraic-graphs] [mOK: replaceVertex
[2m[algebraic-graphs] [mOK: replaceEdge
[2m[algebraic-graphs] [mOK: transpose
[2m[algebraic-graphs] [mOK: gmap
[2m[algebraic-graphs] [mOK: emap
[2m[algebraic-graphs] [mOK: induce
[2m[algebraic-graphs] [mOK: closure
[2m[algebraic-graphs] [mOK: reflexiveClosure
[2m[algebraic-graphs] [mOK: symmetricClosure
[2m[algebraic-graphs] [mOK: transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge e    x y              == connect e (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge zero x y              == vertices [x,y]
[2m[algebraic-graphs] [mOK: hasEdge   x y (edge e x y) == (e /= mempty)
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 2) == 2
[2m[algebraic-graphs] [mOK: x -<e>- y                  == edge e x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect e 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edges ============
[2m[algebraic-graphs] [mOK: edges []        == empty
[2m[algebraic-graphs] [mOK: edges [(e,x,y)] == edge e x y
[2m[algebraic-graphs] [mOK: edges           == overlays . map (\(e, x, y) -> edge e x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps []                                  == empty
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [(x, Map.empty)]                    == vertex x
[2m[algebraic-graphs] [mOK: fromAdjacencyMaps [(x, Map.singleton y e)]            == if e == zero then vertices [x,y] else edge e x y
[2m[algebraic-graphs] [mOK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty      x     ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x y              ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                         == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)         == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                    == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x)   == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge e x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y)     == (e /= zero)
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeLabel ============
[2m[algebraic-graphs] [mOK: edgeLabel x y empty         == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (vertex z)    == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y)  == e
[2m[algebraic-graphs] [mOK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty        == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x)   == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == zero then 0 else 1
[2m[algebraic-graphs] [mOK: edgeCount              == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty        == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)   == []
[2m[algebraic-graphs] [mOK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty        == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.skeleton ============
[2m[algebraic-graphs] [mOK: hasEdge x y == hasEdge x y . skeleton
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge e x x)     == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge e 1 2)     == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge e x y)     == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == gmap (\v -> if v == x then y else v)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.replaceEdge ============
[2m[algebraic-graphs] [mOK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
[2m[algebraic-graphs] [mOK: replaceEdge e x y (edge f x y)      == edge e x y
[2m[algebraic-graphs] [mOK: edgeLabel x y (replaceEdge e x y z) == e
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty        == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)   == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge e x y) == edge e y x
[2m[algebraic-graphs] [mOK: transpose . transpose  == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty        == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x)   == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge e x y) == edge e (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id             == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g     == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.emap ============
[2m[algebraic-graphs] [mOK: emap h empty           == empty
[2m[algebraic-graphs] [mOK: emap h (vertex x)      == vertex x
[2m[algebraic-graphs] [mOK: emap h (edge e x y)    == edge (h e) x y
[2m[algebraic-graphs] [mOK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap id                == id
[2m[algebraic-graphs] [mOK: emap g . emap h        == emap (g . h)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure empty         == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)    == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x x)  == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: closure               == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure               == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure     == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x x)       == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge e x y)        == edge e x y
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edge ============
[2m[algebraic-graphs] [mOK: edge e    x y              == connect e (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge zero x y              == vertices [x,y]
[2m[algebraic-graphs] [mOK: hasEdge   x y (edge e x y) == (e /= mempty)
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y) == e
[2m[algebraic-graphs] [mOK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount   (edge e 1 2) == 2
[2m[algebraic-graphs] [mOK: x -<e>- y                  == edge e x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
[2m[algebraic-graphs] [mOK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
[2m[algebraic-graphs] [mOK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect e 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edges ============
[2m[algebraic-graphs] [mOK: edges []        == empty
[2m[algebraic-graphs] [mOK: edges [(e,x,y)] == edge e x y
[2m[algebraic-graphs] [mOK: edges           == overlays . map (\(e, x, y) -> edge e x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty     vertex        connect             == id
[2m[algebraic-graphs] [mOK: foldg empty     vertex        (fmap flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1         (const 1)     (const (+))         == size
[2m[algebraic-graphs] [mOK: foldg True      (const False) (const (&&))        == isEmpty
[2m[algebraic-graphs] [mOK: foldg False     (== x)        (const (||))        == hasVertex x
[2m[algebraic-graphs] [mOK: foldg Set.empty Set.singleton (const Set.union)   == vertexSet
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.buildg ============
[2m[algebraic-graphs] [mOK: buildg (\e _ _ -> e)                                   == empty
[2m[algebraic-graphs] [mOK: buildg (\_ v _ -> v x)                                 == vertex x
[2m[algebraic-graphs] [mOK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
[2m[algebraic-graphs] [mOK: buildg (\e v c -> foldr (c zero) e (map v xs))         == vertices xs
[2m[algebraic-graphs] [mOK: buildg (\e v c -> foldg e v (flip c) g)                == transpose g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty      x     ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x) empty ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x y              ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                         == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)         == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                    == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x)   == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge e x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.size ============
[2m[algebraic-graphs] [mOK: size empty         == 1
[2m[algebraic-graphs] [mOK: size (vertex x)    == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x             >= 1
[2m[algebraic-graphs] [mOK: size x             >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge e x y)     == (e /= zero)
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeLabel ============
[2m[algebraic-graphs] [mOK: edgeLabel x y empty         == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (vertex z)    == zero
[2m[algebraic-graphs] [mOK: edgeLabel x y (edge e x y)  == e
[2m[algebraic-graphs] [mOK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty        == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x)   == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge e x y) == if e == zero then 0 else 1
[2m[algebraic-graphs] [mOK: edgeCount              == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty        == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)   == []
[2m[algebraic-graphs] [mOK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty        == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty        == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x)   == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge e 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge e x x)     == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge e 1 2)     == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge e x y)     == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == fmap (\v -> if v == x then y else v)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.replaceEdge ============
[2m[algebraic-graphs] [mOK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
[2m[algebraic-graphs] [mOK: replaceEdge e x y (edge f x y)      == edge e x y
[2m[algebraic-graphs] [mOK: edgeLabel x y (replaceEdge e x y z) == e
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty        == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)   == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge e x y) == edge e y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.fmap ============
[2m[algebraic-graphs] [mOK: fmap f empty        == empty
[2m[algebraic-graphs] [mOK: fmap f (vertex x)   == vertex (f x)
[2m[algebraic-graphs] [mOK: fmap f (edge e x y) == edge e (f x) (f y)
[2m[algebraic-graphs] [mOK: fmap id             == id
[2m[algebraic-graphs] [mOK: fmap f . fmap g     == fmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.emap ============
[2m[algebraic-graphs] [mOK: emap h empty           == empty
[2m[algebraic-graphs] [mOK: emap h (vertex x)      == vertex x
[2m[algebraic-graphs] [mOK: emap h (edge e x y)    == edge (h e) x y
[2m[algebraic-graphs] [mOK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
[2m[algebraic-graphs] [mOK: emap id                == id
[2m[algebraic-graphs] [mOK: emap g . emap h        == emap (g . h)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.closure ============
[2m[algebraic-graphs] [mOK: closure empty         == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)    == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x x)  == edge one x x
[2m[algebraic-graphs] [mOK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: closure               == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure               == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure     == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y) == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x x)       == edge one x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge e x y)        == edge e x y
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Labelled.Graph.context ============
[2m[algebraic-graphs] [mOK: context (const False) x                   == Nothing
[2m[algebraic-graphs] [mOK: context (== 1)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context []      [(e,2)])
[2m[algebraic-graphs] [mOK: context (== 2)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] []     )
[2m[algebraic-graphs] [mOK: context (const True ) (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
[2m[algebraic-graphs] [mOK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap ============
[2m[algebraic-graphs] [mOK: Axioms of non-empty graphs
[2m[algebraic-graphs] [mOK: Theorems of non-empty graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Ord (NonEmpty.AdjacencyMap a) ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Show (NonEmpty.AdjacencyMap a) ============
[2m[algebraic-graphs] [mOK: show (1         :: AdjacencyMap Int) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2     :: AdjacencyMap Int) == "vertices1 [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2     :: AdjacencyMap Int) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [mOK: show (vertex (-1)                             :: AdjacencyMap Int) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)               :: AdjacencyMap Int) == "vertices1 [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2)               :: AdjacencyMap Int) == "edge (-1) (-2)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
[2m[algebraic-graphs] [mOK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.toNonEmpty ============
[2m[algebraic-graphs] [mOK: toNonEmpty empty          == Nothing
[2m[algebraic-graphs] [mOK: toNonEmpty . fromNonEmpty == Just
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.fromNonEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty . fromNonEmpty    == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.overlay ============
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.connect ============
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertices1 ============
[2m[algebraic-graphs] [mOK: vertices1 [x]           == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices1 == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices1 == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edges1 ============
[2m[algebraic-graphs] [mOK: edges1 [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges1             == overlays1 . fmap (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges1 == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.overlays1 ============
[2m[algebraic-graphs] [mOK: overlays1 [x]   == x
[2m[algebraic-graphs] [mOK: overlays1 [x,y] == overlay x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.connects1 ============
[2m[algebraic-graphs] [mOK: connects1 [x]   == x
[2m[algebraic-graphs] [mOK: connects1 [x,y] == connect x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount x          >= 1
[2m[algebraic-graphs] [mOK: vertexCount            == length . vertexList1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexList1 ============
[2m[algebraic-graphs] [mOK: vertexList1 (vertex x)  == [x]
[2m[algebraic-graphs] [mOK: vertexList1 . vertices1 == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges1       == nub . sort . toList
[2m[algebraic-graphs] [mOK: edgeList . transpose    == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet . vertex    == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [mOK: vertexSet . clique1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.preSet ============
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.postSet ============
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.path1 ============
[2m[algebraic-graphs] [mOK: path1 [x]       == vertex x
[2m[algebraic-graphs] [mOK: path1 [x,y]     == edge x y
[2m[algebraic-graphs] [mOK: path1 . reverse == transpose . path1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.circuit1 ============
[2m[algebraic-graphs] [mOK: circuit1 [x]       == edge x x
[2m[algebraic-graphs] [mOK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit1 . reverse == transpose . circuit1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.clique1 ============
[2m[algebraic-graphs] [mOK: clique1 [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique1 [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
[2m[algebraic-graphs] [mOK: clique1 . reverse  == transpose . clique1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.biclique1 ============
[2m[algebraic-graphs] [mOK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges1 [(x,y), (x,z)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.stars1 ============
[2m[algebraic-graphs] [mOK: stars1 [(x, [] )]               == vertex x
[2m[algebraic-graphs] [mOK: stars1 [(x, [y])]               == edge x y
[2m[algebraic-graphs] [mOK: stars1 [(x, ys )]               == star x ys
[2m[algebraic-graphs] [mOK: stars1                          == overlays1 . fmap (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.removeVertex1 ============
[2m[algebraic-graphs] [mOK: removeVertex1 x (vertex x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x (edge x x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices1 [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.transpose ============
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.gmap ============
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.induce1 ============
[2m[algebraic-graphs] [mOK: induce1 (const True ) x == Just x
[2m[algebraic-graphs] [mOK: induce1 (const False) x == Nothing
[2m[algebraic-graphs] [mOK: induce1 (/= x)          == removeVertex1 x
[2m[algebraic-graphs] [mOK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.induceJust1 ============
[2m[algebraic-graphs] [mOK: induceJust1 (vertex Nothing)                               == Nothing
[2m[algebraic-graphs] [mOK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
[2m[algebraic-graphs] [mOK: induceJust1 . gmap Just                                    == Just
[2m[algebraic-graphs] [mOK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.closure ============
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges1 [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges1 [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.AdjacencyMap.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path1 $ nub xs)    == clique1 (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.============
[2m[algebraic-graphs] [mOK: Axioms of non-empty graphs
[2m[algebraic-graphs] [mOK: Theorems of non-empty graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Ord (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Functor (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: fmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: fmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: fmap id           == id
[2m[algebraic-graphs] [mOK: fmap f . fmap g   == fmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Monad (NonEmpty.Graph a) ============
[2m[algebraic-graphs] [mOK: (vertex x >>= f)     == f x
[2m[algebraic-graphs] [mOK: (edge x y >>= f)     == connect (f x) (f y)
[2m[algebraic-graphs] [mOK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
[2m[algebraic-graphs] [mOK: (x >>= vertex)       == x
[2m[algebraic-graphs] [mOK: ((x >>= f) >>= g)    == (x >>= (\y -> (f y) >>= g))
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.toNonEmpty ============
[2m[algebraic-graphs] [mOK: toNonEmpty empty       == Nothing
[2m[algebraic-graphs] [mOK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [mOK: size        (vertex x) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlay ============
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: size        (overlay x y) == size x        + size y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlay1 ============
[2m[algebraic-graphs] [mOK:                overlay1 empty x == x
[2m[algebraic-graphs] [mOK: x /= empty ==> overlay1 x     y == overlay (fromJust $ toNonEmpty x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.connect ============
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: size        (connect x y) == size x        + size y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertices1 ============
[2m[algebraic-graphs] [mOK: vertices1 [x]           == vertex x
[2m[algebraic-graphs] [mOK: hasVertex x . vertices1 == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices1 == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edges1 ============
[2m[algebraic-graphs] [mOK: edges1 [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges1             == overlays1 . fmap (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges1 == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.overlays1 ============
[2m[algebraic-graphs] [mOK: overlays1 [x]   == x
[2m[algebraic-graphs] [mOK: overlays1 [x,y] == overlay x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.connects1 ============
[2m[algebraic-graphs] [mOK: connects1 [x]   == x
[2m[algebraic-graphs] [mOK: connects1 [x,y] == connect x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.foldg1 ============
[2m[algebraic-graphs] [mOK: foldg1 vertex    overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg1 vertex    overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg1 (const 1) (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg1 (== x)    (||)    (||)           == hasVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.(===) ============
[2m[algebraic-graphs] [mOK:     x === x     == True
[2m[algebraic-graphs] [mOK: x + y === x + y == True
[2m[algebraic-graphs] [mOK: 1 + 2 === 2 + 1 == False
[2m[algebraic-graphs] [mOK: x + y === x * y == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.size ============
[2m[algebraic-graphs] [mOK: size (vertex x)    == 1
[2m[algebraic-graphs] [mOK: size (overlay x y) == size x + size y
[2m[algebraic-graphs] [mOK: size (connect x y) == size x + size y
[2m[algebraic-graphs] [mOK: size x             >= 1
[2m[algebraic-graphs] [mOK: size x             >= vertexCount x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: vertexCount x          >= 1
[2m[algebraic-graphs] [mOK: vertexCount            == length . vertexList1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexList1 ============
[2m[algebraic-graphs] [mOK: vertexList1 (vertex x)  == [x]
[2m[algebraic-graphs] [mOK: vertexList1 . vertices1 == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges1       == nub . sort . toList
[2m[algebraic-graphs] [mOK: edgeList . transpose    == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet . vertex    == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices1 == Set.fromList . toList
[2m[algebraic-graphs] [mOK: vertexSet . clique1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges1   == Set.fromList . toList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.path1 ============
[2m[algebraic-graphs] [mOK: path1 [x]       == vertex x
[2m[algebraic-graphs] [mOK: path1 [x,y]     == edge x y
[2m[algebraic-graphs] [mOK: path1 . reverse == transpose . path1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.circuit1 ============
[2m[algebraic-graphs] [mOK: circuit1 [x]       == edge x x
[2m[algebraic-graphs] [mOK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit1 . reverse == transpose . circuit1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.clique1 ============
[2m[algebraic-graphs] [mOK: clique1 [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique1 [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
[2m[algebraic-graphs] [mOK: clique1 . reverse  == transpose . clique1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.biclique1 ============
[2m[algebraic-graphs] [mOK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges1 [(x,y), (x,z)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.stars1 ============
[2m[algebraic-graphs] [mOK: stars1 [(x, [] )]               == vertex x
[2m[algebraic-graphs] [mOK: stars1 [(x, [y])]               == edge x y
[2m[algebraic-graphs] [mOK: stars1 [(x, ys )]               == star x ys
[2m[algebraic-graphs] [mOK: stars1                          == overlays1 . fmap (uncurry star)
[2m[algebraic-graphs] [mOK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.mesh1 ============
[2m[algebraic-graphs] [mOK: mesh1 [x]     [y]        == vertex (x, y)
[2m[algebraic-graphs] [mOK: mesh1 xs      ys         == box (path1 xs) (path1 ys)
[2m[algebraic-graphs] [mOK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
[2m[algebraic-graphs] [mOK: size (mesh xs ys)        == max 1 (3 * length xs * length ys - length xs - length ys -1)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.torus1 ============
[2m[algebraic-graphs] [mOK: torus1 [x]   [y]        == edge (x,y) (x,y)
[2m[algebraic-graphs] [mOK: torus1 xs    ys         == box (circuit1 xs) (circuit1 ys)
[2m[algebraic-graphs] [mOK: torus1 [1,2] ['a', 'b'] == <correct result>
[2m[algebraic-graphs] [mOK: size (torus1 xs ys)     == max 1 (3 * length xs * length ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.removeVertex1 ============
[2m[algebraic-graphs] [mOK: removeVertex1 x (vertex x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x (edge x x)          == Nothing
[2m[algebraic-graphs] [mOK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
[2m[algebraic-graphs] [mOK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices1 [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: size (removeEdge x y z)         <= 3 * size z
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.splitVertex1 ============
[2m[algebraic-graphs] [mOK: splitVertex1 x [x]                 == id
[2m[algebraic-graphs] [mOK: splitVertex1 x [y]                 == replaceVertex x y
[2m[algebraic-graphs] [mOK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.transpose ============
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: transpose (box x y)   == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.induce1 ============
[2m[algebraic-graphs] [mOK: induce1 (const True ) x == Just x
[2m[algebraic-graphs] [mOK: induce1 (const False) x == Nothing
[2m[algebraic-graphs] [mOK: induce1 (/= x)          == removeVertex1 x
[2m[algebraic-graphs] [mOK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.induceJust1 ============
[2m[algebraic-graphs] [mOK: induceJust1 (vertex Nothing)                               == Nothing
[2m[algebraic-graphs] [mOK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
[2m[algebraic-graphs] [mOK: induceJust1 . fmap Just                                    == Just
[2m[algebraic-graphs] [mOK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.simplify ============
[2m[algebraic-graphs] [mOK: simplify             ==  id
[2m[algebraic-graphs] [mOK: size (simplify x)    <=  size x
[2m[algebraic-graphs] [mOK: simplify 1           === 1
[2m[algebraic-graphs] [mOK: simplify (1 + 1)     === 1
[2m[algebraic-graphs] [mOK: simplify (1 + 2 + 1) === 1 + 2
[2m[algebraic-graphs] [mOK: simplify (1 * 1 * 1) === 1 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.sparsify ============
[2m[algebraic-graphs] [mOK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
[2m[algebraic-graphs] [mOK: vertexCount (sparsify x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: edgeCount   (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [mOK: size        (sparsify x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.sparsifyKL ============
[2m[algebraic-graphs] [mOK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
[2m[algebraic-graphs] [mOK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
[2m[algebraic-graphs] [mOK: length (edges    $ sparsifyKL n x) <= 3 * size x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ NonEmpty.Graph.box ============
[2m[algebraic-graphs] [mOK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
[2m[algebraic-graphs] [mOK: box x y                             ~~ box y x
[2m[algebraic-graphs] [mOK: box x (overlay y z)                 == overlay (box x y) (box x z)
[2m[algebraic-graphs] [mOK: box x (vertex ())                   ~~ x
[2m[algebraic-graphs] [mOK: box x (box y z)                     ~~ box (box x y) z
[2m[algebraic-graphs] [mOK: transpose   (box x y)               == box (transpose x) (transpose y)
[2m[algebraic-graphs] [mOK: vertexCount (box x y)               == vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (box x y)               <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation ============
[2m[algebraic-graphs] [mOK: Axioms of graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 3
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.connect ============
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edges ============
[2m[algebraic-graphs] [mOK: edges []          == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]     == edge x y
[2m[algebraic-graphs] [mOK: edges             == overlays . map (uncurry edge)
[2m[algebraic-graphs] [mOK: edgeCount . edges == length . nub
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
[2m[algebraic-graphs] [mOK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.foldg ============
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay connect        == id
[2m[algebraic-graphs] [mOK: foldg empty vertex        overlay (flip connect) == transpose
[2m[algebraic-graphs] [mOK: foldg 1     (const 1)     (+)     (+)            == size
[2m[algebraic-graphs] [mOK: foldg True  (const False) (&&)    (&&)           == isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (x,y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(x,y)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
[2m[algebraic-graphs] [mOK: edgeList . edges        == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (x,y)
[2m[algebraic-graphs] [mOK: edgeSet . edges    == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.preSet ============
[2m[algebraic-graphs] [mOK: preSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: preSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: preSet 1 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [mOK: preSet y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.preIntSet ============
[2m[algebraic-graphs] [mOK: preIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet 1 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: preIntSet y (edge x y) == IntSet.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.postSet ============
[2m[algebraic-graphs] [mOK: postSet x empty      == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: postSet x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: postSet 2 (edge 1 2) == Set.empty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.postIntSet ============
[2m[algebraic-graphs] [mOK: postIntSet x empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (vertex x) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet 2 (edge 1 2) == IntSet.empty
[2m[algebraic-graphs] [mOK: postIntSet x (edge x y) == IntSet.fromList [y]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.transpose ============
[2m[algebraic-graphs] [mOK: transpose empty       == empty
[2m[algebraic-graphs] [mOK: transpose (vertex x)  == vertex x
[2m[algebraic-graphs] [mOK: transpose (edge x y)  == edge y x
[2m[algebraic-graphs] [mOK: transpose . transpose == id
[2m[algebraic-graphs] [mOK: edgeList . transpose  == sort . map swap . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.compose ============
[2m[algebraic-graphs] [mOK: compose empty            x                == empty
[2m[algebraic-graphs] [mOK: compose x                empty            == empty
[2m[algebraic-graphs] [mOK: compose (vertex x)       y                == empty
[2m[algebraic-graphs] [mOK: compose x                (vertex y)       == empty
[2m[algebraic-graphs] [mOK: compose x                (compose y z)    == compose (compose x y) z
[2m[algebraic-graphs] [mOK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
[2m[algebraic-graphs] [mOK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
[2m[algebraic-graphs] [mOK: compose (edge x y)       (edge y z)       == edge x z
[2m[algebraic-graphs] [mOK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
[2m[algebraic-graphs] [mOK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.closure ============
[2m[algebraic-graphs] [mOK: closure empty           == empty
[2m[algebraic-graphs] [mOK: closure (vertex x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x x)      == edge x x
[2m[algebraic-graphs] [mOK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
[2m[algebraic-graphs] [mOK: closure                 == reflexiveClosure . transitiveClosure
[2m[algebraic-graphs] [mOK: closure                 == transitiveClosure . reflexiveClosure
[2m[algebraic-graphs] [mOK: closure . closure       == closure
[2m[algebraic-graphs] [mOK: postSet x (closure y)   == Set.fromList (reachable y x)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.reflexiveClosure ============
[2m[algebraic-graphs] [mOK: reflexiveClosure empty              == empty
[2m[algebraic-graphs] [mOK: reflexiveClosure (vertex x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x x)         == edge x x
[2m[algebraic-graphs] [mOK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
[2m[algebraic-graphs] [mOK: reflexiveClosure . reflexiveClosure == reflexiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.symmetricClosure ============
[2m[algebraic-graphs] [mOK: symmetricClosure empty              == empty
[2m[algebraic-graphs] [mOK: symmetricClosure (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: symmetricClosure x                  == overlay x (transpose x)
[2m[algebraic-graphs] [mOK: symmetricClosure . symmetricClosure == symmetricClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.transitiveClosure ============
[2m[algebraic-graphs] [mOK: transitiveClosure empty               == empty
[2m[algebraic-graphs] [mOK: transitiveClosure (vertex x)          == vertex x
[2m[algebraic-graphs] [mOK: transitiveClosure (edge x y)          == edge x y
[2m[algebraic-graphs] [mOK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
[2m[algebraic-graphs] [mOK: transitiveClosure . transitiveClosure == transitiveClosure
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Relation.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ ReflexiveRelation ============
[2m[algebraic-graphs] [mOK: Axioms of reflexive graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ TransitiveRelation ============
[2m[algebraic-graphs] [mOK: Axioms of transitive graphs
[2m[algebraic-graphs] [mOK: path xs == (clique xs :: TransitiveRelation Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ PreorderRelation ============
[2m[algebraic-graphs] [mOK: Axioms of preorder graphs
[2m[algebraic-graphs] [mOK: path xs == (clique xs :: PreorderRelation Int)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation ============
[2m[algebraic-graphs] [mOK: Axioms of undirected graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.consistent ============
[2m[algebraic-graphs] [mOK: Consistency of the Arbitrary instance
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: consistent empty         == True
[2m[algebraic-graphs] [mOK: consistent (vertex x)    == True
[2m[algebraic-graphs] [mOK: consistent (overlay x y) == True
[2m[algebraic-graphs] [mOK: consistent (connect x y) == True
[2m[algebraic-graphs] [mOK: consistent (edge x y)    == True
[2m[algebraic-graphs] [mOK: consistent (edges xs)    == True
[2m[algebraic-graphs] [mOK: consistent (stars xs)    == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (2 * 1    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
[2m[algebraic-graphs] [mOK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.toSymmetric ============
[2m[algebraic-graphs] [mOK: toSymmetric (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: toSymmetric . fromSymmetric    == id
[2m[algebraic-graphs] [mOK: fromSymmetric    . toSymmetric == symmetricClosure
[2m[algebraic-graphs] [mOK: vertexCount      . toSymmetric == vertexCount
[2m[algebraic-graphs] [mOK: (*2) . edgeCount . toSymmetric >= edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.fromSymmetric ============
[2m[algebraic-graphs] [mOK: fromSymmetric (edge 1 2)    == edges [(1,2), (2,1)]
[2m[algebraic-graphs] [mOK: vertexCount . fromSymmetric == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount   . fromSymmetric <= (*2) . edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 2 1 <  edge 1 3
[2m[algebraic-graphs] [mOK: edge 1 2 == edge 2 1
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge x y               == edge y x
[2m[algebraic-graphs] [mOK: edge x y               == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.connect ============
[2m[algebraic-graphs] [mOK: connect x y               == connect y x
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edges ============
[2m[algebraic-graphs] [mOK: edges []             == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]        == edge x y
[2m[algebraic-graphs] [mOK: edges [(x,y), (y,x)] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [mOK: connects           == connects . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [mOK: isSubgraphOf (edge x y) (edge y x)       ==  True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.toGraph et al. ============
[2m[algebraic-graphs] [mOK: toGraph                    == foldg Empty Vertex Overlay Connect
[2m[algebraic-graphs] [mOK: foldg                      == Algebra.Graph.foldg . toGraph
[2m[algebraic-graphs] [mOK: isEmpty                    == foldg True (const False) (&&) (&&)
[2m[algebraic-graphs] [mOK: size                       == foldg 1 (const 1) (+) (+)
[2m[algebraic-graphs] [mOK: hasVertex x                == foldg False (==x) (||) (||)
[2m[algebraic-graphs] [mOK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
[2m[algebraic-graphs] [mOK: vertexCount                == Set.size . vertexSet
[2m[algebraic-graphs] [mOK: edgeCount                  == Set.size . edgeSet
[2m[algebraic-graphs] [mOK: vertexList                 == Set.toAscList . vertexSet
[2m[algebraic-graphs] [mOK: edgeList                   == Set.toAscList . edgeSet
[2m[algebraic-graphs] [mOK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
[2m[algebraic-graphs] [mOK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
[2m[algebraic-graphs] [mOK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
[2m[algebraic-graphs] [mOK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
[2m[algebraic-graphs] [mOK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
[2m[algebraic-graphs] [mOK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
[2m[algebraic-graphs] [mOK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
[2m[algebraic-graphs] [mOK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
[2m[algebraic-graphs] [mOK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [mOK: toAdjacencyMap             == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: toAdjacencyIntMap          == foldg empty vertex overlay connect
[2m[algebraic-graphs] [mOK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
[2m[algebraic-graphs] [mOK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
[2m[algebraic-graphs] [mOK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.isEmpty ============
[2m[algebraic-graphs] [mOK: isEmpty empty                       == True
[2m[algebraic-graphs] [mOK: isEmpty (overlay empty empty)       == True
[2m[algebraic-graphs] [mOK: isEmpty (vertex x)                  == False
[2m[algebraic-graphs] [mOK: isEmpty (removeVertex x $ vertex x) == True
[2m[algebraic-graphs] [mOK: isEmpty (removeEdge x y $ edge x y) == False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.hasVertex ============
[2m[algebraic-graphs] [mOK: hasVertex x empty            == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y)       == (x == y)
[2m[algebraic-graphs] [mOK: hasVertex x . removeVertex x == const False
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.hasEdge ============
[2m[algebraic-graphs] [mOK: hasEdge x y empty            == False
[2m[algebraic-graphs] [mOK: hasEdge x y (vertex z)       == False
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y (edge y x)       == True
[2m[algebraic-graphs] [mOK: hasEdge x y . removeEdge x y == const False
[2m[algebraic-graphs] [mOK: hasEdge x y                  == elem (min x y, max x y) . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexCount ============
[2m[algebraic-graphs] [mOK: vertexCount empty             ==  0
[2m[algebraic-graphs] [mOK: vertexCount (vertex x)        ==  1
[2m[algebraic-graphs] [mOK: vertexCount                   ==  length . vertexList
[2m[algebraic-graphs] [mOK: vertexCount x < vertexCount y ==> x < y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeCount ============
[2m[algebraic-graphs] [mOK: edgeCount empty      == 0
[2m[algebraic-graphs] [mOK: edgeCount (vertex x) == 0
[2m[algebraic-graphs] [mOK: edgeCount (edge x y) == 1
[2m[algebraic-graphs] [mOK: edgeCount            == length . edgeList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexList ============
[2m[algebraic-graphs] [mOK: vertexList empty      == []
[2m[algebraic-graphs] [mOK: vertexList (vertex x) == [x]
[2m[algebraic-graphs] [mOK: vertexList . vertices == nub . sort
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexSet ============
[2m[algebraic-graphs] [mOK: vertexSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: vertexSet . vertex   == Set.singleton
[2m[algebraic-graphs] [mOK: vertexSet . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.vertexIntSet ============
[2m[algebraic-graphs] [mOK: vertexIntSet empty      == IntSet.empty
[2m[algebraic-graphs] [mOK: vertexIntSet . vertex   == IntSet.singleton
[2m[algebraic-graphs] [mOK: vertexIntSet . vertices == IntSet.fromList
[2m[algebraic-graphs] [mOK: vertexIntSet . clique   == IntSet.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeList ============
[2m[algebraic-graphs] [mOK: edgeList empty          == []
[2m[algebraic-graphs] [mOK: edgeList (vertex x)     == []
[2m[algebraic-graphs] [mOK: edgeList (edge x y)     == [(min x y, max y x)]
[2m[algebraic-graphs] [mOK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.edgeSet ============
[2m[algebraic-graphs] [mOK: edgeSet empty      == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.adjacencyList ============
[2m[algebraic-graphs] [mOK: adjacencyList empty          == []
[2m[algebraic-graphs] [mOK: adjacencyList (vertex x)     == [(x, [])]
[2m[algebraic-graphs] [mOK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [1])]
[2m[algebraic-graphs] [mOK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.neighbours ============
[2m[algebraic-graphs] [mOK: neighbours x empty      == Set.empty
[2m[algebraic-graphs] [mOK: neighbours x (vertex x) == Set.empty
[2m[algebraic-graphs] [mOK: neighbours x (edge x y) == Set.fromList [y]
[2m[algebraic-graphs] [mOK: neighbours y (edge x y) == Set.fromList [x]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path       == path . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit       == circuit . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [mOK: clique            == clique . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge x y                  == removeEdge y x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Symmetric.Relation.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Example.Todo (Holiday) ============
[2m[algebraic-graphs] [mOK: A todo list is semantically Maybe [a]
[2m[algebraic-graphs] [mOK: The overlay operator (+) adds non-dependent items to the todo list
[2m[algebraic-graphs] [mOK: The connect operator (*) adds dependency between items
[2m[algebraic-graphs] [mOK: Contradictory constraints make the todo list impossible to schedule
[2m[algebraic-graphs] [mOK: Introduce item priority to schedule the todo list
[2m[algebraic-graphs] [mOK: Custom connect operators pull/repel arguments during scheduling
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Example.Todo (Commandline) ============
[2m[algebraic-graphs] [mOK: The pull connect operator maintains command line semantics
[2m[algebraic-graphs] [mOK: Swapping flags are allowed by the commutative overlay opeartor
[2m[algebraic-graphs] [mOK: The usual connect operator breaks semantics
[2m[algebraic-graphs] [mOK: Transform command lines by adding optimisation flag
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed ============
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.fromAdjacencyMap ============
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1))                                == array (0,2) [(0,[1]), (1,[]), (2,[0])]
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1))                                == array (0,1) [(0,[1]), (1,[0])]
[2m[algebraic-graphs] [mOK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == vertexList g
[2m[algebraic-graphs] [mOK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.fromAdjacencyIntMap ============
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1))                             == array (0,2) [(0,[1]), (1,[]), (2,[0])]
[2m[algebraic-graphs] [mOK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1))                             == array (0,1) [(0,[1]), (1,[0])]
[2m[algebraic-graphs] [mOK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == IntSet.toAscList (vertexIntSet g)
[2m[algebraic-graphs] [mOK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfsForest ============
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 1 1)           == vertex 1
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 1 2)           == edge 1 2
[2m[algebraic-graphs] [mOK: forest (dfsForest % edge 2 1)           == vertices [1, 2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForest % x) x == True
[2m[algebraic-graphs] [mOK: dfsForest % forest (dfsForest % x)      == dfsForest % x
[2m[algebraic-graphs] [mOK: dfsForest % vertices vs                 == map (\v -> Node v []) (nub $ sort vs)
[2m[algebraic-graphs] [mOK: dfsForest % (3 * (1 + 4) * (1 + 5))     == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfsForestFrom ============
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 1) [1]         == vertex 1
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [0]         == empty
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [1]         == edge 1 2
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [2]         == vertex 2
[2m[algebraic-graphs] [mOK: forest $ (dfsForestFrom % edge 1 2) [2,1]       == vertices [1,2]
[2m[algebraic-graphs] [mOK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
[2m[algebraic-graphs] [mOK: dfsForestFrom % x $ vertexList x                == dfsForest % x
[2m[algebraic-graphs] [mOK: dfsForestFrom % vertices vs $ vs                == map (\v -> Node v []) (nub vs)
[2m[algebraic-graphs] [mOK: dfsForestFrom % x $ []                          == []
[2m[algebraic-graphs] [mOK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.dfs ============
[2m[algebraic-graphs] [mOK: dfs % edge 1 1 $ [1]   == [1]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [0]   == []
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [1]   == [1,2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [2]   == [2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [1,2] == [1,2]
[2m[algebraic-graphs] [mOK: dfs % edge 1 2 $ [2,1] == [2,1]
[2m[algebraic-graphs] [mOK: dfs % x        $ []    == []
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4]     == [1,5,4]
[2m[algebraic-graphs] [mOK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Typed.topSort ============
[2m[algebraic-graphs] [mOK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
[2m[algebraic-graphs] [mOK: topSort % (1 * 2 + 2 * 1) == [1,2]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected ============
[2m[algebraic-graphs] [mOK: Axioms of undirected graphs
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.Show ============
[2m[algebraic-graphs] [mOK: show (empty    ) == "empty"
[2m[algebraic-graphs] [mOK: show (1        ) == "vertex 1"
[2m[algebraic-graphs] [mOK: show (1 + 2    ) == "vertices [1,2]"
[2m[algebraic-graphs] [mOK: show (1 * 2    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [mOK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (vertex (-1)                            ) == "vertex (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
[2m[algebraic-graphs] [mOK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
[2m[algebraic-graphs] [mOK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [mOK: show (2 * 1    ) == "edge 1 2"
[2m[algebraic-graphs] [mOK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
[2m[algebraic-graphs] [mOK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.toUndirected ============
[2m[algebraic-graphs] [mOK: toUndirected (edge 1 2)         == edge 1 2
[2m[algebraic-graphs] [mOK: toUndirected . fromUndirected   == id
[2m[algebraic-graphs] [mOK: vertexCount      . toUndirected == vertexCount
[2m[algebraic-graphs] [mOK: (*2) . edgeCount . toUndirected >= edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.fromUndirected ============
[2m[algebraic-graphs] [mOK: fromUndirected (edge 1 2)    == edges [(1,2),(2,1)]
[2m[algebraic-graphs] [mOK: toUndirected . fromUndirected == id
[2m[algebraic-graphs] [mOK: vertexCount . fromUndirected == vertexCount
[2m[algebraic-graphs] [mOK: edgeCount   . fromUndirected <= (*2) . edgeCount
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.complement ================
[2m[algebraic-graphs] [mOK: complement empty              == empty
[2m[algebraic-graphs] [mOK: complement (vertex x)         == vertex x
[2m[algebraic-graphs] [mOK: complement (edge 1 1)         == edge 1 1
[2m[algebraic-graphs] [mOK: complement (edge 1 2)         == vertices [1, 2]
[2m[algebraic-graphs] [mOK: complement (star 1 [2, 3])    == overlay (vertex 1) (edge 2 3)
[2m[algebraic-graphs] [mOK: complement . complement       == id
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.Ord ============
[2m[algebraic-graphs] [mOK: vertex 1 <  vertex 2
[2m[algebraic-graphs] [mOK: vertex 3 <  edge 1 2
[2m[algebraic-graphs] [mOK: vertex 1 <  edge 1 1
[2m[algebraic-graphs] [mOK: edge 1 1 <  edge 1 2
[2m[algebraic-graphs] [mOK: edge 1 2 <  edge 1 1 + edge 2 2
[2m[algebraic-graphs] [mOK: edge 2 1 <  edge 1 3
[2m[algebraic-graphs] [mOK: edge 1 2 == edge 2 1
[2m[algebraic-graphs] [mOK: x        <= x + y
[2m[algebraic-graphs] [mOK: x + y    <= x * y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.empty ============
[2m[algebraic-graphs] [mOK: isEmpty     empty == True
[2m[algebraic-graphs] [mOK: hasVertex x empty == False
[2m[algebraic-graphs] [mOK: vertexCount empty == 0
[2m[algebraic-graphs] [mOK: edgeCount   empty == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.vertex ============
[2m[algebraic-graphs] [mOK: isEmpty     (vertex x) == False
[2m[algebraic-graphs] [mOK: hasVertex x (vertex y) == (x == y)
[2m[algebraic-graphs] [mOK: vertexCount (vertex x) == 1
[2m[algebraic-graphs] [mOK: edgeCount   (vertex x) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.edge ============
[2m[algebraic-graphs] [mOK: edge x y               == connect (vertex x) (vertex y)
[2m[algebraic-graphs] [mOK: edge x y               == edge y x
[2m[algebraic-graphs] [mOK: edge x y               == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: hasEdge x y (edge x y) == True
[2m[algebraic-graphs] [mOK: edgeCount   (edge x y) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 1) == 1
[2m[algebraic-graphs] [mOK: vertexCount (edge 1 2) == 2
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.overlay ============
[2m[algebraic-graphs] [mOK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (overlay 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (overlay 1 2) == 0
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.connect ============
[2m[algebraic-graphs] [mOK: connect x y               == connect y x
[2m[algebraic-graphs] [mOK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
[2m[algebraic-graphs] [mOK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) >= vertexCount x
[2m[algebraic-graphs] [mOK: vertexCount (connect x y) <= vertexCount x + vertexCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount x
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= edgeCount y
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
[2m[algebraic-graphs] [mOK: vertexCount (connect 1 2) == 2
[2m[algebraic-graphs] [mOK: edgeCount   (connect 1 2) == 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.vertices ============
[2m[algebraic-graphs] [mOK: vertices []            == empty
[2m[algebraic-graphs] [mOK: vertices [x]           == vertex x
[2m[algebraic-graphs] [mOK: vertices               == overlays . map vertex
[2m[algebraic-graphs] [mOK: hasVertex x . vertices == elem x
[2m[algebraic-graphs] [mOK: vertexCount . vertices == length . nub
[2m[algebraic-graphs] [mOK: vertexSet   . vertices == Set.fromList
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.edges ============
[2m[algebraic-graphs] [mOK: edges []             == empty
[2m[algebraic-graphs] [mOK: edges [(x,y)]        == edge x y
[2m[algebraic-graphs] [mOK: edges [(x,y), (y,x)] == edge x y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.overlays ============
[2m[algebraic-graphs] [mOK: overlays []        == empty
[2m[algebraic-graphs] [mOK: overlays [x]       == x
[2m[algebraic-graphs] [mOK: overlays [x,y]     == overlay x y
[2m[algebraic-graphs] [mOK: overlays           == foldr overlay empty
[2m[algebraic-graphs] [mOK: isEmpty . overlays == all isEmpty
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.connects ============
[2m[algebraic-graphs] [mOK: connects []        == empty
[2m[algebraic-graphs] [mOK: connects [x]       == x
[2m[algebraic-graphs] [mOK: connects [x,y]     == connect x y
[2m[algebraic-graphs] [mOK: connects           == foldr connect empty
[2m[algebraic-graphs] [mOK: isEmpty . connects == all isEmpty
[2m[algebraic-graphs] [mOK: connects           == connects . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.isSubgraphOf ============
[2m[algebraic-graphs] [mOK: isSubgraphOf empty         x             ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (vertex x)    empty         ==  False
[2m[algebraic-graphs] [mOK: isSubgraphOf x             (overlay x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (overlay x y) (connect x y) ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf (path xs)     (circuit xs)  ==  True
[2m[algebraic-graphs] [mOK: isSubgraphOf x y                         ==> x <= y
[2m[algebraic-graphs] [mOK: isSubgraphOf (edge x y) (edge y x)       ==  True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.path ============
[2m[algebraic-graphs] [mOK: path []    == empty
[2m[algebraic-graphs] [mOK: path [x]   == vertex x
[2m[algebraic-graphs] [mOK: path [x,y] == edge x y
[2m[algebraic-graphs] [mOK: path       == path . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.circuit ============
[2m[algebraic-graphs] [mOK: circuit []    == empty
[2m[algebraic-graphs] [mOK: circuit [x]   == edge x x
[2m[algebraic-graphs] [mOK: circuit [x,y] == edges [(x,y), (y,x)]
[2m[algebraic-graphs] [mOK: circuit       == circuit . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.clique ============
[2m[algebraic-graphs] [mOK: clique []         == empty
[2m[algebraic-graphs] [mOK: clique [x]        == vertex x
[2m[algebraic-graphs] [mOK: clique [x,y]      == edge x y
[2m[algebraic-graphs] [mOK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
[2m[algebraic-graphs] [mOK: clique (xs ++ ys) == connect (clique xs) (clique ys)
[2m[algebraic-graphs] [mOK: clique            == clique . reverse
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.biclique ============
[2m[algebraic-graphs] [mOK: biclique []      []      == empty
[2m[algebraic-graphs] [mOK: biclique [x]     []      == vertex x
[2m[algebraic-graphs] [mOK: biclique []      [y]     == vertex y
[2m[algebraic-graphs] [mOK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
[2m[algebraic-graphs] [mOK: biclique xs      ys      == connect (vertices xs) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.star ============
[2m[algebraic-graphs] [mOK: star x []    == vertex x
[2m[algebraic-graphs] [mOK: star x [y]   == edge x y
[2m[algebraic-graphs] [mOK: star x [y,z] == edges [(x,y), (x,z)]
[2m[algebraic-graphs] [mOK: star x ys    == connect (vertex x) (vertices ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.stars ============
[2m[algebraic-graphs] [mOK: stars []                      == empty
[2m[algebraic-graphs] [mOK: stars [(x, [])]               == vertex x
[2m[algebraic-graphs] [mOK: stars [(x, [y])]              == edge x y
[2m[algebraic-graphs] [mOK: stars [(x, ys)]               == star x ys
[2m[algebraic-graphs] [mOK: stars                         == overlays . map (uncurry star)
[2m[algebraic-graphs] [mOK: stars . adjacencyList         == id
[2m[algebraic-graphs] [mOK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.tree ============
[2m[algebraic-graphs] [mOK: tree (Node x [])                                         == vertex x
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
[2m[algebraic-graphs] [mOK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
[2m[algebraic-graphs] [mOK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.forest ============
[2m[algebraic-graphs] [mOK: forest []                                                  == empty
[2m[algebraic-graphs] [mOK: forest [x]                                                 == tree x
[2m[algebraic-graphs] [mOK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
[2m[algebraic-graphs] [mOK: forest                                                     == overlays . map tree
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.removeVertex ============
[2m[algebraic-graphs] [mOK: removeVertex x (vertex x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (vertex 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x (edge x x)       == empty
[2m[algebraic-graphs] [mOK: removeVertex 1 (edge 1 2)       == vertex 2
[2m[algebraic-graphs] [mOK: removeVertex x . removeVertex x == removeVertex x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.removeEdge ============
[2m[algebraic-graphs] [mOK: removeEdge x y (edge x y)       == vertices [x,y]
[2m[algebraic-graphs] [mOK: removeEdge x y . removeEdge x y == removeEdge x y
[2m[algebraic-graphs] [mOK: removeEdge x y . removeVertex x == removeVertex x
[2m[algebraic-graphs] [mOK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
[2m[algebraic-graphs] [mOK: removeEdge x y                  == removeEdge y x
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.replaceVertex ============
[2m[algebraic-graphs] [mOK: replaceVertex x x            == id
[2m[algebraic-graphs] [mOK: replaceVertex x y (vertex x) == vertex y
[2m[algebraic-graphs] [mOK: replaceVertex x y            == mergeVertices (== x) y
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.mergeVertices ============
[2m[algebraic-graphs] [mOK: mergeVertices (const False) x    == id
[2m[algebraic-graphs] [mOK: mergeVertices (== x) y           == replaceVertex x y
[2m[algebraic-graphs] [mOK: mergeVertices even 1 (0 * 2)     == 1 * 1
[2m[algebraic-graphs] [mOK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.gmap ============
[2m[algebraic-graphs] [mOK: gmap f empty      == empty
[2m[algebraic-graphs] [mOK: gmap f (vertex x) == vertex (f x)
[2m[algebraic-graphs] [mOK: gmap f (edge x y) == edge (f x) (f y)
[2m[algebraic-graphs] [mOK: gmap id           == id
[2m[algebraic-graphs] [mOK: gmap f . gmap g   == gmap (f . g)
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.induce ============
[2m[algebraic-graphs] [mOK: induce (const True ) x      == x
[2m[algebraic-graphs] [mOK: induce (const False) x      == empty
[2m[algebraic-graphs] [mOK: induce (/= x)               == removeVertex x
[2m[algebraic-graphs] [mOK: induce p . induce q         == induce (\x -> p x && q x)
[2m[algebraic-graphs] [mOK: isSubgraphOf (induce p x) x == True
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m============ Graph.Undirected.induceJust ============
[2m[algebraic-graphs] [mOK: induceJust (vertex Nothing)                               == empty
[2m[algebraic-graphs] [mOK: induceJust (edge (Just x) Nothing)                        == vertex x
[2m[algebraic-graphs] [mOK: induceJust . gmap Just                                    == id
[2m[algebraic-graphs] [mOK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
[2m[algebraic-graphs] [mTest suite main: PASS
[2m[algebraic-graphs] [mTest suite logged to: dist/test/algebraic-graphs-0.7-main.log
[2m[algebraic-graphs] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[algebraic-graphs] [mcheckPhase completed in 1 minutes 54 seconds
[2m[algebraic-graphs] [m[1;36mPhase: haddockPhase[m
[2m[algebraic-graphs] [mPreprocessing library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mRunning Haddock on library for algebraic-graphs-0.7..
[2m[algebraic-graphs] [mWarning: --source-* options are ignored when --hyperlinked-source is enabled.
[2m[algebraic-graphs] [m[ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
[2m[algebraic-graphs] [m[ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
[2m[algebraic-graphs] [m[ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
[2m[algebraic-graphs] [m[ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, nothing )
[2m[algebraic-graphs] [m[ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
[2m[algebraic-graphs] [m[ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
[2m[algebraic-graphs] [m[ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
[2m[algebraic-graphs] [m[10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘head’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m384 |[0m[0m     exit v = do newComponent <- (v==).snd.[;1m[35mhead[0m[0m <$> gets boundaryStack
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘tail’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m391 |[0m[0m              pth' = [;1m[35mtail[0m[0m v_pth' -- Here we know that v_pth' starts with v
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                     ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘head’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m395 |[0m[0m              p_v = fst $ [;1m[35mhead[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                          ^^^^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-63394[0m[0m[;1m] [[;1m[35m-Wx-partial[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    In the use of ‘tail’
[2m[algebraic-graphs] [m    (imported from Prelude, but defined in GHC.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m397 |[0m[0m              bnd' = [;1m[35mtail[0m[0m bnd
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                     ^^^^[0m[0m
[2m[algebraic-graphs] [m[12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m171 |[0m[0m     vertexIntSet :: ToVertex t [;1m[35m~[0m[0m Int => t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:197:29: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m197 |[0m[0m     preIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                             ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:215:30: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m215 |[0m[0m     postIntSet :: ToVertex t [;1m[35m~[0m[0m Int => Int -> t -> IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:303:37: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m303 |[0m[0m     toAdjacencyIntMap :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                     ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:312:46: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m312 |[0m[0m     toAdjacencyIntMapTranspose :: ToVertex t [;1m[35m~[0m[0m Int => t -> AIM.AdjacencyIntMap
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                              ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:452:43: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m452 |[0m[0m adjacencyIntMap :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                           ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/ToGraph.hs:471:52: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m471 |[0m[0m adjacencyIntMapTranspose :: (ToGraph t, ToVertex t [;1m[35m~[0m[0m Int) => t -> IntMap IntSet
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                    ^[0m[0m
[2m[algebraic-graphs] [m[14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
[2m[algebraic-graphs] [m[15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
[2m[algebraic-graphs] [m[16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
[2m[algebraic-graphs] [m[17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
[2m[algebraic-graphs] [m[18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
[2m[algebraic-graphs] [m[19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
[2m[algebraic-graphs] [m[20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
[2m[algebraic-graphs] [m[21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m185 |[0m[0m export :: (Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                         ^[0m[0m
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m121 |[0m[0m export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g [;1m[35m~[0m[0m a) => Style a s -> g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                               ^[0m[0m
[2m[algebraic-graphs] [m
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:165:78: [;1m[35mwarning[0m[0m[;1m: [[;1m[35mGHC-58520[0m[0m[;1m] [[;1m[35m-Wtype-equality-requires-operators[0m[0m[;1m][0m[0m[;1m
[2m[algebraic-graphs] [m    The use of ‘~’ without TypeOperators
[2m[algebraic-graphs] [m    will become an error in a future GHC release.
[2m[algebraic-graphs] [m    Suggested fix: Perhaps you intended to use TypeOperators[0m[0m
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m
[2m[algebraic-graphs] [m[;1m[34m165 |[0m[0m exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g [;1m[35m~[0m[0m s) => g -> s
[2m[algebraic-graphs] [m[;1m[34m    |[0m[0m[;1m[35m                                                                              ^[0m[0m
[2m[algebraic-graphs] [m[23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
[2m[algebraic-graphs] [m[24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
[2m[algebraic-graphs] [m[25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
[2m[algebraic-graphs] [m[26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
[2m[algebraic-graphs] [m[27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
[2m[algebraic-graphs] [m[28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
[2m[algebraic-graphs] [m[29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
[2m[algebraic-graphs] [mHaddock coverage:
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * in ‘Data.IntMap.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [mWarning: 'stars' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:611:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:611:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntMap.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntMap.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [mWarning: 'clique' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:558:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:558:1
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:491:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:491:1
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [mWarning: 'reflexiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:873:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:873:1
[2m[algebraic-graphs] [mWarning: 'transitiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:900:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:900:1
[2m[algebraic-graphs] [m 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m    * in ‘Data.IntMap.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntMap.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [mWarning: 'null' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntMap.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m  93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
[2m[algebraic-graphs] [mWarning: 'List' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Internal.hs:50:18
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Internal.hs:50:1
[2m[algebraic-graphs] [m    * in ‘GHC.Types’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
[2m[algebraic-graphs] [mWarning: 'toList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘GHC.IsList’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m 100% ( 19 / 19) in 'Algebra.Graph.Internal'
[2m[algebraic-graphs] [mWarning: 'Graph' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:183:1
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph.hs:183:1
[2m[algebraic-graphs] [mWarning: 'Context' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1400:18
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1400:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:677:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:699:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [mWarning: 'size' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:602:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph.hs:602:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:584:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:616:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [mWarning: 'Vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:184:16
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph.hs:184:16
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:653:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1145:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1052:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1067:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:743:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:719:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [mWarning: 'stars' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:937:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:611:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:611:1
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:805:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:491:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:491:1
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:951:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [mWarning: 'box' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1287:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:835:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1091:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1108:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1163:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [mWarning: 'filter' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.List’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m 100% ( 61 / 61) in 'Algebra.Graph'
[2m[algebraic-graphs] [mWarning: 'Graph' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:183:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:120:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:120:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:129:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:129:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:122:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:122:5
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:133:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:133:1
[2m[algebraic-graphs] [mWarning: 'mplus' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:228:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:228:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:186:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:186:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:265:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:265:1
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:289:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:289:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:303:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:303:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:214:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:214:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:201:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:201:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:347:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:347:1
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:951:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:378:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:378:1
[2m[algebraic-graphs] [mWarning: 'mesh' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:981:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:408:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:408:1
[2m[algebraic-graphs] [mWarning: 'torus' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1007:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:433:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:433:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1052:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:490:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:490:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1091:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:502:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:502:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1108:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/HigherKinded/Class.hs:515:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:515:1
[2m[algebraic-graphs] [m 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
[2m[algebraic-graphs] [mWarning: 'swap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
[2m[algebraic-graphs] [m    * in ‘Data.Tuple’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:337:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:337:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:584:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:499:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:499:1
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:616:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:531:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:531:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:653:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:544:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:544:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:677:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:699:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:594:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:594:1
[2m[algebraic-graphs] [mWarning: 'biclique' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:895:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:575:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'nub' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:719:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:630:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:630:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:283:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:283:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:743:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:642:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:642:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
[2m[algebraic-graphs] [mWarning: 'box' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1287:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:835:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:934:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:934:1
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
[2m[algebraic-graphs] [m 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Sequence.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'biclique' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:575:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
[2m[algebraic-graphs] [mWarning: 'isRight' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'Matching' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
[2m[algebraic-graphs] [mWarning: 'null' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Sequence.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'length' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.Sequence.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Sequence.Internal’
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
[2m[algebraic-graphs] [m 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
[2m[algebraic-graphs] [mWarning: 'Optimum' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:442:20
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:442:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
[2m[algebraic-graphs] [mWarning: 'Distance' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:241:22
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:241:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
[2m[algebraic-graphs] [mWarning: 'Minimum' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:314:21
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:314:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
[2m[algebraic-graphs] [mWarning: 'Capacity' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:176:22
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:176:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
[2m[algebraic-graphs] [mWarning: 'Count' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:209:19
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Label.hs:209:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
[2m[algebraic-graphs] [m 100% ( 37 / 37) in 'Algebra.Graph.Label'
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:253:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:253:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:274:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:274:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:356:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:356:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:503:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:503:1
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
[2m[algebraic-graphs] [mWarning: 'gmap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:749:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
[2m[algebraic-graphs] [mWarning: 'reflexiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:873:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
[2m[algebraic-graphs] [mWarning: 'transitiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:900:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
[2m[algebraic-graphs] [mWarning: 'postSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:517:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
[2m[algebraic-graphs] [m 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
[2m[algebraic-graphs] [mWarning: 'null' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'gmap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:749:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
[2m[algebraic-graphs] [m  93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:96:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:198:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:210:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:221:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
[2m[algebraic-graphs] [mWarning: 'length' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:303:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
[2m[algebraic-graphs] [mWarning: 'edgeSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:314:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:478:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [mWarning: 'transitiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:900:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:352:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:364:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:281:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:269:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'scc' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:471:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
[2m[algebraic-graphs] [mWarning: 'union' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
[2m[algebraic-graphs] [mWarning: 'box' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:428:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:835:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
[2m[algebraic-graphs] [m 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'foldg' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:482:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:98:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [mWarning: 'edgeSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:783:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:489:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:478:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:179:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:179:5
[2m[algebraic-graphs] [mWarning: 'preSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:503:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:434:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:187:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:187:5
[2m[algebraic-graphs] [mWarning: 'postSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:517:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:205:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
[2m[algebraic-graphs] [mWarning: 'adjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:167:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:443:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:443:1
[2m[algebraic-graphs] [m 100% (  8 /  8) in 'Algebra.Graph.ToGraph'
[2m[algebraic-graphs] [mWarning: 'Relation' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:157:19
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:157:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:283:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:283:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:304:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:304:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:266:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:266:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:373:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:373:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:584:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:387:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:616:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:398:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:677:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:699:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:435:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:653:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:411:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:345:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:345:1
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:471:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:554:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:554:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1052:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:663:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:663:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1067:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:678:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:678:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:743:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:460:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:719:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:446:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:320:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:320:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:603:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:603:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:332:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:332:1
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1145:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:716:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:716:1
[2m[algebraic-graphs] [mWarning: 'stars' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:937:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:611:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:621:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:621:1
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:805:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:491:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:496:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:223:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:951:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:636:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:636:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1091:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:690:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:690:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1108:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:703:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:703:1
[2m[algebraic-graphs] [mWarning: 'gmap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:749:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:731:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:731:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1163:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:745:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:745:1
[2m[algebraic-graphs] [mWarning: 'reflexiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:873:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:823:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:823:1
[2m[algebraic-graphs] [mWarning: 'clique' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:878:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:558:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:569:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
[2m[algebraic-graphs] [mWarning: 'transitiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:900:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:850:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:850:1
[2m[algebraic-graphs] [mWarning: 'postSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:517:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:528:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:205:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
[2m[algebraic-graphs] [m 100% ( 56 / 56) in 'Algebra.Graph.Relation'
[2m[algebraic-graphs] [mWarning: 'Relation' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:104:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:104:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:304:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:252:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:199:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:266:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:213:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:373:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:322:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:283:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:230:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:677:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:699:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:435:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:584:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:387:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:616:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:398:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:332:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:279:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:653:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:411:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:345:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:292:1
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:471:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:463:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:554:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:475:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1052:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:663:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:571:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1067:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:678:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:585:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:743:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:460:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:719:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:446:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:320:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:267:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:603:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:517:1
[2m[algebraic-graphs] [mWarning: 'stars' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:937:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:611:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:621:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:534:1
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:805:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:491:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:496:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:223:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:951:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:636:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:546:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1091:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:690:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:597:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1108:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:703:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:610:1
[2m[algebraic-graphs] [mWarning: 'gmap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:749:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:731:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:625:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:625:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1163:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:745:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:639:1
[2m[algebraic-graphs] [m 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
[2m[algebraic-graphs] [mWarning: 'Graph' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:183:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:164:1
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:257:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:257:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:287:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:287:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:322:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:322:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:677:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:490:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:699:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:508:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [mWarning: 'size' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:602:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:447:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:447:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:270:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:270:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:410:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:410:1
[2m[algebraic-graphs] [mWarning: 'Vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:184:16
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:164:16
[2m[algebraic-graphs] [m    * in ‘Data.Graph’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:16
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:616:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:456:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:653:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:470:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [mWarning: 'Overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:185:16
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:165:16
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:165:16
[2m[algebraic-graphs] [mWarning: 'Connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:186:16
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:166:16
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:166:16
[2m[algebraic-graphs] [mWarning: 'length' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:561:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1145:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:809:1
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:809:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1067:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:747:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:747:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:743:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:544:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:719:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:639:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:639:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'box' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1287:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:835:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:909:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:909:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1091:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:768:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:768:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1108:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:704:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:782:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:782:1
[2m[algebraic-graphs] [mWarning: '===' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:562:17
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/NonEmpty.hs:428:17
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:428:17
[2m[algebraic-graphs] [mWarning: 'filter' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.List.NonEmpty’
[2m[algebraic-graphs] [m    * in ‘GHC.List’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:157:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:390:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:417:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:429:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:415:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:403:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
[2m[algebraic-graphs] [mWarning: 'transitiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:900:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:466:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:666:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
[2m[algebraic-graphs] [mWarning: 'null' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'filter' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.List’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:454:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:426:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:691:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
[2m[algebraic-graphs] [mWarning: 'gmap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:749:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
[2m[algebraic-graphs] [mWarning: 'reflexiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:873:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [mWarning: 'postSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:517:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:486:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:205:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:717:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
[2m[algebraic-graphs] [m 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
[2m[algebraic-graphs] [mWarning: 'Context' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:675:20
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:675:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
[2m[algebraic-graphs] [mWarning: 'size' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:357:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:357:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:191:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:203:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:288:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
[2m[algebraic-graphs] [mWarning: 'transpose' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:496:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:342:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:368:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:424:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
[2m[algebraic-graphs] [mWarning: 'foldg' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:145:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:98:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:303:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:180:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:381:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
[2m[algebraic-graphs] [mWarning: 'edgeLabel' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:385:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:217:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
[2m[algebraic-graphs] [mWarning: 'transitiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:619:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:329:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:448:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:461:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
[2m[algebraic-graphs] [mWarning: 'null' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'filter' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.List’
[2m[algebraic-graphs] [m    * in ‘Data.IntSet.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:413:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:473:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:545:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:315:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
[2m[algebraic-graphs] [mWarning: 'reflexiveClosure' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
[2m[algebraic-graphs] [mWarning: 'Focus' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:642:18
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:642:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
[2m[algebraic-graphs] [m 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
[2m[algebraic-graphs] [m 100% (  6 /  6) in 'Algebra.Graph.Labelled.Example.Network'
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Labelled.Example.Automaton'
[2m[algebraic-graphs] [mWarning: 'Doc' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Export.hs:57:17
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Export.hs:57:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
[2m[algebraic-graphs] [m 100% ( 14 / 14) in 'Algebra.Graph.Export'
[2m[algebraic-graphs] [mWarning: 'Style' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Export/Dot.hs:49:18
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Export/Dot.hs:49:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
[2m[algebraic-graphs] [mWarning: 'export' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Export.hs:186:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Export/Dot.hs:122:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:122:1
[2m[algebraic-graphs] [mWarning: 'Graph' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [m 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:325:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
[2m[algebraic-graphs] [mWarning: 'Graph' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:183:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:178:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:253:1
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:266:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:300:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:677:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:505:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:505:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:699:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:519:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:519:1
[2m[algebraic-graphs] [mWarning: 'size' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:602:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:462:1
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:462:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:281:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:424:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
[2m[algebraic-graphs] [mWarning: 'isEmpty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:584:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:446:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:446:1
[2m[algebraic-graphs] [mWarning: 'hasVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:616:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:474:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:474:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:354:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
[2m[algebraic-graphs] [mWarning: 'hasEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:653:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:491:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:491:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:369:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
[2m[algebraic-graphs] [mWarning: 'vertexSet' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:763:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:557:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:557:1
[2m[algebraic-graphs] [mWarning: 'foldr' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘Data.Foldable’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:610:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:624:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
[2m[algebraic-graphs] [mWarning: 'removeVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1052:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:729:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:729:1
[2m[algebraic-graphs] [mWarning: 'removeEdge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1067:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:746:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:746:1
[2m[algebraic-graphs] [mWarning: 'edgeList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:743:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:545:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:545:1
[2m[algebraic-graphs] [mWarning: 'vertexList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:719:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:531:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:531:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:341:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:669:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
[2m[algebraic-graphs] [mWarning: 'stars' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:937:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:687:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:687:1
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:805:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:583:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:583:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:951:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:701:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
[2m[algebraic-graphs] [mWarning: 'replaceVertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1091:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:760:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:760:1
[2m[algebraic-graphs] [mWarning: 'mergeVertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1108:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:775:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:775:1
[2m[algebraic-graphs] [mWarning: 'induce' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:1163:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:791:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:791:1
[2m[algebraic-graphs] [m 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
[2m[algebraic-graphs] [mWarning: 'Graph' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:183:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:109:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:66:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:178:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
[2m[algebraic-graphs] [mWarning: 'connect' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:386:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:119:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:288:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:304:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:325:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
[2m[algebraic-graphs] [mWarning: 'overlay' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:362:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:117:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:270:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:283:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:300:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:316:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:227:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:113:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:191:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:253:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:330:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:239:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:115:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:203:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:266:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
[2m[algebraic-graphs] [mWarning: 'overlays' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:440:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:336:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:325:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:329:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:345:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:369:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
[2m[algebraic-graphs] [mWarning: 'edge' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:343:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:252:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:289:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:217:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:266:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:281:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
[2m[algebraic-graphs] [mWarning: 'isSubgraphOf' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:542:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:366:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:361:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:180:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:373:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:424:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:837:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:529:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:373:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:610:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
[2m[algebraic-graphs] [mWarning: 'circuit' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:858:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:543:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:387:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:554:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:624:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
[2m[algebraic-graphs] [mWarning: 'edges' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:423:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:323:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:312:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:315:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:332:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:354:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
[2m[algebraic-graphs] [mWarning: 'vertices' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:407:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:309:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:301:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:303:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:320:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:341:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
[2m[algebraic-graphs] [mWarning: 'star' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:915:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:592:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:431:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:603:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:669:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
[2m[algebraic-graphs] [mWarning: 'tree' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph.hs:951:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyMap.hs:639:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:445:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:636:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Undirected.hs:701:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
[2m[algebraic-graphs] [m 100% ( 27 / 27) in 'Algebra.Graph.Class'
[2m[algebraic-graphs] [mWarning: 'TransitiveRelation' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Transitive.hs:39:32
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Transitive.hs:39:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:113:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:373:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [mWarning: 'clique' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:402:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:569:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Relation.Transitive'
[2m[algebraic-graphs] [mWarning: 'ReflexiveRelation' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:115:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Relation.Reflexive'
[2m[algebraic-graphs] [mWarning: 'PreorderRelation' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Preorder.hs:44:30
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Preorder.hs:44:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
[2m[algebraic-graphs] [mWarning: 'vertex' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:115:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:113:5
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
[2m[algebraic-graphs] [mWarning: 'path' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:373:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
[2m[algebraic-graphs] [mWarning: 'clique' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Class.hs:402:1
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:569:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
[2m[algebraic-graphs] [m 100% (  5 /  5) in 'Algebra.Graph.Relation.Preorder'
[2m[algebraic-graphs] [m   0% (  0 /  8) in 'Algebra.Graph.Example.Todo'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    Module header
[2m[algebraic-graphs] [m    Todo (src/Algebra/Graph/Example/Todo.hs:13)
[2m[algebraic-graphs] [m    todo (src/Algebra/Graph/Example/Todo.hs:42)
[2m[algebraic-graphs] [m    low (src/Algebra/Graph/Example/Todo.hs:23)
[2m[algebraic-graphs] [m    high (src/Algebra/Graph/Example/Todo.hs:27)
[2m[algebraic-graphs] [m    ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
[2m[algebraic-graphs] [m    >*< (src/Algebra/Graph/Example/Todo.hs:39)
[2m[algebraic-graphs] [m    priority (src/Algebra/Graph/Example/Todo.hs:31)
[2m[algebraic-graphs] [mWarning: 'GraphKL' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Data/Graph/Typed.hs:40:18
[2m[algebraic-graphs] [m    * at src/Data/Graph/Typed.hs:40:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
[2m[algebraic-graphs] [mWarning: 'array' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'fromAdjacencyMap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/AdjacencyIntMap.hs:222:1
[2m[algebraic-graphs] [m    * at src/Data/Graph/Typed.hs:60:1
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined at src/Data/Graph/Typed.hs:60:1
[2m[algebraic-graphs] [mWarning: 'map' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * in ‘GHC.Base’
[2m[algebraic-graphs] [m    * in ‘Data.Map.Strict.Internal’
[2m[algebraic-graphs] [m    * in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[algebraic-graphs] [m    by specifying the type/value namespace explicitly.
[2m[algebraic-graphs] [m    Defaulting to the one defined in ‘Data.Set.Internal’
[2m[algebraic-graphs] [m  90% ( 10 / 11) in 'Data.Graph.Typed'
[2m[algebraic-graphs] [m  Missing documentation for:
[2m[algebraic-graphs] [m    scc (src/Data/Graph/Typed.hs:192)
[2m[algebraic-graphs] [mWarning: Algebra.Graph.AdjacencyMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexAdjacencyMap0
[2m[algebraic-graphs] [mWarning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Internal: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Internal.D:R:ItemList
[2m[algebraic-graphs] [mWarning: Algebra.Graph: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Rep_Graph
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexGraph
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexGraph1
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
[2m[algebraic-graphs] [m	- Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
[2m[algebraic-graphs] [m	- Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Label: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Label.D:R:ItemMinimum
[2m[algebraic-graphs] [m	- Algebra.Graph.Label.D:R:ItemLabel
[2m[algebraic-graphs] [mWarning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.ToGraph: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
[2m[algebraic-graphs] [m	- Algebra.Graph.ToGraph.D:R:ToVertexGraph
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.D:R:ToVertexRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.NonEmpty.D:R:ToVertexGraph
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.D:R:ToVertexGraph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.D:R:ToVertexRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexRelation0
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Symmetric: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.NonEmpty: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.NonEmpty.D:R:ToVertexGraph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexAdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Labelled: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.D:R:ToVertexGraph
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.Rep_Graph
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexGraph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Undirected: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Undirected.Rep_Graph
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexGraph0
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Class: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexTuple3
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexTuple2
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexFUN
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexMaybe
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexUnit
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexRelation0
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexAdjacencyMap
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexGraph
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexAdjacencyMap0
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexGraph0
[2m[algebraic-graphs] [m	- Algebra.Graph.Class.D:R:VertexGraph1
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
[2m[algebraic-graphs] [m	- Algebra.Graph.Example.Todo.D:R:VertexTodo
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Transitive: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Reflexive: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Relation.Preorder: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Example.Todo: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Example.Todo.D:R:VertexTodo
[2m[algebraic-graphs] [mDocumentation created: dist/doc/html/algebraic-graphs/,
[2m[algebraic-graphs] [mdist/doc/html/algebraic-graphs/algebraic-graphs.txt
[2m[algebraic-graphs] [mPreprocessing test suite 'main' for algebraic-graphs-0.7..
[2m[algebraic-graphs] [m[1;36mPhase: installPhase[m
[2m[algebraic-graphs] [mInstalling library in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graphs] [m[1;36mPhase: fixupPhase[m
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
[2m[algebraic-graphs] [mshrinking /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSalgebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd-ghc9.8.1.so
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7
[2m[algebraic-graphs] [mstripping (with command strip and flags -S -p) in  /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/lib
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc
[2m[algebraic-graphs:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7[m
[2m[algebraic-graphs:post-build] [m[2mPushing 2 paths (66 are already present) using zstd to cache sellout ⏳[m
[2m[algebraic-graphs:post-build] [m[2m[m
[2m[algebraic-graphs:post-build] [m[2mPushing /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc (10.46 MiB)[m
[2m[algebraic-graphs:post-build] [m[2mPushing /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7 (24.51 MiB)[m
[2m[algebraic-graphs:post-build] [m[2m[m
[2m[algebraic-graphs:post-build] [m[2mAll done.[m
[2m[algebraic-graphs:post-build] [m[2mUploading to the NixCI cache: /nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc /nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7[m
[2m[algebraic-graphs:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[algebraic-graphs:post-build] [m[2mcopying 2 paths...[m
[2m[algebraic-graphs:post-build] [m[2mcopying path '/nix/store/82jdrp2vilpw7amp0b0qyxggfi3i5xi7-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...[m
[2m[algebraic-graphs:post-build] [m[2mcopying path '/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...[m
[2m[algebraic-graphs:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[algebraic-graphs:post-build] [m[2mcopying 1 paths...[m
[2m[algebraic-graphs:post-build] [m[2mcopying path '/nix/store/95fb9gb6crg1i0pfri43y25jsra3fcj4-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 41 of 46 built[m
[1;34mBuilding /nix/store/vd1nbpw17vdqfdymk5kgg64cavs7xqx8-algebraic-graph-duoids-0.0.1.0.drv[m
[2m[algebraic-graph-duoids] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[algebraic-graph-duoids] [mBuild with /nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1.
[2m[algebraic-graph-duoids] [m[1;36mPhase: unpackPhase[m
[2m[algebraic-graph-duoids] [munpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
[2m[algebraic-graph-duoids] [msource root is algebraic-graphs
[2m[algebraic-graph-duoids] [m[1;36mPhase: patchPhase[m
[2m[algebraic-graph-duoids] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[algebraic-graph-duoids] [msetupCompileFlags: -package-db=/build/tmp.dyirN2rqFf/setup-package.conf.d -threaded
[2m[algebraic-graph-duoids] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.dyirN2rqFf/Main.o )
[2m[algebraic-graph-duoids] [m[2 of 2] Linking Setup
[2m[algebraic-graph-duoids] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[algebraic-graph-duoids] [m[1;36mPhase: configurePhase[m
[2m[algebraic-graph-duoids] [mconfigureFlags: --verbose --prefix=/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.dyirN2rqFf/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 --ghc-options=-Werror --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/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/lib
[2m[algebraic-graph-duoids] [mUsing Parsec parser
[2m[algebraic-graph-duoids] [mConfiguring algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mFlags chosen: noisy-deprecations=True, verify-no-recursion=False
[2m[algebraic-graph-duoids] [mDependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
[2m[algebraic-graph-duoids] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[algebraic-graph-duoids] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[algebraic-graph-duoids] [mDependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mDependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mDependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
[2m[algebraic-graph-duoids] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[algebraic-graph-duoids] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[algebraic-graph-duoids] [mDependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
[2m[algebraic-graph-duoids] [mDependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
[2m[algebraic-graph-duoids] [mhedgehog-1.5
[2m[algebraic-graph-duoids] [mDependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mDependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
[2m[algebraic-graph-duoids] [m>=4.21.0 && <4.22: using base-4.19.0.0
[2m[algebraic-graph-duoids] [mDependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
[2m[algebraic-graph-duoids] [m<0.25: using doctest-0.22.6
[2m[algebraic-graph-duoids] [mSource component graph:
[2m[algebraic-graph-duoids] [m    component lib
[2m[algebraic-graph-duoids] [m    component test:doctests dependency lib
[2m[algebraic-graph-duoids] [m    component test:laws dependency lib
[2m[algebraic-graph-duoids] [mConfigured component graph:
[2m[algebraic-graph-duoids] [m    component algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graph-duoids] [m        include base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[algebraic-graph-duoids] [m    component algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        include base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[algebraic-graph-duoids] [m    component algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graph-duoids] [m        include base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[algebraic-graph-duoids] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[algebraic-graph-duoids] [mLinked component graph:
[2m[algebraic-graph-duoids] [m    unit algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graph-duoids] [m        include base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        include duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[algebraic-graph-duoids] [m        Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev:Algebra.Graph.Duoid.Orphans
[2m[algebraic-graph-duoids] [m    unit algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        include base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[algebraic-graph-duoids] [m    unit algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graph-duoids] [m        include base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        include duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[algebraic-graph-duoids] [m        include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[algebraic-graph-duoids] [mReady component graph:
[2m[algebraic-graph-duoids] [m    definite algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graph-duoids] [m        depends base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        depends duoids-0.0.1.0-ZttBa8o3z5ErRW5eEAhuA
[2m[algebraic-graph-duoids] [m    definite algebraic-graph-duoids-0.0.1.0-F8kaDZaVWgA65bzz5C1ckJ-doctests
[2m[algebraic-graph-duoids] [m        depends algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        depends base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
[2m[algebraic-graph-duoids] [m    definite algebraic-graph-duoids-0.0.1.0-sXoAeSJyv46l7iqDQZSTq-laws
[2m[algebraic-graph-duoids] [m        depends algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m        depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
[2m[algebraic-graph-duoids] [m        depends base-4.19.0.0-b960
[2m[algebraic-graph-duoids] [m        depends duoids-hedgehog-0.0.1.0-4JDkbMO7LvU5kNXJ6yn2lR
[2m[algebraic-graph-duoids] [m        depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
[2m[algebraic-graph-duoids] [mUsing Cabal-3.12.1.0 compiled by ghc-9.8
[2m[algebraic-graph-duoids] [mUsing compiler: ghc-9.8.1
[2m[algebraic-graph-duoids] [mUsing install prefix:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mExecutables installed in:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/bin
[2m[algebraic-graph-duoids] [mLibraries installed in:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [mDynamic Libraries installed in:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
[2m[algebraic-graph-duoids] [mPrivate executables installed in:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mData files installed in:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mDocumentation installed in:
[2m[algebraic-graph-duoids] [m/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mConfiguration files installed in:
[2m[algebraic-graph-duoids] [m/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/etc
[2m[algebraic-graph-duoids] [mNo alex found
[2m[algebraic-graph-duoids] [mUsing ar found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
[2m[algebraic-graph-duoids] [mNo c2hs found
[2m[algebraic-graph-duoids] [mNo cpphs found
[2m[algebraic-graph-duoids] [mUsing doctest version 0.22.6 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/3idxvlj0v6hcqnh7b46sha0dnnlqh68c-doctest-0.22.6/bin/doctest
[2m[algebraic-graph-duoids] [mUsing gcc version 14.3.0 given by user at:
[2m[algebraic-graph-duoids] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
[2m[algebraic-graph-duoids] [mUsing ghc version 9.8.1 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc
[2m[algebraic-graph-duoids] [mUsing ghc-pkg version 9.8.1 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/ghc-pkg-9.8.1
[2m[algebraic-graph-duoids] [mNo ghcjs found
[2m[algebraic-graph-duoids] [mNo ghcjs-pkg found
[2m[algebraic-graph-duoids] [mNo greencard found
[2m[algebraic-graph-duoids] [mUsing haddock version 2.30.0 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/haddock-ghc-9.8.1
[2m[algebraic-graph-duoids] [mNo happy found
[2m[algebraic-graph-duoids] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[algebraic-graph-duoids] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[algebraic-graph-duoids] [mNo hmake found
[2m[algebraic-graph-duoids] [mUsing hpc version 0.69 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hpc-ghc-9.8.1
[2m[algebraic-graph-duoids] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
[2m[algebraic-graph-duoids] [mUsing hscolour version 1.25 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/4s1nxvgrmz6dh6s3n580gkccdbq6nyf3-hscolour-1.25/bin/HsColour
[2m[algebraic-graph-duoids] [mNo jhc found
[2m[algebraic-graph-duoids] [mUsing ld found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
[2m[algebraic-graph-duoids] [mNo pkg-config found
[2m[algebraic-graph-duoids] [mUsing runghc version 9.8.1 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i17w9ailvz9694yxfsmfkf5450mym6mr-ghc-9.8.1/bin/runghc-9.8.1
[2m[algebraic-graph-duoids] [mUsing strip version 2.44 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
[2m[algebraic-graph-duoids] [mUsing tar found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
[2m[algebraic-graph-duoids] [mNo uhc found
[2m[algebraic-graph-duoids] [m[1;36mPhase: buildPhase[m
[2m[algebraic-graph-duoids] [mPreprocessing library for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mBuilding library for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [m[1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
[2m[algebraic-graph-duoids] [m[2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
[2m[algebraic-graph-duoids] [m[1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
[2m[algebraic-graph-duoids] [m[2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
[2m[algebraic-graph-duoids] [mPreprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mBuilding test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [m[1 of 2] Compiling Build_doctests   ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
[2m[algebraic-graph-duoids] [m[2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
[2m[algebraic-graph-duoids] [m[3 of 3] Linking dist/build/doctests/doctests
[2m[algebraic-graph-duoids] [mPreprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mBuilding test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [m[1 of 1] Compiling Main             ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
[2m[algebraic-graph-duoids] [m[2 of 2] Linking dist/build/laws/laws
[2m[algebraic-graph-duoids] [m[1;36mPhase: checkPhase[m
[2m[algebraic-graph-duoids] [mRunning 2 test suites...
[2m[algebraic-graph-duoids] [mTest suite doctests: RUNNING...
[2m[algebraic-graph-duoids] [mExamples: 0  Tried: 0  Errors: 0  Failures: 0
[2m[algebraic-graph-duoids] [mTest suite doctests: PASS
[2m[algebraic-graph-duoids] [mTest suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
[2m[algebraic-graph-duoids] [mTest suite laws: RUNNING...
[2m[algebraic-graph-duoids] [m━━━ Duoid.Normal (Graph Word8) ━━━
[2m[algebraic-graph-duoids] [m  ✓ unswapUnit passed 100 tests.
[2m[algebraic-graph-duoids] [m  ✓ interchange passed 100 tests.
[2m[algebraic-graph-duoids] [m  ✓ splitUnit passed 100 tests.
[2m[algebraic-graph-duoids] [m  ✓ joinUnit passed 100 tests.
[2m[algebraic-graph-duoids] [m  ✓ swapUnit passed 100 tests.
[2m[algebraic-graph-duoids] [m  ✓ 5 succeeded.
[2m[algebraic-graph-duoids] [mTest suite laws: PASS
[2m[algebraic-graph-duoids] [mTest suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
[2m[algebraic-graph-duoids] [m2 of 2 test suites (2 of 2 test cases) passed.
[2m[algebraic-graph-duoids] [m[1;36mPhase: haddockPhase[m
[2m[algebraic-graph-duoids] [mPreprocessing library for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mRunning Haddock on library for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [m[1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
[2m[algebraic-graph-duoids] [m[2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
[2m[algebraic-graph-duoids] [mHaddock coverage:
[2m[algebraic-graph-duoids] [m  20% (  1 /  5) in 'Algebra.Graph.Duoid'
[2m[algebraic-graph-duoids] [m  Missing documentation for:
[2m[algebraic-graph-duoids] [m    parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
[2m[algebraic-graph-duoids] [m    seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
[2m[algebraic-graph-duoids] [m    parGraph (src/Algebra/Graph/Duoid.hs:30)
[2m[algebraic-graph-duoids] [m    seqGraph (src/Algebra/Graph/Duoid.hs:33)
[2m[algebraic-graph-duoids] [m 100% (  1 /  1) in 'Algebra.Graph.Duoid.Orphans'
[2m[algebraic-graph-duoids] [mDocumentation created: dist/doc/html/algebraic-graph-duoids/,
[2m[algebraic-graph-duoids] [mdist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
[2m[algebraic-graph-duoids] [mPreprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mPreprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [m[1;36mPhase: installPhase[m
[2m[algebraic-graph-duoids] [mInstalling library in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/algebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev
[2m[algebraic-graph-duoids] [m[1;36mPhase: fixupPhase[m
[2m[algebraic-graph-duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mshrinking /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSalgebraic-graph-duoids-0.0.1.0-6FKe9pJhZsvDUV8qcoNYev-ghc9.8.1.so
[2m[algebraic-graph-duoids] [mchecking for references to /build/ in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mpatching script interpreter paths in /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mstripping (with command strip and flags -S -p) in  /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/lib
[2m[algebraic-graph-duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
[2m[algebraic-graph-duoids] [mchecking for references to /build/ in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc...
[2m[algebraic-graph-duoids] [mpatching script interpreter paths in /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc
[2m[algebraic-graph-duoids:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc[m
[2m[algebraic-graph-duoids:post-build] [m[2mPushing 2 paths (70 are already present) using zstd to cache sellout ⏳[m
[2m[algebraic-graph-duoids:post-build] [m[2m[m
[2m[algebraic-graph-duoids:post-build] [m[2mPushing /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 (1.17 MiB)[m
[2m[algebraic-graph-duoids:post-build] [m[2mPushing /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc (523.23 KiB)[m
[2m[algebraic-graph-duoids:post-build] [m[2m[m
[2m[algebraic-graph-duoids:post-build] [m[2mAll done.[m
[2m[algebraic-graph-duoids:post-build] [m[2mUploading to the NixCI cache: /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0 /nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc[m
[2m[algebraic-graph-duoids:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[algebraic-graph-duoids:post-build] [m[2mcopying 2 paths...[m
[2m[algebraic-graph-duoids:post-build] [m[2mcopying path '/nix/store/yvyq65dbijald7r2cm4c058avkvn9jk1-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[algebraic-graph-duoids:post-build] [m[2mcopying path '/nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[algebraic-graph-duoids:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[algebraic-graph-duoids:post-build] [m[2mcopying 1 paths...[m
[2m[algebraic-graph-duoids:post-build] [m[2mcopying path '/nix/store/vd1nbpw17vdqfdymk5kgg64cavs7xqx8-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 42 of 46 built[m
[1;34mBuilding /nix/store/azlq3lij05jhzf277wwsgpv2b517ygd8-ghc-9.8.1-with-packages.drv[m
[2m[ghc-9.8.1-with-packages] [m/nix/store/b6lzdj2jg2zzl546y9id10yxn95lymh4-duoidal-transformers-0.0.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/c8z797kf2sy95zww68w2nrgc2ppzl4na-duoids-hedgehog-0.0.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/q92h0c3jbl367y3lyjpnljhz2ld52r21-algebraic-graphs-0.7/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/x373yhmsjwq3spn1hbv9j0cm8j5jzpy0-hedgehog-1.5/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/b3f8c6alnwzazpxal53mis3355qcpfs6-ansi-terminal-1.1.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/b3f8c6alnwzazpxal53mis3355qcpfs6-ansi-terminal-1.1.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/yffb2fyahw5l2b1spp6qzixkkq4qccny-async-2.2.5/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/yffb2fyahw5l2b1spp6qzixkkq4qccny-async-2.2.5/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/md6gz5apak0xb08hk847kifmn59ldj81-barbies-2.1.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/17cgmyyd79128vhi26arrc4kqh06jwcp-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/j360ds2d0fwns7bnv63mlx6ivr8kr737-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/chsh8byjnibabpdjikj6klc0mcfg7h51-mmorph-1.2.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/chsh8byjnibabpdjikj6klc0mcfg7h51-mmorph-1.2.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/72rhrgbcbw73i5ywnxcidb3f93dxc80a-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/f74gslln4agdd8q1m0yl10f9blclxwa5-pretty-show-1.10/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/f74gslln4agdd8q1m0yl10f9blclxwa5-pretty-show-1.10/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/hvypiz5gf5afp4rscfw2z76yvnh5a2vy-primitive-0.9.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/hvypiz5gf5afp4rscfw2z76yvnh5a2vy-primitive-0.9.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/zl44xqm0pxy2zbkr4xqgfmb0ijrhmmlh-random-1.2.1.3/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/zl44xqm0pxy2zbkr4xqgfmb0ijrhmmlh-random-1.2.1.3/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/nwx73g7f6gs7wh7vrfl589cgp82lcvwa-resourcet-1.3.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/9jflshcisd3nv0g563pf36qdf7yrllfh-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/asr242jh0hs6j7ksz7arn06fnq92df5g-transformers-base-0.4.6/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/bxcd6ci0n789m8gzy8yhs8p79b16g1dm-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/v12w7ab6kncc5ipndqxa6fcrybrszlfx-ansi-terminal-types-1.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/v12w7ab6kncc5ipndqxa6fcrybrszlfx-ansi-terminal-types-1.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/xcphpq6p9nzaw7jfppn10cqi7vpg7min-hashable-1.4.7.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/xcphpq6p9nzaw7jfppn10cqi7vpg7min-hashable-1.4.7.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/2vxh1i38l6l3qai7pgis9z5sw32d3k21-distributive-0.6.2.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/b01ixa73fb5yvc1yghs9jc3fsxk1p52q-constraints-0.14.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/b01ixa73fb5yvc1yghs9jc3fsxk1p52q-constraints-0.14.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/zvngwbix6rfpwp80dz96va1vzak5y2ry-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/nnn8i7zj6v0jk9yzk9cblqz689wl4r98-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/nnn8i7zj6v0jk9yzk9cblqz689wl4r98-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/f03a08rpf8c4ha3iwv37h6a5aj3pnim5-splitmix-0.1.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/f03a08rpf8c4ha3iwv37h6a5aj3pnim5-splitmix-0.1.1/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/a93x45v7px1mi26b5bdqa6w7kfg0xjqf-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/a93x45v7px1mi26b5bdqa6w7kfg0xjqf-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/gi3s38xw2vn88zwikc7nx3gkk4x43g49-base-orphans-0.9.3/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/1pdz8ayjwx6x3qqn2pbp4g83dzrv1v7a-os-string-2.0.7/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/1pdz8ayjwx6x3qqn2pbp4g83dzrv1v7a-os-string-2.0.7/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/nyyds8a3nis8rpi8prn83l69mgfhz5sj-tagged-0.8.8/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/nyyds8a3nis8rpi8prn83l69mgfhz5sj-tagged-0.8.8/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/sg5m2ghn81wwf9af7yq2r5hs50n74r88-boring-0.2.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [m/nix/store/sg5m2ghn81wwf9af7yq2r5hs50n74r88-boring-0.2.2/nix-support:
[2m[ghc-9.8.1-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/wdljljjzzwskzyiha5i7p4ps7f8y826y-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.8.1-with-packages] [mWarning: include-dirs: /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages/lib/ghc-9.8.1/lib/../lib/x86_64-linux-ghc-9.8.1/directory-1.3.8.1-6a8e/include doesn't exist or isn't a directory
[2m[ghc-9.8.1-with-packages:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mPushing 1 paths (140 are already present) using zstd to cache sellout ⏳[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2m[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mPushing /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages (4.32 MiB)[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2m[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mAll done.[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mUploading to the NixCI cache: /nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mcopying 1 paths...[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mcopying path '/nix/store/a59g2xgychjlh7nskr1r43hsflgdp34i-ghc-9.8.1-with-packages' to 'https://cache.nix-ci.com'...[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mcopying 1 paths...[m
[2m[ghc-9.8.1-with-packages:post-build] [m[2mcopying path '/nix/store/azlq3lij05jhzf277wwsgpv2b517ygd8-ghc-9.8.1-with-packages.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 43 of 45 built[m
[1;34mBuilding /nix/store/h2krq8wfacscrny1i2gxiwk8cdrj957m-all-packages.drv[m
[2m[all-packages] [mcreated 3 symlinks in user environment
[2m[all-packages:post-build] [m[2mUploading to cachix cache "sellout": /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages[m
[2m[all-packages:post-build] [m[2mPushing 1 paths (141 are already present) using zstd to cache sellout ⏳[m
[2m[all-packages:post-build] [m[2m[m
[2m[all-packages:post-build] [m[2mPushing /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages (872.00 B)[m
[2m[all-packages:post-build] [m[2m[m
[2m[all-packages:post-build] [m[2mAll done.[m
[2m[all-packages:post-build] [m[2mUploading to the NixCI cache: /nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages[m
[2m[all-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[all-packages:post-build] [m[2mcopying 1 paths...[m
[2m[all-packages:post-build] [m[2mcopying path '/nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages' to 'https://cache.nix-ci.com'...[m
[2m[all-packages:post-build] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[all-packages:post-build] [m[2mcopying 1 paths...[m
[2m[all-packages:post-build] [m[2mcopying path '/nix/store/h2krq8wfacscrny1i2gxiwk8cdrj957m-all-packages.drv' to 'https://cache.nix-ci.com'...[m
[2mProgress: 44 of 45 built[m
[2mProgress: 45 of 45 built[m
/nix/store/miyw3nka8iw1pcxp2n5cf04nkw188rwa-all-packages
Build succeeded.[m