$ /nix/store/vzx1mi9c0xfadmsm9dhd83d005cb1qs9-coreutils-9.8/bin/timeout --kill-after=15s 1800s /nix/store/99b1z08awpxj8b6mzggn59gp1shljnff-nix-2.34.5/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link git+https://github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=efcb599e94b311c8c6f8c2a5caf56f3137bbef9a#packages.x86_64-linux.default --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/private/nix-ci-worker/eval-cache-v6/19f80154faf27ddfad5dcb3251253294aea6c838e143ff7a5a949b25d9d532ff.sqlite[0m' is busy[m
[33m'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'[m
[2m[m
[1;34mBuilding cabal2nix-algebraic-graph-duoids[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/f5pw8895liyw89qjx9a0jpa2nsbkkg5s-cabal2nix-algebraic-graph-duoids[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/f5pw8895liyw89qjx9a0jpa2nsbkkg5s-cabal2nix-algebraic-graph-duoids[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/f5pw8895liyw89qjx9a0jpa2nsbkkg5s-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 2 built[m
[2m[m
[1;34mBuilding cabal2nix-duoidal-transformers[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/1bbk5wy9cgafqk6l628446r4pai2ldpm-cabal2nix-duoidal-transformers[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/1bbk5wy9cgafqk6l628446r4pai2ldpm-cabal2nix-duoidal-transformers[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/1bbk5wy9cgafqk6l628446r4pai2ldpm-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 2 built[m
[2m[m
[1;34mBuilding cabal2nix-duoids[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 2 built[m
[2m[m
[1;34mBuilding cabal2nix-duoids-hedgehog[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 2 built[m
[2m[m
[1;34mBuilding cabal2nix-ghc-compat-plugin[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/xcc8s03jf1n5kcylzqvgvnib8l6ka1ly-cabal2nix-ghc-compat-plugin[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/xcc8s03jf1n5kcylzqvgvnib8l6ka1ly-cabal2nix-ghc-compat-plugin[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/xcc8s03jf1n5kcylzqvgvnib8l6ka1ly-cabal2nix-ghc-compat-plugin' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 2 built[m
[2m[m
[32mDownloading cached colour-2.3.6-data from https://cache.nix-ci.com[m
[32mDownloading cached die-hook from https://cache.nix-ci.com[m
[32mDownloading cached pretty-show-1.10-data from https://cache.nix-ci.com[m
[32mDownloading cached ghc-9.10.3-doc from https://cache.nix-ci.com[m
[32mDownloading cached lndir from https://cache.nix-ci.com[m
[32mDownloading cached ncurses-6.5-man from https://cache.nix-ci.com[m
[32mDownloading cached setup-debug-info-dirs-hook from https://cache.nix-ci.com[m
[32mDownloading cached gmp-with-cxx-6.3.0-dev from https://cache.nix-ci.com[m
[32mDownloading cached libffi-3.5.2-dev from https://cache.nix-ci.com[m
[32mDownloading cached numactl-2.0.18-dev from https://cache.nix-ci.com[m
[1;34mBuilding builder.pl[m
[32mDownloading cached algebraic-graphs-0.7-allow-inspection-testing from https://cache.nix-ci.com[m
[32mDownloading cached algebraic-graphs-0.7-r3.cabal from https://cache.nix-ci.com[m
[32mDownloading cached algebraic-graphs from https://cache.nix-ci.com[m
[32mDownloading cached dns-root-data-2025-04 from https://cache.nix-ci.com[m
[32mDownloading cached hscolour from https://cache.nix-ci.com[m
[32mDownloading cached libtasn1 from https://cache.nix-ci.com[m
[1;34mBuilding haskell-generic-builder-test-wrapper.sh[m
[2mProgress: 0 of 107 built (2 building), 1 of 193 downloaded from cache (15 downloading)[m
[2mProgress: 0 of 107 built (2 building), 2 of 193 downloaded from cache (14 downloading)[m
[2mProgress: 0 of 107 built (2 building), 3 of 193 downloaded from cache (13 downloading)[m
[2mProgress: 0 of 107 built (2 building), 4 of 193 downloaded from cache (12 downloading)[m
[2mProgress: 0 of 107 built (2 building), 5 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 0 of 107 built (2 building), 6 of 193 downloaded from cache (10 downloading)[m
[2mProgress: 0 of 107 built (2 building), 7 of 193 downloaded from cache (9 downloading)[m
[2mProgress: 0 of 107 built (2 building), 8 of 193 downloaded from cache (8 downloading)[m
[2mProgress: 0 of 107 built (2 building), 9 of 193 downloaded from cache (7 downloading)[m
[2m[builder.pl] [m[1;36mPhase: patchPhase[m
[2m[builder.pl] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[builder.pl] [m[1;36mPhase: configurePhase[m
[2m[builder.pl] [mno configure script, doing nothing
[2m[builder.pl] [m[1;36mPhase: buildPhase[m
[2m[builder.pl] [m[1;36mPhase: checkPhase[m
[2m[builder.pl] [m[1;36mPhase: installPhase[m
[2m[builder.pl] [mno Makefile or custom installPhase, doing nothing
[2m[builder.pl] [m[1;36mPhase: fixupPhase[m
[2m[builder.pl] [mshrinking RPATHs of ELF executables and libraries in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
[2m[builder.pl] [mchecking for references to /build/ in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl...
[32mDownloading cached cabal-doctest from https://cache.nix-ci.com[m
[32mDownloading cached doctest from https://cache.nix-ci.com[m
[32mDownloading cached extra from https://cache.nix-ci.com[m
[32mDownloading cached ghc-paths-0.1.0.12-r8.cabal from https://cache.nix-ci.com[m
[32mDownloading cached ghc-paths from https://cache.nix-ci.com[m
[32mDownloading cached jailbreak-cabal from https://cache.nix-ci.com[m
[32mDownloading cached libevent from https://cache.nix-ci.com[m
[32mDownloading cached nettle from https://cache.nix-ci.com[m
[32mDownloading cached nothunks-0.3.1-r1.cabal from https://cache.nix-ci.com[m
[2m[builder.pl] [mpatching script interpreter paths in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/j7sa9rqsbgy8iq0bvk19y8qk5jny5wcq-haskell-generic-builder-test-wrapper.sh[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/j7sa9rqsbgy8iq0bvk19y8qk5jny5wcq-haskell-generic-builder-test-wrapper.sh[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 1 of 105 built (1 building), 9 of 193 downloaded from cache (16 downloading)[m
[2mProgress: 1 of 104 built (1 building), 10 of 193 downloaded from cache (15 downloading)[m
[2mProgress: 1 of 104 built (1 building), 11 of 193 downloaded from cache (14 downloading)[m
[2mProgress: 1 of 104 built (1 building), 12 of 193 downloaded from cache (13 downloading)[m
[2mProgress: 1 of 104 built (1 building), 13 of 193 downloaded from cache (12 downloading)[m
[2mProgress: 1 of 104 built (1 building), 14 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 1 of 104 built (1 building), 15 of 193 downloaded from cache (10 downloading)[m
[2mProgress: 1 of 104 built (1 building), 16 of 193 downloaded from cache (9 downloading)[m
[2mProgress: 1 of 104 built (1 building), 17 of 193 downloaded from cache (8 downloading)[m
[2mProgress: 1 of 104 built (1 building), 18 of 193 downloaded from cache (7 downloading)[m
[2mProgress: 1 of 104 built (1 building), 19 of 193 downloaded from cache (6 downloading)[m
[2mProgress: 1 of 104 built (1 building), 20 of 193 downloaded from cache (5 downloading)[m
[2mProgress: 1 of 104 built (1 building), 21 of 193 downloaded from cache (4 downloading)[m
[2mProgress: 1 of 104 built (1 building), 22 of 193 downloaded from cache (3 downloading)[m
[2mProgress: 1 of 104 built (1 building), 23 of 193 downloaded from cache (2 downloading)[m
[2mProgress: 1 of 104 built (1 building), 24 of 193 downloaded from cache (1 downloading)[m
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 2 of 105 built, 24 of 193 downloaded from cache (1 downloading)[m
[32mDownloading cached make-shell-wrapper-hook from https://cache.nix-ci.com[m
[32mDownloading cached nothunks from https://cache.nix-ci.com[m
[32mDownloading cached p11-kit from https://cache.nix-ci.com[m
[32mDownloading cached quickcheck-instances-0.3.33-r1.cabal from https://cache.nix-ci.com[m
[32mDownloading cached quickcheck-instances from https://cache.nix-ci.com[m
[32mDownloading cached remove-references-to from https://cache.nix-ci.com[m
[32mDownloading cached unordered-containers from https://cache.nix-ci.com[m
[32mDownloading cached vector-0.13.2.0-r2.cabal from https://cache.nix-ci.com[m
[32mDownloading cached vector from https://cache.nix-ci.com[m
[32mDownloading cached ncurses-6.5-dev from https://cache.nix-ci.com[m
[32mDownloading cached unbound-1.24.2-lib from https://cache.nix-ci.com[m
[2mProgress: 2 of 95 built, 25 of 193 downloaded from cache (11 downloading)[m
[32mDownloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com[m
[32mDownloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com[m
[32mDownloading cached assoc-1.1.1-doc from https://cache.nix-ci.com[m
[32mDownloading cached base-compat-0.14.1-doc from https://cache.nix-ci.com[m
[32mDownloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 94 built, 26 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 93 built, 27 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached clock-0.8.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 92 built, 28 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached code-page-0.2.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 91 built, 29 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached colour-2.3.6-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 90 built, 30 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 89 built, 31 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached ghc-compat-plugin-0.1.0.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 88 built, 32 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached hashable-1.5.0.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 87 built, 33 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached haskell-lexer-1.2.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 34 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached hspec-discover-2.11.14-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 35 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 36 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 37 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached mmorph-1.2.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 38 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 39 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 40 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 41 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 42 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 43 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 44 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached ansi-terminal-types-1.1.3-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 45 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached async-2.2.5-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 46 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 47 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 48 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached logging-facade-0.3.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 49 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 50 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached pretty-show-1.10-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 51 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached silently-1.2.5.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 52 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached splitmix-0.1.3.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 53 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 54 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached stringbuilder-0.5.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 55 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached gnutls from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 56 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached syb-0.7.2.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 57 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached tagged-0.8.9-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 58 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 59 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached hspec-expectations-0.8.4-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 60 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached ansi-terminal-1.1.3-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 61 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached text-short-0.1.6-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 62 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached these-1.2.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 63 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached time-compat-1.9.8-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 64 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 65 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 66 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 67 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached random-1.2.1.3-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 68 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 69 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 70 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 71 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached boring-0.2.2-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 72 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 73 of 193 downloaded from cache (15 downloading)[m
[2mProgress: 2 of 86 built, 74 of 193 downloaded from cache (14 downloading)[m
[32mDownloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com[m
[32mDownloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 75 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached strict-0.5.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 76 of 193 downloaded from cache (15 downloading)[m
[2mProgress: 2 of 86 built, 77 of 193 downloaded from cache (14 downloading)[m
[32mDownloading cached libmicrohttpd from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 78 of 193 downloaded from cache (14 downloading)[m
[32mDownloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 79 of 193 downloaded from cache (14 downloading)[m
[2mProgress: 2 of 86 built, 80 of 193 downloaded from cache (13 downloading)[m
[2mProgress: 2 of 86 built, 81 of 193 downloaded from cache (12 downloading)[m
[32mDownloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 82 of 193 downloaded from cache (12 downloading)[m
[2mProgress: 2 of 86 built, 83 of 193 downloaded from cache (11 downloading)[m
[32mDownloading cached QuickCheck-2.15.0.1-doc from https://cache.nix-ci.com[m
[32mDownloading cached temporary-1.3-doc from https://cache.nix-ci.com[m
[32mDownloading cached tf-random-0.5-doc from https://cache.nix-ci.com[m
[32mDownloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 84 of 193 downloaded from cache (14 downloading)[m
[2mProgress: 2 of 86 built, 85 of 193 downloaded from cache (13 downloading)[m
[32mDownloading cached constraints-0.14.2-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 86 of 193 downloaded from cache (13 downloading)[m
[32mDownloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 87 of 193 downloaded from cache (13 downloading)[m
[32mDownloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 88 of 193 downloaded from cache (13 downloading)[m
[2mProgress: 2 of 86 built, 89 of 193 downloaded from cache (12 downloading)[m
[32mDownloading cached elfutils-0.194-bin from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 90 of 193 downloaded from cache (12 downloading)[m
[2mProgress: 2 of 86 built, 91 of 193 downloaded from cache (11 downloading)[m
[32mDownloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 92 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 2 of 86 built, 93 of 193 downloaded from cache (10 downloading)[m
[2mProgress: 2 of 86 built, 94 of 193 downloaded from cache (9 downloading)[m
[2mProgress: 2 of 86 built, 95 of 193 downloaded from cache (8 downloading)[m
[32mDownloading cached mockery-0.3.5-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 96 of 193 downloaded from cache (8 downloading)[m
[32mDownloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com[m
[32mDownloading cached quickcheck-io-0.2.0-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 97 of 193 downloaded from cache (9 downloading)[m
[2mProgress: 2 of 86 built, 98 of 193 downloaded from cache (8 downloading)[m
[2mProgress: 2 of 86 built, 99 of 193 downloaded from cache (7 downloading)[m
[2mProgress: 2 of 86 built, 100 of 193 downloaded from cache (6 downloading)[m
[32mDownloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 101 of 193 downloaded from cache (6 downloading)[m
[32mDownloading cached tasty-1.5.3-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 102 of 193 downloaded from cache (6 downloading)[m
[32mDownloading cached elfutils-0.194-dev from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 103 of 193 downloaded from cache (6 downloading)[m
[2mProgress: 2 of 86 built, 104 of 193 downloaded from cache (5 downloading)[m
[32mDownloading cached hspec-core-2.11.14-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 105 of 193 downloaded from cache (5 downloading)[m
[32mDownloading cached ghc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 106 of 193 downloaded from cache (5 downloading)[m
[2mProgress: 2 of 86 built, 107 of 193 downloaded from cache (4 downloading)[m
[32mDownloading cached hspec-2.11.14-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 108 of 193 downloaded from cache (4 downloading)[m
[2mProgress: 2 of 86 built, 109 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached hedgehog-1.5-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 110 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com[m
[32mDownloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com[m
[32mDownloading cached tasty-quickcheck-0.11.1-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 111 of 193 downloaded from cache (5 downloading)[m
[2mProgress: 2 of 86 built, 112 of 193 downloaded from cache (4 downloading)[m
[2mProgress: 2 of 86 built, 113 of 193 downloaded from cache (3 downloading)[m
[2mProgress: 2 of 86 built, 114 of 193 downloaded from cache (2 downloading)[m
[2mProgress: 2 of 86 built, 115 of 193 downloaded from cache (1 downloading)[m
[32mDownloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com[m
[2mProgress: 2 of 86 built, 116 of 193 downloaded from cache (1 downloading)[m
[2mProgress: 2 of 86 built, 117 of 193 downloaded from cache[m
[32mDownloading cached Cabal-syntax from https://cache.nix-ci.com[m
[32mDownloading cached OneTuple from https://cache.nix-ci.com[m
[32mDownloading cached assoc from https://cache.nix-ci.com[m
[32mDownloading cached base-compat from https://cache.nix-ci.com[m
[32mDownloading cached base-orphans from https://cache.nix-ci.com[m
[32mDownloading cached call-stack from https://cache.nix-ci.com[m
[32mDownloading cached clock from https://cache.nix-ci.com[m
[32mDownloading cached code-page from https://cache.nix-ci.com[m
[32mDownloading cached colour from https://cache.nix-ci.com[m
[32mDownloading cached erf from https://cache.nix-ci.com[m
[32mDownloading cached hashable from https://cache.nix-ci.com[m
[32mDownloading cached ghc-compat-plugin from https://cache.nix-ci.com[m
[32mDownloading cached haskell-lexer from https://cache.nix-ci.com[m
[32mDownloading cached inspection-testing from https://cache.nix-ci.com[m
[32mDownloading cached hspec-discover from https://cache.nix-ci.com[m
[32mDownloading cached integer-logarithms from https://cache.nix-ci.com[m
[2mProgress: 2 of 85 built, 118 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached old-locale from https://cache.nix-ci.com[m
[2mProgress: 2 of 85 built, 119 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached HUnit from https://cache.nix-ci.com[m
[2mProgress: 2 of 84 built, 120 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached logging-facade from https://cache.nix-ci.com[m
[2mProgress: 2 of 84 built, 121 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached prettyprinter from https://cache.nix-ci.com[m
[2mProgress: 2 of 84 built, 122 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached primitive from https://cache.nix-ci.com[m
[2mProgress: 2 of 83 built, 123 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached safe-exceptions from https://cache.nix-ci.com[m
[2mProgress: 2 of 82 built, 124 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached silently from https://cache.nix-ci.com[m
[2mProgress: 2 of 81 built, 125 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached async from https://cache.nix-ci.com[m
[2mProgress: 2 of 80 built, 126 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached case-insensitive from https://cache.nix-ci.com[m
[2mProgress: 2 of 79 built, 127 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached data-fix from https://cache.nix-ci.com[m
[2mProgress: 2 of 78 built, 128 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached splitmix from https://cache.nix-ci.com[m
[2mProgress: 2 of 77 built, 129 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached ansi-terminal-types from https://cache.nix-ci.com[m
[2mProgress: 2 of 76 built, 130 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached stringbuilder from https://cache.nix-ci.com[m
[2mProgress: 2 of 75 built, 131 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached syb from https://cache.nix-ci.com[m
[2mProgress: 2 of 74 built, 132 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached pretty-show from https://cache.nix-ci.com[m
[2mProgress: 2 of 73 built, 133 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached tagged from https://cache.nix-ci.com[m
[2mProgress: 2 of 73 built, 134 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached terminal-size from https://cache.nix-ci.com[m
[2mProgress: 2 of 72 built, 135 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached hspec-expectations from https://cache.nix-ci.com[m
[2mProgress: 2 of 71 built, 136 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached text-short from https://cache.nix-ci.com[m
[2mProgress: 2 of 70 built, 137 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached these from https://cache.nix-ci.com[m
[2mProgress: 2 of 70 built, 138 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached old-time from https://cache.nix-ci.com[m
[2mProgress: 2 of 69 built, 139 of 193 downloaded from cache (15 downloading)[m
[2mProgress: 2 of 69 built, 140 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached time-compat from https://cache.nix-ci.com[m
[32mDownloading cached transformers-compat from https://cache.nix-ci.com[m
[2mProgress: 2 of 68 built, 141 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached unliftio-core from https://cache.nix-ci.com[m
[2mProgress: 2 of 67 built, 142 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached random from https://cache.nix-ci.com[m
[2mProgress: 2 of 66 built, 143 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached vector-stream from https://cache.nix-ci.com[m
[2mProgress: 2 of 65 built, 144 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached wherefrom-compat from https://cache.nix-ci.com[m
[2mProgress: 2 of 64 built, 145 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached ansi-terminal from https://cache.nix-ci.com[m
[2mProgress: 2 of 63 built, 146 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached wl-pprint-annotated from https://cache.nix-ci.com[m
[2mProgress: 2 of 62 built, 147 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached boring from https://cache.nix-ci.com[m
[2mProgress: 2 of 61 built, 148 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached distributive from https://cache.nix-ci.com[m
[2mProgress: 2 of 61 built, 149 of 193 downloaded from cache (15 downloading)[m
[32mDownloading cached scientific from https://cache.nix-ci.com[m
[2mProgress: 2 of 60 built, 150 of 193 downloaded from cache (15 downloading)[m
[2mProgress: 2 of 59 built, 151 of 193 downloaded from cache (14 downloading)[m
[2mProgress: 2 of 58 built, 152 of 193 downloaded from cache (13 downloading)[m
[32mDownloading cached strict from https://cache.nix-ci.com[m
[2mProgress: 2 of 57 built, 153 of 193 downloaded from cache (13 downloading)[m
[2mProgress: 2 of 56 built, 154 of 193 downloaded from cache (12 downloading)[m
[32mDownloading cached resourcet from https://cache.nix-ci.com[m
[2mProgress: 2 of 55 built, 155 of 193 downloaded from cache (12 downloading)[m
[2mProgress: 2 of 54 built, 156 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 2 of 53 built, 157 of 193 downloaded from cache (10 downloading)[m
[32mDownloading cached mmorph from https://cache.nix-ci.com[m
[32mDownloading cached transformers-base from https://cache.nix-ci.com[m
[2mProgress: 2 of 52 built, 158 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 2 of 51 built, 159 of 193 downloaded from cache (10 downloading)[m
[32mDownloading cached concurrent-output from https://cache.nix-ci.com[m
[32mDownloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com[m
[2mProgress: 2 of 50 built, 160 of 193 downloaded from cache (11 downloading)[m
[32mDownloading cached barbies from https://cache.nix-ci.com[m
[2mProgress: 2 of 49 built, 161 of 193 downloaded from cache (11 downloading)[m
[32mDownloading cached constraints from https://cache.nix-ci.com[m
[2mProgress: 2 of 48 built, 162 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 2 of 47 built, 163 of 193 downloaded from cache (10 downloading)[m
[32mDownloading cached QuickCheck from https://cache.nix-ci.com[m
[32mDownloading cached temporary from https://cache.nix-ci.com[m
[32mDownloading cached tf-random from https://cache.nix-ci.com[m
[32mDownloading cached uuid-types from https://cache.nix-ci.com[m
[2mProgress: 2 of 46 built, 164 of 193 downloaded from cache (13 downloading)[m
[2mProgress: 2 of 45 built, 165 of 193 downloaded from cache (12 downloading)[m
[2mProgress: 2 of 45 built, 166 of 193 downloaded from cache (11 downloading)[m
[2mProgress: 2 of 44 built, 167 of 193 downloaded from cache (10 downloading)[m
[2mProgress: 2 of 43 built, 168 of 193 downloaded from cache (9 downloading)[m
[32mDownloading cached monad-control from https://cache.nix-ci.com[m
[2mProgress: 2 of 42 built, 169 of 193 downloaded from cache (9 downloading)[m
[2mProgress: 2 of 41 built, 170 of 193 downloaded from cache (8 downloading)[m
[32mDownloading cached optparse-applicative from https://cache.nix-ci.com[m
[2mProgress: 2 of 41 built, 171 of 193 downloaded from cache (8 downloading)[m
[2mProgress: 2 of 40 built, 172 of 193 downloaded from cache (7 downloading)[m
[2mProgress: 2 of 39 built, 173 of 193 downloaded from cache (6 downloading)[m
[2mProgress: 2 of 38 built, 174 of 193 downloaded from cache (5 downloading)[m
[32mDownloading cached mockery from https://cache.nix-ci.com[m
[2mProgress: 2 of 37 built, 175 of 193 downloaded from cache (5 downloading)[m
[2mProgress: 2 of 36 built, 176 of 193 downloaded from cache (4 downloading)[m
[2mProgress: 2 of 35 built, 177 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached lifted-base from https://cache.nix-ci.com[m
[2mProgress: 2 of 34 built, 178 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached ChasingBottoms from https://cache.nix-ci.com[m
[32mDownloading cached quickcheck-io from https://cache.nix-ci.com[m
[2mProgress: 2 of 33 built, 179 of 193 downloaded from cache (4 downloading)[m
[32mDownloading cached tasty from https://cache.nix-ci.com[m
[2mProgress: 2 of 33 built, 180 of 193 downloaded from cache (4 downloading)[m
[32mDownloading cached hspec-core from https://cache.nix-ci.com[m
[2mProgress: 2 of 33 built, 181 of 193 downloaded from cache (4 downloading)[m
[32mDownloading cached lifted-async from https://cache.nix-ci.com[m
[2mProgress: 2 of 32 built, 182 of 193 downloaded from cache (4 downloading)[m
[2mProgress: 2 of 31 built, 183 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached Cabal from https://cache.nix-ci.com[m
[2mProgress: 2 of 31 built, 184 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached hspec from https://cache.nix-ci.com[m
[2mProgress: 2 of 30 built, 185 of 193 downloaded from cache (3 downloading)[m
[32mDownloading cached tasty-hunit from https://cache.nix-ci.com[m
[32mDownloading cached tasty-inspection-testing from https://cache.nix-ci.com[m
[32mDownloading cached tasty-quickcheck from https://cache.nix-ci.com[m
[2mProgress: 2 of 29 built, 186 of 193 downloaded from cache (5 downloading)[m
[32mDownloading cached hedgehog from https://cache.nix-ci.com[m
[2mProgress: 2 of 28 built, 187 of 193 downloaded from cache (5 downloading)[m
[2mProgress: 2 of 27 built, 188 of 193 downloaded from cache (4 downloading)[m
[2mProgress: 2 of 26 built, 189 of 193 downloaded from cache (3 downloading)[m
[2mProgress: 2 of 25 built, 190 of 193 downloaded from cache (2 downloading)[m
[2mProgress: 2 of 24 built, 191 of 193 downloaded from cache (1 downloading)[m
[32mDownloading cached tasty-hedgehog from https://cache.nix-ci.com[m
[2mProgress: 2 of 23 built, 192 of 193 downloaded from cache (1 downloading)[m
[2mProgress: 2 of 22 built, 193 of 193 downloaded from cache[m
[1;34mBuilding cabal-doctest[m
[1;34mBuilding ghc-paths[m
[2m[cabal-doctest] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[cabal-doctest] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[ghc-paths] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[ghc-paths] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[cabal-doctest] [m[1;36mPhase: unpackPhase[m
[2m[ghc-paths] [m[1;36mPhase: unpackPhase[m
[2m[cabal-doctest] [munpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
[2m[ghc-paths] [munpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
[2m[ghc-paths] [msource root is ghc-paths-0.1.0.12
[2m[cabal-doctest] [msource root is cabal-doctest-1.0.12
[2m[ghc-paths] [msetting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
[2m[cabal-doctest] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
[2m[ghc-paths] [m[1;36mPhase: patchPhase[m
[2m[cabal-doctest] [m[1;36mPhase: patchPhase[m
[2m[ghc-paths] [mReplace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
[2m[ghc-paths] [mapplying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
[2m[cabal-doctest] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[ghc-paths] [mpatching file GHC/Paths.hs
[2m[ghc-paths] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[cabal-doctest] [msetupCompileFlags: -package-db=/build/tmp.pYcqkiqmcA/setup-package.conf.d -threaded
[2m[ghc-paths] [msetupCompileFlags: -package-db=/build/tmp.rzWYyrEQNx/setup-package.conf.d -threaded
[2m[cabal-doctest] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.pYcqkiqmcA/Main.o )
[2m[cabal-doctest] [m[2 of 2] Linking Setup
[2m[ghc-paths] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.rzWYyrEQNx/Main.o )
[2m[ghc-paths] [m[2 of 2] Linking Setup
[2m[cabal-doctest] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[cabal-doctest] [m[1;36mPhase: configurePhase[m
[2m[cabal-doctest] [mconfigureFlags: --verbose --prefix=/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.pYcqkiqmcA/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
[2m[cabal-doctest] [mUsing Parsec parser
[2m[cabal-doctest] [mConfiguring cabal-doctest-1.0.12...
[2m[ghc-paths] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[ghc-paths] [m[1;36mPhase: configurePhase[m
[2m[ghc-paths] [mconfigureFlags: --verbose --prefix=/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.rzWYyrEQNx/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
[2m[ghc-paths] [mUsing Parsec parser
[2m[ghc-paths] [mConfiguring ghc-paths-0.1.0.12...
[2m[cabal-doctest] [mDependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
[2m[cabal-doctest] [mDependency base >=4.9 && <5: using base-4.20.2.0
[2m[cabal-doctest] [mDependency directory >=1.3 && <2: using directory-1.3.8.5
[2m[cabal-doctest] [mDependency filepath >=1.4 && <2: using filepath-1.5.4.0
[2m[cabal-doctest] [mSource component graph: component lib
[2m[cabal-doctest] [mConfigured component graph:
[2m[cabal-doctest] [m    component cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
[2m[cabal-doctest] [m        include Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
[2m[cabal-doctest] [m        include base-4.20.2.0-acb8
[2m[cabal-doctest] [m        include directory-1.3.8.5-e377
[2m[cabal-doctest] [m        include filepath-1.5.4.0-c4eb
[2m[cabal-doctest] [mLinked component graph:
[2m[cabal-doctest] [m    unit cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
[2m[cabal-doctest] [m        include Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
[2m[cabal-doctest] [m        include base-4.20.2.0-acb8
[2m[cabal-doctest] [m        include directory-1.3.8.5-e377
[2m[cabal-doctest] [m        include filepath-1.5.4.0-c4eb
[2m[cabal-doctest] [m        Distribution.Extra.Doctest=cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m:Distribution.Extra.Doctest
[2m[cabal-doctest] [mReady component graph:
[2m[cabal-doctest] [m    definite cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
[2m[cabal-doctest] [m        depends Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
[2m[cabal-doctest] [m        depends base-4.20.2.0-acb8
[2m[cabal-doctest] [m        depends directory-1.3.8.5-e377
[2m[cabal-doctest] [m        depends filepath-1.5.4.0-c4eb
[2m[cabal-doctest] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[cabal-doctest] [mUsing compiler: ghc-9.10.3
[2m[cabal-doctest] [mUsing install prefix:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
[2m[cabal-doctest] [mExecutables installed in:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/bin
[2m[cabal-doctest] [mLibraries installed in:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
[2m[cabal-doctest] [mDynamic Libraries installed in:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[cabal-doctest] [mPrivate executables installed in:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12
[2m[cabal-doctest] [mData files installed in:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12
[2m[cabal-doctest] [mDocumentation installed in:
[2m[cabal-doctest] [m/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
[2m[cabal-doctest] [mConfiguration files installed in:
[2m[cabal-doctest] [m/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/etc
[2m[cabal-doctest] [mNo alex found
[2m[cabal-doctest] [mUsing ar found on system at:
[2m[cabal-doctest] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[cabal-doctest] [mNo c2hs found
[2m[cabal-doctest] [mNo cpphs found
[2m[cabal-doctest] [mNo doctest found
[2m[cabal-doctest] [mUsing gcc version 14.3.0 given by user at:
[2m[cabal-doctest] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[cabal-doctest] [mUsing ghc version 9.10.3 found on system at:
[2m[cabal-doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[cabal-doctest] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[cabal-doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[cabal-doctest] [mNo ghcjs found
[2m[cabal-doctest] [mNo ghcjs-pkg found
[2m[cabal-doctest] [mNo greencard found
[2m[cabal-doctest] [mUsing haddock version 2.31.1 found on system at:
[2m[cabal-doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[2m[cabal-doctest] [mNo happy found
[2m[cabal-doctest] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[cabal-doctest] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[cabal-doctest] [mNo hmake found
[2m[cabal-doctest] [mUsing hpc version 0.69 found on system at:
[2m[cabal-doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[cabal-doctest] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[cabal-doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[cabal-doctest] [mUsing hscolour version 1.25 found on system at:
[2m[cabal-doctest] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[cabal-doctest] [mNo jhc found
[2m[cabal-doctest] [mUsing ld found on system at:
[2m[cabal-doctest] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[cabal-doctest] [mNo pkg-config found
[2m[cabal-doctest] [mUsing runghc version 9.10.3 found on system at:
[2m[cabal-doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[cabal-doctest] [mUsing strip version 2.44 found on system at:
[2m[cabal-doctest] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[cabal-doctest] [mUsing tar found on system at:
[2m[cabal-doctest] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[cabal-doctest] [mNo uhc found
[2m[cabal-doctest] [m[1;36mPhase: buildPhase[m
[2m[ghc-paths] [mDependency base >=3 && <5: using base-4.20.2.0
[2m[ghc-paths] [mSource component graph: component lib
[2m[ghc-paths] [mConfigured component graph:
[2m[ghc-paths] [m    component ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[ghc-paths] [m        include base-4.20.2.0-acb8
[2m[ghc-paths] [mLinked component graph:
[2m[ghc-paths] [m    unit ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[ghc-paths] [m        include base-4.20.2.0-acb8
[2m[ghc-paths] [m        GHC.Paths=ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww:GHC.Paths
[2m[ghc-paths] [mReady component graph:
[2m[ghc-paths] [m    definite ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[ghc-paths] [m        depends base-4.20.2.0-acb8
[2m[ghc-paths] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[ghc-paths] [mUsing compiler: ghc-9.10.3
[2m[ghc-paths] [mUsing install prefix:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
[2m[ghc-paths] [mExecutables installed in:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/bin
[2m[ghc-paths] [mLibraries installed in:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[ghc-paths] [mDynamic Libraries installed in:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[ghc-paths] [mPrivate executables installed in:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12
[2m[ghc-paths] [mData files installed in:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12
[2m[ghc-paths] [mDocumentation installed in:
[2m[ghc-paths] [m/nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
[2m[ghc-paths] [mConfiguration files installed in:
[2m[ghc-paths] [m/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/etc
[2m[ghc-paths] [mNo alex found
[2m[ghc-paths] [mUsing ar found on system at:
[2m[ghc-paths] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[ghc-paths] [mNo c2hs found
[2m[ghc-paths] [mNo cpphs found
[2m[ghc-paths] [mNo doctest found
[2m[ghc-paths] [mUsing gcc version 14.3.0 given by user at:
[2m[ghc-paths] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[ghc-paths] [mUsing ghc version 9.10.3 found on system at:
[2m[ghc-paths] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[ghc-paths] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[ghc-paths] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[ghc-paths] [mNo ghcjs found
[2m[ghc-paths] [mNo ghcjs-pkg found
[2m[ghc-paths] [mNo greencard found
[2m[ghc-paths] [mUsing haddock version 2.31.1 found on system at:
[2m[ghc-paths] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[2m[ghc-paths] [mNo happy found
[2m[ghc-paths] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[ghc-paths] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[ghc-paths] [mNo hmake found
[2m[ghc-paths] [mUsing hpc version 0.69 found on system at:
[2m[ghc-paths] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[ghc-paths] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[ghc-paths] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[ghc-paths] [mUsing hscolour version 1.25 found on system at:
[2m[ghc-paths] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[ghc-paths] [mNo jhc found
[2m[ghc-paths] [mUsing ld found on system at:
[2m[ghc-paths] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[ghc-paths] [mNo pkg-config found
[2m[ghc-paths] [mUsing runghc version 9.10.3 found on system at:
[2m[ghc-paths] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[ghc-paths] [mUsing strip version 2.44 found on system at:
[2m[ghc-paths] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[ghc-paths] [mUsing tar found on system at:
[2m[ghc-paths] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[ghc-paths] [mNo uhc found
[2m[ghc-paths] [mRunning: /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
[2m[cabal-doctest] [mPreprocessing library for cabal-doctest-1.0.12...
[2m[cabal-doctest] [mBuilding library for cabal-doctest-1.0.12...
[2m[ghc-paths] [m[1;36mPhase: buildPhase[m
[2m[cabal-doctest] [m[1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
[2m[ghc-paths] [mPreprocessing library for ghc-paths-0.1.0.12...
[2m[ghc-paths] [mBuilding library for ghc-paths-0.1.0.12...
[2m[ghc-paths] [m[1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
[2m[ghc-paths] [m[1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
[2m[cabal-doctest] [m[1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
[2m[ghc-paths] [m[1;36mPhase: checkPhase[m
[2m[ghc-paths] [mPackage has no test suites.
[2m[ghc-paths] [m[1;36mPhase: haddockPhase[m
[2m[ghc-paths] [mPreprocessing library for ghc-paths-0.1.0.12...
[2m[ghc-paths] [mRunning Haddock on library for ghc-paths-0.1.0.12...
[2m[ghc-paths] [m[1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, nothing )
[2m[ghc-paths] [mHaddock coverage:
[2m[ghc-paths] [m   0% (  0 /  5) in 'GHC.Paths'
[2m[ghc-paths] [m  Missing documentation for:
[2m[ghc-paths] [m    Module header
[2m[ghc-paths] [m    ghc (GHC/Paths.hs:34)
[2m[ghc-paths] [m    ghc_pkg (GHC/Paths.hs:35)
[2m[ghc-paths] [m    libdir (GHC/Paths.hs:31)
[2m[ghc-paths] [m    docdir (GHC/Paths.hs:32)
[2m[cabal-doctest] [m[1;36mPhase: checkPhase[m
[2m[cabal-doctest] [mPackage has no test suites.
[2m[cabal-doctest] [m[1;36mPhase: haddockPhase[m
[2m[cabal-doctest] [mPreprocessing library for cabal-doctest-1.0.12...
[2m[cabal-doctest] [mRunning Haddock on library for cabal-doctest-1.0.12...
[2m[cabal-doctest] [m[1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing )
[2m[cabal-doctest] [mHaddock coverage:
[2m[cabal-doctest] [mWarning: 'UserHooks' is ambiguous. It is defined
[2m[cabal-doctest] [m    * in ‘Distribution.Simple.UserHooks’
[2m[cabal-doctest] [m    * in ‘Distribution.Simple.UserHooks’
[2m[cabal-doctest] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[cabal-doctest] [m    by specifying the type/value namespace explicitly.
[2m[cabal-doctest] [m    Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
[2m[cabal-doctest] [m 100% (  7 /  7) in 'Distribution.Extra.Doctest'
[2m[ghc-paths] [mDocumentation created: dist/doc/html/ghc-paths/,
[2m[ghc-paths] [mdist/doc/html/ghc-paths/ghc-paths.txt
[2m[ghc-paths] [m[1;36mPhase: installPhase[m
[2m[ghc-paths] [mInstalling library in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[ghc-paths] [m[1;36mPhase: fixupPhase[m
[2m[ghc-paths] [mshrinking RPATHs of ELF executables and libraries in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
[2m[ghc-paths] [mshrinking /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww-ghc9.10.3.so
[2m[ghc-paths] [mchecking for references to /build/ in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12...
[2m[ghc-paths] [mpatching script interpreter paths in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
[2m[ghc-paths] [mstripping (with command strip and flags -S -p) in  /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib
[2m[ghc-paths] [mshrinking RPATHs of ELF executables and libraries in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc
[2m[ghc-paths] [mchecking for references to /build/ in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc...
[2m[ghc-paths] [mpatching script interpreter paths in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 3 of 22 built (1 building), 193 of 193 downloaded from cache[m
[1;34mBuilding doctest[m
[2m[doctest] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[doctest] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[doctest] [m[1;36mPhase: unpackPhase[m
[2m[doctest] [munpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
[2m[doctest] [msource root is doctest-0.24.2
[2m[doctest] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
[2m[doctest] [m[1;36mPhase: patchPhase[m
[2m[doctest] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[doctest] [msetupCompileFlags: -package-db=/build/tmp.m0OZwq2jdg/setup-package.conf.d -threaded
[2m[doctest] [m[1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.m0OZwq2jdg/Main.o )
[2m[doctest] [m[2 of 2] Linking Setup
[2m[cabal-doctest] [mDocumentation created: dist/doc/html/cabal-doctest/,
[2m[cabal-doctest] [mdist/doc/html/cabal-doctest/cabal-doctest.txt
[2m[cabal-doctest] [m[1;36mPhase: installPhase[m
[2m[cabal-doctest] [mInstalling library in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
[2m[cabal-doctest] [m[1;36mPhase: fixupPhase[m
[2m[cabal-doctest] [mshrinking RPATHs of ELF executables and libraries in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
[2m[cabal-doctest] [mshrinking /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHScabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m-ghc9.10.3.so
[2m[cabal-doctest] [mchecking for references to /build/ in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12...
[2m[cabal-doctest] [mpatching script interpreter paths in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
[2m[cabal-doctest] [mstripping (with command strip and flags -S -p) in  /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib
[2m[cabal-doctest] [mshrinking RPATHs of ELF executables and libraries in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
[2m[cabal-doctest] [mchecking for references to /build/ in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc...
[2m[cabal-doctest] [mpatching script interpreter paths in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc[m
[2m[post-build-hook] [m[2mPushing 2 paths (74 are already present) using zstd to cache sellout ⏳[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mPushing /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 (801.50 KiB)[m
[2m[post-build-hook] [m[2mPushing /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc (379.52 KiB)[m
[2m[post-build-hook] [m[2m[m
[2m[post-build-hook] [m[2mAll done.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 2 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 4 of 22 built (1 building), 193 of 193 downloaded from cache[m
[2m[doctest] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[doctest] [m[1;36mPhase: configurePhase[m
[2m[doctest] [mconfigureFlags: --verbose --prefix=/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.m0OZwq2jdg/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
[2m[doctest] [mUsing Parsec parser
[2m[doctest] [mConfiguring doctest-0.24.2...
[2m[doctest] [mFlags chosen: cabal-doctest=False
[2m[doctest] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[doctest] [mDependency code-page >=0.1: using code-page-0.2.1
[2m[doctest] [mDependency containers: using containers-0.7
[2m[doctest] [mDependency deepseq: using deepseq-1.5.0.0
[2m[doctest] [mDependency directory: using directory-1.3.8.5
[2m[doctest] [mDependency exceptions: using exceptions-0.10.9
[2m[doctest] [mDependency filepath: using filepath-1.5.4.0
[2m[doctest] [mDependency ghc >=8.6 && <9.14: using ghc-9.10.3
[2m[doctest] [mDependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
[2m[doctest] [mDependency process: using process-1.6.26.1
[2m[doctest] [mDependency syb >=0.3: using syb-0.7.2.4
[2m[doctest] [mDependency temporary: using temporary-1.3
[2m[doctest] [mDependency transformers: using transformers-0.6.1.1
[2m[doctest] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[doctest] [mDependency doctest: using doctest-0.24.2
[2m[doctest] [mDependency HUnit: using HUnit-1.6.2.0
[2m[doctest] [mDependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
[2m[doctest] [mDependency base >=4.12 && <5: using base-4.20.2.0
[2m[doctest] [mDependency code-page >=0.1: using code-page-0.2.1
[2m[doctest] [mDependency containers: using containers-0.7
[2m[doctest] [mDependency deepseq: using deepseq-1.5.0.0
[2m[doctest] [mDependency directory: using directory-1.3.8.5
[2m[doctest] [mDependency exceptions: using exceptions-0.10.9
[2m[doctest] [mDependency filepath: using filepath-1.5.4.0
[2m[doctest] [mDependency ghc >=8.6 && <9.14: using ghc-9.10.3
[2m[doctest] [mDependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
[2m[doctest] [mDependency hspec >=2.3.0: using hspec-2.11.14
[2m[doctest] [mDependency hspec-core >=2.3.0: using hspec-core-2.11.14
[2m[doctest] [mDependency mockery: using mockery-0.3.5
[2m[doctest] [mDependency process: using process-1.6.26.1
[2m[doctest] [mDependency silently >=1.2.4: using silently-1.2.5.4
[2m[doctest] [mDependency stringbuilder >=0.4: using stringbuilder-0.5.1
[2m[doctest] [mDependency syb >=0.3: using syb-0.7.2.4
[2m[doctest] [mDependency temporary: using temporary-1.3
[2m[doctest] [mDependency transformers: using transformers-0.6.1.1
[2m[doctest] [mSource component graph:
[2m[doctest] [m    component test:spec
[2m[doctest] [m    component lib
[2m[doctest] [m    component exe:doctest dependency lib
[2m[doctest] [mConfigured component graph:
[2m[doctest] [m    component doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
[2m[doctest] [m        include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
[2m[doctest] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[doctest] [m        include base-4.20.2.0-acb8
[2m[doctest] [m        include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
[2m[doctest] [m        include containers-0.7-a3f6
[2m[doctest] [m        include deepseq-1.5.0.0-7e72
[2m[doctest] [m        include directory-1.3.8.5-e377
[2m[doctest] [m        include exceptions-0.10.9-0130
[2m[doctest] [m        include filepath-1.5.4.0-c4eb
[2m[doctest] [m        include ghc-9.10.3-5702
[2m[doctest] [m        include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[doctest] [m        include hspec-2.11.14-K0D92V7bzH349viEnZTxvm
[2m[doctest] [m        include hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
[2m[doctest] [m        include mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
[2m[doctest] [m        include process-1.6.26.1-c5d9
[2m[doctest] [m        include silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
[2m[doctest] [m        include stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
[2m[doctest] [m        include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
[2m[doctest] [m        include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
[2m[doctest] [m        include transformers-0.6.1.1-74e0
[2m[doctest] [m    component doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [m        include base-4.20.2.0-acb8
[2m[doctest] [m        include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
[2m[doctest] [m        include containers-0.7-a3f6
[2m[doctest] [m        include deepseq-1.5.0.0-7e72
[2m[doctest] [m        include directory-1.3.8.5-e377
[2m[doctest] [m        include exceptions-0.10.9-0130
[2m[doctest] [m        include filepath-1.5.4.0-c4eb
[2m[doctest] [m        include ghc-9.10.3-5702
[2m[doctest] [m        include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[doctest] [m        include process-1.6.26.1-c5d9
[2m[doctest] [m        include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
[2m[doctest] [m        include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
[2m[doctest] [m        include transformers-0.6.1.1-74e0
[2m[doctest] [m    component doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
[2m[doctest] [m        include base-4.20.2.0-acb8
[2m[doctest] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [mLinked component graph:
[2m[doctest] [m    unit doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
[2m[doctest] [m        include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
[2m[doctest] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[doctest] [m        include base-4.20.2.0-acb8
[2m[doctest] [m        include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
[2m[doctest] [m        include containers-0.7-a3f6
[2m[doctest] [m        include deepseq-1.5.0.0-7e72
[2m[doctest] [m        include directory-1.3.8.5-e377
[2m[doctest] [m        include exceptions-0.10.9-0130
[2m[doctest] [m        include filepath-1.5.4.0-c4eb
[2m[doctest] [m        include ghc-9.10.3-5702
[2m[doctest] [m        include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[doctest] [m        include hspec-2.11.14-K0D92V7bzH349viEnZTxvm
[2m[doctest] [m        include hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
[2m[doctest] [m        include mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
[2m[doctest] [m        include process-1.6.26.1-c5d9
[2m[doctest] [m        include silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
[2m[doctest] [m        include stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
[2m[doctest] [m        include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
[2m[doctest] [m        include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
[2m[doctest] [m        include transformers-0.6.1.1-74e0
[2m[doctest] [m    unit doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [m        include base-4.20.2.0-acb8
[2m[doctest] [m        include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
[2m[doctest] [m        include containers-0.7-a3f6
[2m[doctest] [m        include deepseq-1.5.0.0-7e72
[2m[doctest] [m        include directory-1.3.8.5-e377
[2m[doctest] [m        include exceptions-0.10.9-0130
[2m[doctest] [m        include filepath-1.5.4.0-c4eb
[2m[doctest] [m        include ghc-9.10.3-5702
[2m[doctest] [m        include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[doctest] [m        include process-1.6.26.1-c5d9
[2m[doctest] [m        include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
[2m[doctest] [m        include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
[2m[doctest] [m        include transformers-0.6.1.1-74e0
[2m[doctest] [m        Test.DocTest=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Run
[2m[doctest] [m    unit doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
[2m[doctest] [m        include base-4.20.2.0-acb8
[2m[doctest] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [mReady component graph:
[2m[doctest] [m    definite doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
[2m[doctest] [m        depends HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
[2m[doctest] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[doctest] [m        depends base-4.20.2.0-acb8
[2m[doctest] [m        depends code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
[2m[doctest] [m        depends containers-0.7-a3f6
[2m[doctest] [m        depends deepseq-1.5.0.0-7e72
[2m[doctest] [m        depends directory-1.3.8.5-e377
[2m[doctest] [m        depends exceptions-0.10.9-0130
[2m[doctest] [m        depends filepath-1.5.4.0-c4eb
[2m[doctest] [m        depends ghc-9.10.3-5702
[2m[doctest] [m        depends ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[doctest] [m        depends hspec-2.11.14-K0D92V7bzH349viEnZTxvm
[2m[doctest] [m        depends hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
[2m[doctest] [m        depends mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
[2m[doctest] [m        depends process-1.6.26.1-c5d9
[2m[doctest] [m        depends silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
[2m[doctest] [m        depends stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
[2m[doctest] [m        depends syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
[2m[doctest] [m        depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
[2m[doctest] [m        depends transformers-0.6.1.1-74e0
[2m[doctest] [m    definite doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [m        depends base-4.20.2.0-acb8
[2m[doctest] [m        depends code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
[2m[doctest] [m        depends containers-0.7-a3f6
[2m[doctest] [m        depends deepseq-1.5.0.0-7e72
[2m[doctest] [m        depends directory-1.3.8.5-e377
[2m[doctest] [m        depends exceptions-0.10.9-0130
[2m[doctest] [m        depends filepath-1.5.4.0-c4eb
[2m[doctest] [m        depends ghc-9.10.3-5702
[2m[doctest] [m        depends ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
[2m[doctest] [m        depends process-1.6.26.1-c5d9
[2m[doctest] [m        depends syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
[2m[doctest] [m        depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
[2m[doctest] [m        depends transformers-0.6.1.1-74e0
[2m[doctest] [m    definite doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
[2m[doctest] [m        depends base-4.20.2.0-acb8
[2m[doctest] [m        depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[doctest] [mUsing compiler: ghc-9.10.3
[2m[doctest] [mUsing install prefix:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
[2m[doctest] [mExecutables installed in:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
[2m[doctest] [mLibraries installed in:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [mDynamic Libraries installed in:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[doctest] [mPrivate executables installed in:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/libexec/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2
[2m[doctest] [mData files installed in:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/share/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2
[2m[doctest] [mDocumentation installed in:
[2m[doctest] [m/nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc/share/doc/doctest-0.24.2
[2m[doctest] [mConfiguration files installed in:
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/etc
[2m[doctest] [mNo alex found
[2m[doctest] [mUsing ar found on system at:
[2m[doctest] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[doctest] [mNo c2hs found
[2m[doctest] [mNo cpphs found
[2m[doctest] [mNo doctest found
[2m[doctest] [mUsing gcc version 14.3.0 given by user at:
[2m[doctest] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[doctest] [mUsing ghc version 9.10.3 found on system at:
[2m[doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[doctest] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[doctest] [mNo ghcjs found
[2m[doctest] [mNo ghcjs-pkg found
[2m[doctest] [mNo greencard found
[2m[doctest] [mUsing haddock version 2.31.1 found on system at:
[2m[doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[2m[doctest] [mNo happy found
[2m[doctest] [mUsing haskell-suite found on system at: haskell-suite-dummy-location
[2m[doctest] [mUsing haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
[2m[doctest] [mNo hmake found
[2m[doctest] [mUsing hpc version 0.69 found on system at:
[2m[doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[doctest] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[doctest] [mUsing hscolour version 1.25 found on system at:
[2m[doctest] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[doctest] [mNo jhc found
[2m[doctest] [mUsing ld found on system at:
[2m[doctest] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[doctest] [mNo pkg-config found
[2m[doctest] [mUsing runghc version 9.10.3 found on system at:
[2m[doctest] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[doctest] [mUsing strip version 2.44 found on system at:
[2m[doctest] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[doctest] [mUsing tar found on system at:
[2m[doctest] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[doctest] [mNo uhc found
[2m[doctest] [m[1;36mPhase: buildPhase[m
[2m[doctest] [mPreprocessing test suite 'spec' for doctest-0.24.2...
[2m[doctest] [mBuilding test suite 'spec' for doctest-0.24.2...
[2m[doctest] [m[ 1 of 44] Compiling Imports          ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
[2m[doctest] [m[ 2 of 44] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
[2m[doctest] [m[ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
[2m[doctest] [m[ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
[2m[doctest] [m[ 5 of 44] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
[2m[doctest] [m[ 6 of 44] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
[2m[doctest] [m[ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
[2m[doctest] [m[ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
[2m[doctest] [m[ 9 of 44] Compiling Interpreter      ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
[2m[doctest] [m[10 of 44] Compiling InterpreterSpec  ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
[2m[doctest] [m[11 of 44] Compiling Info             ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
[2m[doctest] [m[12 of 44] Compiling InfoSpec         ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
[2m[doctest] [m[13 of 44] Compiling Cabal            ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
[2m[doctest] [m[14 of 44] Compiling Cabal.PathsSpec  ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
[2m[doctest] [m[15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
[2m[doctest] [m[16 of 44] Compiling Location         ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
[2m[doctest] [m[17 of 44] Compiling LocationSpec     ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
[2m[doctest] [m[18 of 44] Compiling Options          ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
[2m[doctest] [m[19 of 44] Compiling OptionsSpec      ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
[2m[doctest] [m[20 of 44] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
[2m[doctest] [m[21 of 44] Compiling PackageDBsSpec   ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
[2m[doctest] [m[22 of 44] Compiling Paths_doctest    ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
[2m[doctest] [m[23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
[2m[doctest] [m[24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
[2m[doctest] [m[25 of 44] Compiling Util             ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
[2m[doctest] [m[26 of 44] Compiling Extract          ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
[2m[doctest] [m[27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
[2m[doctest] [m[28 of 44] Compiling Parse            ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
[2m[doctest] [m[29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
[2m[doctest] [m[30 of 44] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
[2m[doctest] [m[31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
[2m[doctest] [m[32 of 44] Compiling Property         ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
[2m[doctest] [m[33 of 44] Compiling Runner           ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
[2m[doctest] [m[34 of 44] Compiling RunnerSpec       ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
[2m[doctest] [m[35 of 44] Compiling Run              ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
[2m[doctest] [m[36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
[2m[doctest] [m[37 of 44] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
[2m[doctest] [m[38 of 44] Compiling RunSpec          ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
[2m[doctest] [m[39 of 44] Compiling MainSpec         ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
[2m[doctest] [m[40 of 44] Compiling PropertySpec     ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
[2m[doctest] [m[41 of 44] Compiling ParseSpec        ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
[2m[doctest] [m[42 of 44] Compiling ExtractSpec      ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
[2m[doctest] [m[43 of 44] Compiling UtilSpec         ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
[2m[doctest] [m[44 of 44] Compiling Main             ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
[2m[doctest] [m[45 of 45] Linking dist/build/spec/spec
[2m[doctest] [mPreprocessing library for doctest-0.24.2...
[2m[doctest] [mBuilding library for doctest-0.24.2...
[2m[doctest] [m[ 1 of 26] Compiling Imports          ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
[2m[doctest] [m[ 2 of 26] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
[2m[doctest] [m[ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
[2m[doctest] [m[ 4 of 26] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
[2m[doctest] [m[ 5 of 26] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
[2m[doctest] [m[ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
[2m[doctest] [m[ 7 of 26] Compiling Interpreter      ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
[2m[doctest] [m[ 8 of 26] Compiling Location         ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
[2m[doctest] [m[ 9 of 26] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
[2m[doctest] [m[10 of 26] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
[2m[doctest] [m[11 of 26] Compiling Info             ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
[2m[doctest] [m[12 of 26] Compiling Options          ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
[2m[doctest] [m[13 of 26] Compiling Cabal            ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
[2m[doctest] [m[14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
[2m[doctest] [m[15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
[2m[doctest] [m[16 of 26] Compiling Util             ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
[2m[doctest] [m[17 of 26] Compiling Extract          ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
[2m[doctest] [m[18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
[2m[doctest] [m[19 of 26] Compiling Parse            ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
[2m[doctest] [m[20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
[2m[doctest] [m[21 of 26] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
[2m[doctest] [m[22 of 26] Compiling Property         ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
[2m[doctest] [m[23 of 26] Compiling Runner           ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
[2m[doctest] [m[24 of 26] Compiling Run              ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
[2m[doctest] [m[25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
[2m[doctest] [m[26 of 26] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
[2m[doctest] [m[ 1 of 26] Compiling Imports          ( src/Imports.hs, dist/build/Imports.p_o )
[2m[doctest] [m[ 2 of 26] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
[2m[doctest] [m[ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
[2m[doctest] [m[ 4 of 26] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
[2m[doctest] [m[ 5 of 26] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
[2m[doctest] [m[ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
[2m[doctest] [m[ 7 of 26] Compiling Interpreter      ( src/Interpreter.hs, dist/build/Interpreter.p_o )
[2m[doctest] [m[ 8 of 26] Compiling Location         ( src/Location.hs, dist/build/Location.p_o )
[2m[doctest] [m[ 9 of 26] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
[2m[doctest] [m[10 of 26] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
[2m[doctest] [m[11 of 26] Compiling Info             ( src/Info.hs, dist/build/Info.p_o )
[2m[doctest] [m[12 of 26] Compiling Options          ( src/Options.hs, dist/build/Options.p_o )
[2m[doctest] [m[13 of 26] Compiling Cabal            ( src/Cabal.hs, dist/build/Cabal.p_o )
[2m[doctest] [m[14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
[2m[doctest] [m[15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
[2m[doctest] [m[16 of 26] Compiling Util             ( src/Util.hs, dist/build/Util.p_o )
[2m[doctest] [m[17 of 26] Compiling Extract          ( src/Extract.hs, dist/build/Extract.p_o )
[2m[doctest] [m[18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
[2m[doctest] [m[19 of 26] Compiling Parse            ( src/Parse.hs, dist/build/Parse.p_o )
[2m[doctest] [m[20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
[2m[doctest] [m[21 of 26] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
[2m[doctest] [m[22 of 26] Compiling Property         ( src/Property.hs, dist/build/Property.p_o )
[2m[doctest] [m[23 of 26] Compiling Runner           ( src/Runner.hs, dist/build/Runner.p_o )
[2m[doctest] [m[24 of 26] Compiling Run              ( src/Run.hs, dist/build/Run.p_o )
[2m[doctest] [m[25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
[2m[doctest] [m[26 of 26] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
[2m[doctest] [mPreprocessing executable 'doctest' for doctest-0.24.2...
[2m[doctest] [mBuilding executable 'doctest' for doctest-0.24.2...
[2m[doctest] [m[1 of 2] Compiling Main             ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
[2m[doctest] [m[2 of 2] Compiling Paths_doctest    ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
[2m[doctest] [m[3 of 3] Linking dist/build/doctest/doctest
[2m[doctest] [mbuildPhase completed in 1 minutes 59 seconds
[2m[doctest] [m[1;36mPhase: checkPhase[m
[2m[doctest] [mRunning 1 test suites...
[2m[doctest] [mTest suite spec: RUNNING...
[2m[doctest] [m
[2m[doctest] [mExtract
[2m[doctest] [m  extract
[2m[doctest] [m    extracts documentation for a top-level declaration [✔]
[2m[doctest] [m    extracts documentation from argument list [✔]
[2m[doctest] [m    extracts documentation for a type class function [✔]
[2m[doctest] [m    extracts documentation from the argument list of a type class function [✔]
[2m[doctest] [m    extracts documentation from the module header [✔]
[2m[doctest] [m    extracts documentation from imported modules [✔]
[2m[doctest] [m    extracts documentation from export list [✔]
[2m[doctest] [m    extracts documentation from named chunks [✔]
[2m[doctest] [m    returns docstrings in the same order they appear in the source [✔]
[2m[doctest] [m    extracts $setup code [✔]
[2m[doctest] [m    fails on invalid flags [✔]
[2m[doctest] [m  extract (regression tests)
[2m[doctest] [m    works with infix operators [✔]
[2m[doctest] [m    works with parallel list comprehensions [✔]
[2m[doctest] [m    works with list comprehensions in instance definitions [✔]
[2m[doctest] [m    works with foreign imports [✔]
[2m[doctest] [m    works for rewrite rules [✔]
[2m[doctest] [m    works for rewrite rules with type signatures [✔]
[2m[doctest] [m    strips CR from dos line endings [✔]
[2m[doctest] [m    works with a module that splices in an expression from an other module [✔]
[2m[doctest] [m    works for type families and GHC 7.6.1 [✔]
[2m[doctest] [mInfo
[2m[doctest] [m  formatInfo
[2m[doctest] [m    formats --info output [✔]
[2m[doctest] [mInterpreter
[2m[doctest] [m  interpreterSupported
[2m[doctest] [m    indicates whether GHCi is supported on current platform [✔]
[2m[doctest] [m  ghcInfo
[2m[doctest] [m    includes "Have interpreter" [✔]
[2m[doctest] [m  safeEval
[2m[doctest] [m    evaluates an expression [✔]
[2m[doctest] [m    returns Left on unterminated multiline command [✔]
[2m[doctest] [m  filterExpression
[2m[doctest] [m    removes :set -XTemplateHaskell [✔]
[2m[doctest] [m    filters -XTemplateHaskell [✔]
[2m[doctest] [m    leaves :set-statement that do not set -XTemplateHaskell alone  [✔]
[2m[doctest] [mLanguage.Haskell.GhciWrapper
[2m[doctest] [m  evalEcho
[2m[doctest] [m    prints result to stdout [✔]
[2m[doctest] [m  evalWith
[2m[doctest] [m    with PreserveIt
[2m[doctest] [m      preserves it [✔]
[2m[doctest] [m  eval
[2m[doctest] [m    shows literals [✔]
[2m[doctest] [m    shows string literals containing Unicode [✔]
[2m[doctest] [m    evaluates simple expressions [✔]
[2m[doctest] [m    supports let bindings [✔]
[2m[doctest] [m    allows import statements [✔]
[2m[doctest] [m    captures stdout [✔]
[2m[doctest] [m    captures stdout (Unicode) [✔]
[2m[doctest] [m    captures stdout (empty line) [✔]
[2m[doctest] [m    captures stdout (multiple lines) [✔]
[2m[doctest] [m    captures stderr [✔]
[2m[doctest] [m    captures stderr (Unicode) [✔]
[2m[doctest] [m    shows exceptions [✔]
[2m[doctest] [m    shows exceptions (ExitCode) [✔]
[2m[doctest] [m    gives an error message for identifiers that are not in scope [✔]
[2m[doctest] [m    when configVerbose is True
[2m[doctest] [m      prints prompt [✔]
[2m[doctest] [m    with -XOverloadedStrings, -Wall and -Werror
[2m[doctest] [m      does not fail on marker expression (bug fix) [✔]
[2m[doctest] [m    with NoImplicitPrelude
[2m[doctest] [m      works [✔]
[2m[doctest] [m    with a strange String type
[2m[doctest] [m      works [✔]
[2m[doctest] [mLocation
[2m[doctest] [m  toLocation
[2m[doctest] [m    works for a regular SrcSpan [✔]
[2m[doctest] [m    works for a single-line SrcSpan [✔]
[2m[doctest] [m    works for a SrcSpan that corresponds to single point [✔]
[2m[doctest] [m    works for a bad SrcSpan [✔]
[2m[doctest] [m    works for a SrcLoc with bad locations [✔]
[2m[doctest] [m  enumerate
[2m[doctest] [m    replicates UnhelpfulLocation [✔]
[2m[doctest] [m    enumerates Location [✔]
[2m[doctest] [mMain
[2m[doctest] [m  doctest
[2m[doctest] [m    testSimple [✔]
[2m[doctest] [m    it-variable [✔]
[2m[doctest] [m    it-variable in $setup [✔]
[2m[doctest] [m    failing [✔]
[2m[doctest] [m    skips subsequent examples from the same group if an example fails [✔]
[2m[doctest] [m    without --fail-fast
[2m[doctest] [m      continuous even if some tests fail [✔]
[2m[doctest] [m    with --fail-fast
[2m[doctest] [m      stops after the first failure [✔]
[2m[doctest] [m      stops after failures in $setup [✔]
[2m[doctest] [m    testImport [✔]
[2m[doctest] [m    testCommentLocation [✔]
[2m[doctest] [m    testPutStr [✔]
[2m[doctest] [m    fails on multi-line expressions, introduced with :{ [✔]
[2m[doctest] [m    testBlankline [✔]
[2m[doctest] [m    examples from the same Haddock comment share the same scope [✔]
[2m[doctest] [m    testDocumentationForArguments [✔]
[2m[doctest] [m    template-haskell [✔]
[2m[doctest] [m    handles source files with CRLF line endings [✔]
[2m[doctest] [m    runs $setup before each test group [✔]
[2m[doctest] [m    skips subsequent tests from a module, if $setup fails [✔]
[2m[doctest] [m    ignores trailing whitespace when matching test output [✔]
[2m[doctest] [m  doctest as a runner for QuickCheck properties
[2m[doctest] [m    runs a boolean property [✔]
[2m[doctest] [m    runs an explicitly quantified property [✔]
[2m[doctest] [m    runs an implicitly quantified property [✔]
[2m[doctest] [m    reports a failing property [✔]
[2m[doctest] [m    runs a boolean property with an explicit type signature [✔]
[2m[doctest] [m    runs $setup before each property [✔]
[2m[doctest] [m  doctest (regression tests)
[2m[doctest] [m    bugfixWorkingDirectory [✔]
[2m[doctest] [m    bugfixOutputToStdErr [✔]
[2m[doctest] [m    bugfixImportHierarchical [✔]
[2m[doctest] [m    bugfixMultipleModules [✔]
[2m[doctest] [m    testCPP [✔]
[2m[doctest] [m    template-haskell-bugfix [✔]
[2m[doctest] [m    doesn't clash with user bindings of stdout/stderr [✔]
[2m[doctest] [m    doesn't get confused by doctests using System.IO imports [✔]
[2m[doctest] [mOptions
[2m[doctest] [m  parseOptions
[2m[doctest] [m    strips --optghc [✔]
[2m[doctest] [m    strips --optghc= [✔]
[2m[doctest] [m    with ghc options that are not valid with --interactive
[2m[doctest] [m      returns ProxyToGhc [✔]
[2m[doctest] [m        +++ OK, passed 100 tests.
[2m[doctest] [m    with --interactive
[2m[doctest] [m      disables magic mode [✔]
[2m[doctest] [m      filters out --interactive [✔]
[2m[doctest] [m      accepts --fast [✔]
[2m[doctest] [m    --no-magic
[2m[doctest] [m      without --no-magic
[2m[doctest] [m        enables magic mode [✔]
[2m[doctest] [m      with --no-magic
[2m[doctest] [m        disables magic mode [✔]
[2m[doctest] [m    --fast
[2m[doctest] [m      without --fast
[2m[doctest] [m        disables fast mode [✔]
[2m[doctest] [m      with --fast
[2m[doctest] [m        enables fast mode [✔]
[2m[doctest] [m    --preserve-it
[2m[doctest] [m      without --preserve-it
[2m[doctest] [m        does not preserve the `it` variable [✔]
[2m[doctest] [m      with --preserve-it
[2m[doctest] [m        preserves the `it` variable [✔]
[2m[doctest] [m    --fail-fast
[2m[doctest] [m      without --fail-fast
[2m[doctest] [m        disables fail-fast mode [✔]
[2m[doctest] [m      with --fail-fast
[2m[doctest] [m        enables fail-fast mode [✔]
[2m[doctest] [m    with --help
[2m[doctest] [m      outputs usage information [✔]
[2m[doctest] [m    with --version
[2m[doctest] [m      outputs version information [✔]
[2m[doctest] [m    with --info
[2m[doctest] [m      outputs machine readable version information [✔]
[2m[doctest] [m    --verbose
[2m[doctest] [m      without --verbose
[2m[doctest] [m        is not verbose by default [✔]
[2m[doctest] [m      with --verbose
[2m[doctest] [m        parses verbose option [✔]
[2m[doctest] [mPackageDBs
[2m[doctest] [m  getPackageDBsFromEnv
[2m[doctest] [m    uses global and user when no env used [✔]
[2m[doctest] [m    respects GHC_PACKAGE_PATH [✔]
[2m[doctest] [mParse
[2m[doctest] [m  extractDocTests
[2m[doctest] [m    extracts properties from a module [✔]
[2m[doctest] [m    extracts examples from a module [✔]
[2m[doctest] [m    extracts examples from documentation for non-exported names [✔]
[2m[doctest] [m    extracts multiple examples from a module [✔]
[2m[doctest] [m    returns an empty list, if documentation contains no examples [✔]
[2m[doctest] [m    sets setup code to Nothing, if it does not contain any tests [✔]
[2m[doctest] [m    keeps modules that only contain setup code [✔]
[2m[doctest] [m  parseInteractions (an internal function)
[2m[doctest] [m    parses an interaction [✔]
[2m[doctest] [m    drops whitespace as appropriate [✔]
[2m[doctest] [m    parses an interaction without a result [✔]
[2m[doctest] [m    works with a complex example [✔]
[2m[doctest] [m    attaches location information to parsed interactions [✔]
[2m[doctest] [m    basic multiline [✔]
[2m[doctest] [m    multiline align output [✔]
[2m[doctest] [m    multiline align output with >>> [✔]
[2m[doctest] [m    parses wild cards lines [✔]
[2m[doctest] [m    parses wild card chunks [✔]
[2m[doctest] [m   parseProperties (an internal function)
[2m[doctest] [m    parses a property [✔]
[2m[doctest] [m  mkLineChunks (an internal function)
[2m[doctest] [m    replaces ellipsis with WildCardChunks [✔]
[2m[doctest] [m    doesn't replace fewer than 3 consecutive dots [✔]
[2m[doctest] [m    handles leading and trailing dots [✔]
[2m[doctest] [m    handles leading and trailing ellipsis [✔]
[2m[doctest] [mProperty
[2m[doctest] [m  runProperty
[2m[doctest] [m    reports a failing property [✔]
[2m[doctest] [m    runs a Bool property [✔]
[2m[doctest] [m    runs a Bool property with an explicit type signature [✔]
[2m[doctest] [m    runs an implicitly quantified property [✔]
[2m[doctest] [m    runs an implicitly quantified property even with GHC 7.4 [✔]
[2m[doctest] [m    runs an explicitly quantified property [✔]
[2m[doctest] [m    allows to mix implicit and explicit quantification [✔]
[2m[doctest] [m    reports the value for which a property fails [✔]
[2m[doctest] [m    reports the values for which a property that takes multiple arguments fails [✔]
[2m[doctest] [m    defaults ambiguous type variables to Integer [✔]
[2m[doctest] [m  freeVariables
[2m[doctest] [m    finds a free variables in a term [✔]
[2m[doctest] [m    ignores duplicates [✔]
[2m[doctest] [m    works for terms with multiple names [✔]
[2m[doctest] [m    works for names that contain a prime [✔]
[2m[doctest] [m    works for names that are similar to other names that are in scope [✔]
[2m[doctest] [m  parseNotInScope
[2m[doctest] [m    when error message was produced by GHC 7.4.1
[2m[doctest] [m      extracts a variable name of variable that is not in scope from an error message [✔]
[2m[doctest] [m      ignores duplicates [✔]
[2m[doctest] [m      works for variable names that contain a prime [✔]
[2m[doctest] [m      works for error messages with suggestions [✔]
[2m[doctest] [m    when error message was produced by GHC 8.0.1
[2m[doctest] [m      extracts a variable name of variable that is not in scope from an error message [✔]
[2m[doctest] [m      ignores duplicates [✔]
[2m[doctest] [m      works for variable names that contain a prime [✔]
[2m[doctest] [m      works for error messages with suggestions [✔]
[2m[doctest] [mRun
[2m[doctest] [m  doctest
[2m[doctest] [m    exits with ExitFailure if at least one test case fails [✔]
[2m[doctest] [m    prints help on --help [✔]
[2m[doctest] [m    prints version on --version [✔]
[2m[doctest] [m    accepts arbitrary GHC options [✔]
[2m[doctest] [m    accepts GHC options with --optghc [✔]
[2m[doctest] [m    prints a deprecation message for --optghc [✔]
[2m[doctest] [m    prints error message on invalid option [✔]
[2m[doctest] [m    interprets GHC response files [✔]
[2m[doctest] [m    prints verbose description of a specification [✔]
[2m[doctest] [m    prints verbose description of a property [✔]
[2m[doctest] [m    prints verbose error [✔]
[2m[doctest] [m    can deal with potentially problematic GHC options [✔]
[2m[doctest] [m  doctestWithResult
[2m[doctest] [m    on parse error
[2m[doctest] [m      aborts with (ExitFailure 1) [✔]
[2m[doctest] [m      prints a useful error message [✔]
[2m[doctest] [m  expandDirs
[2m[doctest] [m    expands a directory [✔]
[2m[doctest] [m    ignores files [✔]
[2m[doctest] [m    ignores random things [✔]
[2m[doctest] [mRunner
[2m[doctest] [m  report
[2m[doctest] [m    when mode is interactive
[2m[doctest] [m      writes to stderr [✔]
[2m[doctest] [m    when mode is non-interactive
[2m[doctest] [m      writes to stderr [✔]
[2m[doctest] [m  report_
[2m[doctest] [m    when mode is interactive
[2m[doctest] [m      writes transient output to stderr [✔]
[2m[doctest] [m    when mode is non-interactive
[2m[doctest] [m      is ignored [✔]
[2m[doctest] [mRunner.Example
[2m[doctest] [m  mkResult
[2m[doctest] [m    returns Equal when output matches [✔]
[2m[doctest] [m      +++ OK, passed 100 tests.
[2m[doctest] [m    ignores trailing whitespace [✔]
[2m[doctest] [m    with WildCardLine
[2m[doctest] [m      matches zero lines [✔]
[2m[doctest] [m      matches first zero line [✔]
[2m[doctest] [m      matches final zero line [✔]
[2m[doctest] [m      matches an arbitrary number of lines [✔]
[2m[doctest] [m      matches an arbitrary number of lines (quickcheck) [✔]
[2m[doctest] [m        +++ OK, passed 100 tests.
[2m[doctest] [m    with WildCardChunk
[2m[doctest] [m      matches an arbitrary line chunk [✔]
[2m[doctest] [m      matches an arbitrary line chunk at end [✔]
[2m[doctest] [m      does not match at end [✔]
[2m[doctest] [m      does not match at start [✔]
[2m[doctest] [m    when output does not match
[2m[doctest] [m      constructs failure message [✔]
[2m[doctest] [m      constructs failure message for multi-line output [✔]
[2m[doctest] [m      when any output line contains "unsafe" characters
[2m[doctest] [m        uses show to format output lines [✔]
[2m[doctest] [m      insert caret after last matching character on different lengths [✔]
[2m[doctest] [m      insert caret after mismatching line for multi-line output [✔]
[2m[doctest] [m      insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
[2m[doctest] [m      insert caret after longest match for wildcard [✔]
[2m[doctest] [m      show expanded pattern for long matches [✔]
[2m[doctest] [mUtil
[2m[doctest] [m  convertDosLineEndings
[2m[doctest] [m    converts CRLF to LF [✔]
[2m[doctest] [m    strips a trailing CR [✔]
[2m[doctest] [m  takeWhileEnd
[2m[doctest] [m    returns the longest suffix of elements that satisfy a given predicate [✔]
[2m[doctest] [m
[2m[doctest] [mFinished in 74.7809 seconds
[2m[doctest] [m198 examples, 0 failures
[2m[doctest] [mTest suite spec: PASS
[2m[doctest] [mTest suite logged to: dist/test/doctest-0.24.2-spec.log
[2m[doctest] [m1 of 1 test suites (1 of 1 test cases) passed.
[2m[doctest] [mcheckPhase completed in 1 minutes 16 seconds
[2m[doctest] [m[1;36mPhase: haddockPhase[m
[2m[doctest] [mPreprocessing test suite 'spec' for doctest-0.24.2...
[2m[doctest] [mPreprocessing library for doctest-0.24.2...
[2m[doctest] [mRunning Haddock on library for doctest-0.24.2...
[2m[doctest] [m[ 1 of 26] Compiling Imports          ( src/Imports.hs, nothing )
[2m[doctest] [m[ 2 of 26] Compiling GhcUtil          ( src/GhcUtil.hs, nothing )
[2m[doctest] [m[ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
[2m[doctest] [m[ 4 of 26] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, nothing )
[2m[doctest] [m[ 5 of 26] Compiling Cabal.Options    ( src/Cabal/Options.hs, nothing )
[2m[doctest] [m[ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
[2m[doctest] [m[ 7 of 26] Compiling Interpreter      ( src/Interpreter.hs, nothing )
[2m[doctest] [m[ 8 of 26] Compiling Location         ( src/Location.hs, nothing )
[2m[doctest] [m[ 9 of 26] Compiling PackageDBs       ( src/PackageDBs.hs, nothing )
[2m[doctest] [m[10 of 26] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, nothing )
[2m[doctest] [m[11 of 26] Compiling Info             ( src/Info.hs, nothing )
[2m[doctest] [m[12 of 26] Compiling Options          ( src/Options.hs, nothing )
[2m[doctest] [m[13 of 26] Compiling Cabal            ( src/Cabal.hs, nothing )
[2m[doctest] [m[14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
[2m[doctest] [m[15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
[2m[doctest] [m[16 of 26] Compiling Util             ( src/Util.hs, nothing )
[2m[doctest] [m[17 of 26] Compiling Extract          ( src/Extract.hs, nothing )
[2m[doctest] [m[18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
[2m[doctest] [m[19 of 26] Compiling Parse            ( src/Parse.hs, nothing )
[2m[doctest] [m[20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
[2m[doctest] [m[21 of 26] Compiling Runner.Example   ( src/Runner/Example.hs, nothing )
[2m[doctest] [m[22 of 26] Compiling Property         ( src/Property.hs, nothing )
[2m[doctest] [m[23 of 26] Compiling Runner           ( src/Runner.hs, nothing )
[2m[doctest] [m[24 of 26] Compiling Run              ( src/Run.hs, nothing )
[2m[doctest] [m[25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
[2m[doctest] [m[26 of 26] Compiling Test.DocTest     ( src/Test/DocTest.hs, nothing )
[2m[doctest] [mHaddock coverage:
[2m[doctest] [mWarning: Imports: Could not find documentation for exported module: Imports
[2m[doctest] [m   0% (  0 /  2) in 'Test.DocTest.Internal.Cabal'
[2m[doctest] [m  Missing documentation for:
[2m[doctest] [m    Module header
[2m[doctest] [m    doctest (src/Test/DocTest/Internal/Cabal.hs:10)
[2m[doctest] [m  88% (  8 /  9) in 'Test.DocTest.Internal.Location'
[2m[doctest] [m  Missing documentation for:
[2m[doctest] [m    Module header
[2m[doctest] [mWarning: 'SomeException' is ambiguous. It is defined
[2m[doctest] [m    * in ‘GHC.Internal.Exception.Type’
[2m[doctest] [m    * in ‘GHC.Internal.Exception.Type’
[2m[doctest] [m    You may be able to disambiguate the identifier by qualifying it or
[2m[doctest] [m    by specifying the type/value namespace explicitly.
[2m[doctest] [m    Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
[2m[doctest] [m  66% (  2 /  3) in 'Test.DocTest.Internal.Extract'
[2m[doctest] [m  Missing documentation for:
[2m[doctest] [m    Module header
[2m[doctest] [m  22% (  2 /  9) in 'Test.DocTest.Internal.Parse'
[2m[doctest] [m  Missing documentation for:
[2m[doctest] [m    Module header
[2m[doctest] [m    DocTest (src/Parse.hs:29)
[2m[doctest] [m    Expression (src/Parse.hs:44)
[2m[doctest] [m    ExpectedResult (src/Parse.hs:45)
[2m[doctest] [m    ExpectedLine (src/Parse.hs:38)
[2m[doctest] [m    LineChunk (src/Parse.hs:32)
[2m[doctest] [m    parseModules (src/Parse.hs:60)
[2m[doctest] [mWarning: 'report_' is out of scope.
[2m[doctest] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[doctest] [m  15% (  2 / 13) in 'Test.DocTest.Internal.Run'
[2m[doctest] [m  Missing documentation for:
[2m[doctest] [m    Module header
[2m[doctest] [m    Result (src/Run.hs:139)
[2m[doctest] [m    Config (src/Options.hs:58)
[2m[doctest] [m    isSuccess (src/Runner.hs:55)
[2m[doctest] [m    defaultConfig (src/Options.hs:68)
[2m[doctest] [m    doctestWithRepl (src/Run.hs:67)
[2m[doctest] [m    doctestWith (src/Run.hs:137)
[2m[doctest] [m    formatSummary (src/Runner.hs:58)
[2m[doctest] [m    evaluateResult (src/Run.hs:142)
[2m[doctest] [m    doctestWithResult (src/Run.hs:145)
[2m[doctest] [m    runDocTests (src/Run.hs:155)
[2m[doctest] [m  50% (  1 /  2) in 'Test.DocTest'
[2m[doctest] [m  Missing documentation for:
[2m[doctest] [m    Module header
[2m[doctest] [mDocumentation created: dist/doc/html/doctest/,
[2m[doctest] [mdist/doc/html/doctest/doctest.txt
[2m[doctest] [mPreprocessing executable 'doctest' for doctest-0.24.2...
[2m[doctest] [mhaddockPhase completed in 50 seconds
[2m[doctest] [m[1;36mPhase: installPhase[m
[2m[doctest] [mInstalling library in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[doctest] [mInstalling executable doctest in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
[2m[doctest] [mWarning: The directory
[2m[doctest] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin is not in the
[2m[doctest] [msystem search path.
[2m[doctest] [m[1;36mPhase: fixupPhase[m
[2m[doctest] [mshrinking RPATHs of ELF executables and libraries in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
[2m[doctest] [mshrinking /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
[2m[doctest] [mshrinking /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSdoctest-0.24.2-18dgXXsZmap5NU7dF4zxUR-ghc9.10.3.so
[2m[doctest] [mchecking for references to /build/ in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2...
[2m[doctest] [mpatching script interpreter paths in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
[2m[doctest] [mstripping (with command strip and flags -S -p) in  /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
[2m[doctest] [mshrinking RPATHs of ELF executables and libraries in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
[2m[doctest] [mchecking for references to /build/ in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc...
[2m[doctest] [mpatching script interpreter paths in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 5 of 22 built, 193 of 193 downloaded from cache[m
[1;34mBuilding duoids[m
[1;34mBuilding vector[m
[2m[duoids] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[duoids] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[vector] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[vector] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[duoids] [m[1;36mPhase: unpackPhase[m
[2m[duoids] [munpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-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.1ad8Hl5Fcb/setup-package.conf.d -threaded
[2m[duoids] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.1ad8Hl5Fcb/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/2.cabal.
[2m[vector] [mRun jailbreak-cabal to lift version restrictions on build inputs.
[2m[vector] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[vector] [msetupCompileFlags: -package-db=/build/tmp.X0qFWDXGKO/setup-package.conf.d -threaded
[2m[duoids] [m[2 of 2] Linking Setup
[2m[vector] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.X0qFWDXGKO/Main.o )
[2m[vector] [m[2 of 2] Linking Setup
[2m[vector] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[vector] [m[1;36mPhase: configurePhase[m
[2m[vector] [mconfigureFlags: --verbose --prefix=/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.X0qFWDXGKO/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
[2m[vector] [mUsing Parsec parser
[2m[vector] [mConfiguring vector-0.13.2.0...
[2m[duoids] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[duoids] [m[1;36mPhase: configurePhase[m
[2m[duoids] [mconfigureFlags: --verbose --prefix=/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.1ad8Hl5Fcb/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
[2m[duoids] [mUsing Parsec parser
[2m[duoids] [mConfiguring duoids-0.0.1.0...
[2m[vector] [mFlags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
[2m[vector] [mwall=False
[2m[duoids] [mFlags chosen: lint=False, noisy-deprecations=True
[2m[vector] [mDependency base: using base-4.20.2.0
[2m[vector] [mDependency deepseq: using deepseq-1.5.0.0
[2m[vector] [mDependency primitive: using primitive-0.9.1.0
[2m[vector] [mDependency vector-stream: using vector-stream-0.1.0.1
[2m[vector] [mDependency base: using base-4.20.2.0
[2m[vector] [mDependency random: 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: using QuickCheck-2.15.0.1
[2m[vector] [mDependency base: using base-4.20.2.0
[2m[vector] [mDependency base-orphans: 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.1
[2m[vector] [mDependency template-haskell: using template-haskell-2.22.0.0
[2m[vector] [mDependency transformers: using transformers-0.6.1.1
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency QuickCheck: using QuickCheck-2.15.0.1
[2m[vector] [mDependency base: using base-4.20.2.0
[2m[vector] [mDependency base-orphans: 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.1
[2m[vector] [mDependency template-haskell: using template-haskell-2.22.0.0
[2m[vector] [mDependency transformers: using transformers-0.6.1.1
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency base: using base-4.20.2.0
[2m[vector] [mDependency doctest: using doctest-0.24.2
[2m[vector] [mDependency primitive: using primitive-0.9.1.0
[2m[vector] [mDependency vector: using vector-0.13.2.0
[2m[vector] [mDependency base: using base-4.20.2.0
[2m[vector] [mDependency primitive: using primitive-0.9.1.0
[2m[vector] [mDependency tasty: using tasty-1.5.3
[2m[vector] [mDependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
[2m[vector] [mDependency vector: using vector-0.13.2.0
[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-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include deepseq-1.5.0.0-7e72
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
[2m[vector] [m    component vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    component vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    component vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    component vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
[2m[vector] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[vector] [m        include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[vector] [m        include template-haskell-2.22.0.0-af3f
[2m[vector] [m        include transformers-0.6.1.1-74e0
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    component vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
[2m[vector] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[vector] [m        include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[vector] [m        include template-haskell-2.22.0.0-af3f
[2m[vector] [m        include transformers-0.6.1.1-74e0
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [mLinked component graph:
[2m[vector] [m    unit vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include deepseq-1.5.0.0-7e72
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
[2m[vector] [m        Data.Vector=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed.Mutable
[2m[vector] [m    unit vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m        Bench.Vector.Algo.AwShCC=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.TestData.ParenTree
[2m[vector] [m    unit vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    unit vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    unit vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
[2m[vector] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[vector] [m        include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[vector] [m        include template-haskell-2.22.0.0-af3f
[2m[vector] [m        include transformers-0.6.1.1-74e0
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    unit vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
[2m[vector] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[vector] [m        include base-4.20.2.0-acb8
[2m[vector] [m        include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
[2m[vector] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[vector] [m        include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[vector] [m        include template-haskell-2.22.0.0-af3f
[2m[vector] [m        include transformers-0.6.1.1-74e0
[2m[vector] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [mReady component graph:
[2m[vector] [m    definite vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m        depends base-4.20.2.0-acb8
[2m[vector] [m        depends deepseq-1.5.0.0-7e72
[2m[vector] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        depends vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
[2m[vector] [m    definite vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
[2m[vector] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[vector] [m        depends base-4.20.2.0-acb8
[2m[vector] [m        depends base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
[2m[vector] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[vector] [m        depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[vector] [m        depends template-haskell-2.22.0.0-af3f
[2m[vector] [m        depends transformers-0.6.1.1-74e0
[2m[vector] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    definite vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
[2m[vector] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[vector] [m        depends base-4.20.2.0-acb8
[2m[vector] [m        depends base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
[2m[vector] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[vector] [m        depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[vector] [m        depends template-haskell-2.22.0.0-af3f
[2m[vector] [m        depends transformers-0.6.1.1-74e0
[2m[vector] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    definite vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
[2m[vector] [m        depends base-4.20.2.0-acb8
[2m[vector] [m        depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[vector] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    definite vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
[2m[vector] [m        depends base-4.20.2.0-acb8
[2m[vector] [m        depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[vector] [m        depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [m    definite vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
[2m[vector] [m        depends base-4.20.2.0-acb8
[2m[vector] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[vector] [m        depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[vector] [m        depends tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
[2m[vector] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[vector] [mUsing compiler: ghc-9.10.3
[2m[vector] [mUsing install prefix:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
[2m[vector] [mExecutables installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/bin
[2m[vector] [mLibraries installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [mDynamic Libraries installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[vector] [mPrivate executables installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
[2m[vector] [mData files installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
[2m[vector] [mDocumentation installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
[2m[vector] [mConfiguration files installed in:
[2m[vector] [m/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/etc
[2m[vector] [mNo alex found
[2m[vector] [mUsing ar found on system at:
[2m[vector] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[vector] [mNo c2hs found
[2m[vector] [mNo cpphs found
[2m[vector] [mUsing doctest version 0.24.2 found on system at:
[2m[vector] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
[2m[vector] [mUsing gcc version 14.3.0 given by user at:
[2m[vector] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[vector] [mUsing ghc version 9.10.3 found on system at:
[2m[vector] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[vector] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[vector] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[vector] [mNo ghcjs found
[2m[vector] [mNo ghcjs-pkg found
[2m[vector] [mNo greencard found
[2m[vector] [mUsing haddock version 2.31.1 found on system at:
[2m[vector] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[vector] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[vector] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[vector] [mUsing hscolour version 1.25 found on system at:
[2m[vector] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[vector] [mNo jhc found
[2m[vector] [mUsing ld found on system at:
[2m[vector] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[vector] [mNo pkg-config found
[2m[vector] [mUsing runghc version 9.10.3 found on system at:
[2m[vector] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[vector] [mUsing strip version 2.44 found on system at:
[2m[vector] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[vector] [mUsing tar found on system at:
[2m[vector] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[vector] [mNo uhc found
[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 || >=4.22.0 && <4.23: using base-4.20.2.0
[2m[duoids] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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 || >=4.22.0 && <4.23: using base-4.20.2.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.24.2
[2m[duoids] [mDependency duoids: using duoids-0.0.1.0
[2m[duoids] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m        include base-4.20.2.0-acb8
[2m[duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids] [m    component duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
[2m[duoids] [m        include base-4.20.2.0-acb8
[2m[duoids] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoids] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids] [mLinked component graph:
[2m[duoids] [m    unit duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m        include base-4.20.2.0-acb8
[2m[duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids] [m        Control.Duoidal=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Data.Duoid.Laws
[2m[duoids] [m    unit duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
[2m[duoids] [m        include base-4.20.2.0-acb8
[2m[duoids] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoids] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids] [mReady component graph:
[2m[duoids] [m    definite duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m        depends base-4.20.2.0-acb8
[2m[duoids] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids] [m    definite duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
[2m[duoids] [m        depends base-4.20.2.0-acb8
[2m[duoids] [m        depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoids] [m        depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[duoids] [mUsing compiler: ghc-9.10.3
[2m[duoids] [mUsing install prefix:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
[2m[duoids] [mExecutables installed in:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/bin
[2m[duoids] [mLibraries installed in:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [mDynamic Libraries installed in:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[duoids] [mPrivate executables installed in:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0
[2m[duoids] [mData files installed in:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0
[2m[duoids] [mDocumentation installed in:
[2m[duoids] [m/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
[2m[duoids] [mConfiguration files installed in:
[2m[duoids] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/etc
[2m[duoids] [mNo alex found
[2m[duoids] [mUsing ar found on system at:
[2m[duoids] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
[2m[duoids] [mNo c2hs found
[2m[duoids] [mNo cpphs found
[2m[duoids] [mUsing doctest version 0.24.2 found on system at:
[2m[duoids] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
[2m[duoids] [mUsing gcc version 14.3.0 given by user at:
[2m[duoids] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[duoids] [mUsing ghc version 9.10.3 found on system at:
[2m[duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[duoids] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[duoids] [mNo ghcjs found
[2m[duoids] [mNo ghcjs-pkg found
[2m[duoids] [mNo greencard found
[2m[duoids] [mUsing haddock version 2.31.1 found on system at:
[2m[duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[duoids] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[duoids] [mUsing hscolour version 1.25 found on system at:
[2m[duoids] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[duoids] [mNo jhc found
[2m[duoids] [mUsing ld found on system at:
[2m[duoids] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[duoids] [mNo pkg-config found
[2m[duoids] [mUsing runghc version 9.10.3 found on system at:
[2m[duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[duoids] [mUsing strip version 2.44 found on system at:
[2m[duoids] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[duoids] [mUsing tar found on system at:
[2m[duoids] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[duoids] [mNo uhc found
[2m[vector] [m[1;36mPhase: buildPhase[m
[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] [mPreprocessing library for vector-0.13.2.0...
[2m[vector] [mBuilding library for vector-0.13.2.0...
[2m[duoids] [m[1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.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[duoids] [m[2 of 6] Compiling Data.Duoid       ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.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 6] Compiling Control.Duoidal  ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
[2m[duoids] [m[4 of 6] 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[5 of 6] 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[6 of 6] 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 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
[2m[duoids] [m[2 of 6] Compiling Data.Duoid       ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
[2m[duoids] [m[3 of 6] 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 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
[2m[duoids] [m[5 of 6] Compiling Data.Duoid.Laws  ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
[2m[duoids] [m[6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.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.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] [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[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] [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[duoids] [mbuildPhase completed in 50 seconds
[2m[duoids] [m[1;36mPhase: checkPhase[m
[2m[duoids] [mRunning 1 test suites...
[2m[duoids] [mTest suite doctests: RUNNING...
[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] [mExamples: 5  Tried: 5  Errors: 0  Failures: 0
[2m[duoids] [mNameLib Nothing
[2m[duoids] [m----------------------------------------
[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 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
[2m[duoids] [m[2 of 6] Compiling Data.Duoid       ( src/Data/Duoid.hs, nothing )
[2m[duoids] [m[3 of 6] Compiling Control.Duoidal  ( src/Control/Duoidal.hs, nothing )
[2m[duoids] [m[4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
[2m[duoids] [m[5 of 6] Compiling Data.Duoid.Laws  ( src/Data/Duoid/Laws.hs, nothing )
[2m[duoids] [m[6 of 6] 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: 'Applicative' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Alternative' 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:62:5
[2m[duoids] [m    * at src/Data/Duoid.hs:58: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:58:1
[2m[duoids] [mWarning: 'Seq' is ambiguous. It is defined
[2m[duoids] [m    * at src/Data/Duoid.hs:118:5
[2m[duoids] [m    * at src/Data/Duoid.hs:114: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:114: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:238:5
[2m[duoids] [m    * at src/Control/Duoidal.hs:234: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:234:1
[2m[duoids] [mWarning: 'Sequential' is ambiguous. It is defined
[2m[duoids] [m    * at src/Control/Duoidal.hs:308:5
[2m[duoids] [m    * at src/Control/Duoidal.hs:304: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:304: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:774:5
[2m[duoids] [m    * at src/Control/Duoidal.hs:770: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:770: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: 'Const' is ambiguous. It is defined
[2m[duoids] [m    * in ‘GHC.Internal.Data.Functor.Const’
[2m[duoids] [m    * in ‘GHC.Internal.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 ‘GHC.Internal.Data.Functor.Const’
[2m[duoids] [mWarning: 'Normal' is ambiguous. It is defined
[2m[duoids] [m    * at src/Control/Duoidal.hs:395:1
[2m[duoids] [m    * at src/Data/Duoid.hs:183: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:183:1
[2m[duoids] [m 100% ( 60 / 60) in 'Control.Duoidal'
[2m[duoids] [m 100% (  2 /  2) in 'Control.Duoidal.Either'
[2m[duoids] [mWarning: 'Normal' is out of scope.
[2m[duoids] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoids] [mWarning: 'Law' is ambiguous. It is defined
[2m[duoids] [m    * at src/Data/Duoid/Laws.hs:38:5
[2m[duoids] [m    * at src/Data/Duoid/Laws.hs:34: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/Laws.hs:34:1
[2m[duoids] [m 100% ( 12 / 12) in 'Data.Duoid.Laws'
[2m[duoids] [m 100% (  6 /  6) in 'Control.Duoidal.Laws'
[2m[duoids] [mWarning: Data.Duoid: could not find link destinations for: 
[2m[duoids] [m	- Data.Duoid.Rep_Comm
[2m[duoids] [m	- Data.Duoid.Rep1_Comm
[2m[duoids] [m	- Data.Duoid.Rep_Seq
[2m[duoids] [m	- Data.Duoid.Rep1_Seq
[2m[duoids] [m	- Data.Duoid.Rep_Par
[2m[duoids] [m	- Data.Duoid.Rep1_Par
[2m[duoids] [mWarning: Control.Duoidal: could not find link destinations for: 
[2m[duoids] [m	- Control.Duoidal.Rep_Commutative
[2m[duoids] [m	- Control.Duoidal.Rep1_Commutative
[2m[duoids] [m	- Control.Duoidal.Rep_Sequential
[2m[duoids] [m	- Control.Duoidal.Rep1_Sequential
[2m[duoids] [m	- Control.Duoidal.Rep_Parallel
[2m[duoids] [m	- Control.Duoidal.Rep1_Parallel
[2m[duoids] [mWarning: Data.Duoid.Laws: could not find link destinations for: 
[2m[duoids] [m	- Data.Duoid.Laws.Rep_NormalLaws
[2m[duoids] [m	- Data.Duoid.Laws.Rep1_NormalLaws
[2m[duoids] [m	- Data.Duoid.Laws.Rep_Laws
[2m[duoids] [m	- Data.Duoid.Laws.Rep_Law
[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[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[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[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] [mhaddockPhase completed in 33 seconds
[2m[duoids] [m[1;36mPhase: installPhase[m
[2m[duoids] [mInstalling library in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids] [m[1;36mPhase: fixupPhase[m
[2m[duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
[2m[duoids] [mshrinking /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c-ghc9.10.3.so
[2m[duoids] [mchecking for references to /build/ in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0...
[2m[duoids] [mpatching script interpreter paths in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
[2m[duoids] [mstripping (with command strip and flags -S -p) in  /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib
[2m[duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
[2m[duoids] [mchecking for references to /build/ in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc...
[2m[duoids] [mpatching script interpreter paths in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 2 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 6 of 22 built (1 building), 193 of 193 downloaded from cache[m
[1;34mBuilding duoidal-transformers[m
[1;34mBuilding duoids-hedgehog[m
[2m[duoidal-transformers] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[duoidal-transformers] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[duoids-hedgehog] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[duoids-hedgehog] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[duoidal-transformers] [m[1;36mPhase: unpackPhase[m
[2m[duoidal-transformers] [munpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-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.O0CHFuErI3/setup-package.conf.d -threaded
[2m[duoidal-transformers] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.O0CHFuErI3/Main.o )
[2m[duoids-hedgehog] [m[1;36mPhase: unpackPhase[m
[2m[duoids-hedgehog] [munpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-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.88RLIBMGhZ/setup-package.conf.d -threaded
[2m[duoidal-transformers] [m[2 of 2] Linking Setup
[2m[duoids-hedgehog] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.88RLIBMGhZ/Main.o )
[2m[duoids-hedgehog] [m[2 of 2] Linking Setup
[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] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[duoidal-transformers] [m[1;36mPhase: configurePhase[m
[2m[duoidal-transformers] [mconfigureFlags: --verbose --prefix=/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.O0CHFuErI3/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
[2m[duoidal-transformers] [mUsing Parsec parser
[2m[duoidal-transformers] [mConfiguring duoidal-transformers-0.0.1.0...
[2m[duoids-hedgehog] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[duoids-hedgehog] [m[1;36mPhase: configurePhase[m
[2m[duoids-hedgehog] [mconfigureFlags: --verbose --prefix=/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.88RLIBMGhZ/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
[2m[duoids-hedgehog] [mUsing Parsec parser
[2m[duoids-hedgehog] [mConfiguring duoids-hedgehog-0.0.1.0...
[2m[duoidal-transformers] [mFlags chosen: lint=False, noisy-deprecations=True
[2m[duoids-hedgehog] [mFlags chosen: lint=False, noisy-deprecations=True
[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 || >=4.22.0 && <4.23: using base-4.20.2.0
[2m[duoidal-transformers] [mDependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
[2m[duoidal-transformers] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[2m[duoidal-transformers] [mDependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.1
[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 || >=4.22.0 && <4.23: using base-4.20.2.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.24.2
[2m[duoidal-transformers] [mDependency duoidal-transformers: using duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m        include base-4.20.2.0-acb8
[2m[duoidal-transformers] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoidal-transformers] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoidal-transformers] [m        include transformers-0.6.1.1-74e0
[2m[duoidal-transformers] [m    component duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
[2m[duoidal-transformers] [m        include base-4.20.2.0-acb8
[2m[duoidal-transformers] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoidal-transformers] [m        include duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoidal-transformers] [mLinked component graph:
[2m[duoidal-transformers] [m    unit duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m        include base-4.20.2.0-acb8
[2m[duoidal-transformers] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoidal-transformers] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoidal-transformers] [m        include transformers-0.6.1.1-74e0
[2m[duoidal-transformers] [m        Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C:Control.Duoidal.Trans.Orphans
[2m[duoidal-transformers] [m    unit duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
[2m[duoidal-transformers] [m        include base-4.20.2.0-acb8
[2m[duoidal-transformers] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoidal-transformers] [m        include duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoidal-transformers] [mReady component graph:
[2m[duoidal-transformers] [m    definite duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m        depends base-4.20.2.0-acb8
[2m[duoidal-transformers] [m        depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoidal-transformers] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoidal-transformers] [m        depends transformers-0.6.1.1-74e0
[2m[duoidal-transformers] [m    definite duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
[2m[duoidal-transformers] [m        depends base-4.20.2.0-acb8
[2m[duoidal-transformers] [m        depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoidal-transformers] [m        depends duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoidal-transformers] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[duoidal-transformers] [mUsing compiler: ghc-9.10.3
[2m[duoidal-transformers] [mUsing install prefix:
[2m[duoidal-transformers] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mExecutables installed in:
[2m[duoidal-transformers] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/bin
[2m[duoidal-transformers] [mLibraries installed in:
[2m[duoidal-transformers] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [mDynamic Libraries installed in:
[2m[duoidal-transformers] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[duoidal-transformers] [mPrivate executables installed in:
[2m[duoidal-transformers] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mData files installed in:
[2m[duoidal-transformers] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mDocumentation installed in:
[2m[duoidal-transformers] [m/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-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/wp33qs6b2wdxj74yi76hwclbcawz2q2v-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/rinxh4y0akcin90l05j0zr1r3wahl34d-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.24.2 found on system at:
[2m[duoidal-transformers] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
[2m[duoidal-transformers] [mUsing gcc version 14.3.0 given by user at:
[2m[duoidal-transformers] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[duoidal-transformers] [mUsing ghc version 9.10.3 found on system at:
[2m[duoidal-transformers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[duoidal-transformers] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[duoidal-transformers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[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.31.1 found on system at:
[2m[duoidal-transformers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[duoidal-transformers] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[duoidal-transformers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[duoidal-transformers] [mUsing hscolour version 1.25 found on system at:
[2m[duoidal-transformers] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[duoidal-transformers] [mNo pkg-config found
[2m[duoidal-transformers] [mUsing runghc version 9.10.3 found on system at:
[2m[duoidal-transformers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[duoidal-transformers] [mUsing strip version 2.44 found on system at:
[2m[duoidal-transformers] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[duoidal-transformers] [mUsing tar found on system at:
[2m[duoidal-transformers] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-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[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 || >=4.22.0 && <4.23: using base-4.20.2.0
[2m[duoids-hedgehog] [mDependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
[2m[duoids-hedgehog] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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 || >=4.22.0 && <4.23: using base-4.20.2.0
[2m[duoids-hedgehog] [mDependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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 || >=4.22.0 && <4.23: using base-4.20.2.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.24.2
[2m[duoids-hedgehog] [mDependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        include base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids-hedgehog] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[duoids-hedgehog] [m    component duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
[2m[duoids-hedgehog] [m        include base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m    component duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
[2m[duoids-hedgehog] [m        include base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[duoids-hedgehog] [mLinked component graph:
[2m[duoids-hedgehog] [m    unit duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        include base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids-hedgehog] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[duoids-hedgehog] [m        Test.Duoid=duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW:Test.Duoidal
[2m[duoids-hedgehog] [m    unit duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
[2m[duoids-hedgehog] [m        include base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m    unit duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
[2m[duoids-hedgehog] [m        include base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[duoids-hedgehog] [mReady component graph:
[2m[duoids-hedgehog] [m    definite duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        depends base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[duoids-hedgehog] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m        depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[duoids-hedgehog] [m    definite duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
[2m[duoids-hedgehog] [m        depends base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [m        depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[duoids-hedgehog] [m    definite duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
[2m[duoids-hedgehog] [m        depends base-4.20.2.0-acb8
[2m[duoids-hedgehog] [m        depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[duoids-hedgehog] [m        depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[duoids-hedgehog] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[duoids-hedgehog] [mUsing compiler: ghc-9.10.3
[2m[duoids-hedgehog] [mUsing install prefix:
[2m[duoids-hedgehog] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mExecutables installed in:
[2m[duoids-hedgehog] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/bin
[2m[duoids-hedgehog] [mLibraries installed in:
[2m[duoids-hedgehog] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [mDynamic Libraries installed in:
[2m[duoids-hedgehog] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[duoids-hedgehog] [mPrivate executables installed in:
[2m[duoids-hedgehog] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mData files installed in:
[2m[duoids-hedgehog] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mDocumentation installed in:
[2m[duoids-hedgehog] [m/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-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/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-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/rinxh4y0akcin90l05j0zr1r3wahl34d-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.24.2 found on system at:
[2m[duoids-hedgehog] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
[2m[duoids-hedgehog] [mUsing gcc version 14.3.0 given by user at:
[2m[duoids-hedgehog] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[duoids-hedgehog] [mUsing ghc version 9.10.3 found on system at:
[2m[duoids-hedgehog] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[duoids-hedgehog] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[duoids-hedgehog] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[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.31.1 found on system at:
[2m[duoids-hedgehog] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[duoids-hedgehog] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[duoids-hedgehog] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[duoids-hedgehog] [mUsing hscolour version 1.25 found on system at:
[2m[duoids-hedgehog] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[duoids-hedgehog] [mNo pkg-config found
[2m[duoids-hedgehog] [mUsing runghc version 9.10.3 found on system at:
[2m[duoids-hedgehog] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[duoids-hedgehog] [mUsing strip version 2.44 found on system at:
[2m[duoids-hedgehog] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[duoids-hedgehog] [mUsing tar found on system at:
[2m[duoids-hedgehog] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[duoids-hedgehog] [mNo uhc found
[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[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[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[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[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[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[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[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[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[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[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[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[duoids-hedgehog] [m[2 of 2] Linking dist/build/laws/laws
[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[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[duoids-hedgehog] [m[2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
[2m[duoids-hedgehog] [m[3 of 3] Linking dist/build/doctests/doctests
[2m[duoidal-transformers] [m[1;36mPhase: checkPhase[m
[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[duoidal-transformers] [mRunning 1 test suites...
[2m[duoidal-transformers] [mTest suite doctests: RUNNING...
[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] [m
[2m[duoidal-transformers] [mExamples: 0  Tried: 0  Errors: 0  Failures: 0
[2m[duoidal-transformers] [mNameLib Nothing
[2m[duoidal-transformers] [m----------------------------------------
[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[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[duoidal-transformers] [m[1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
[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[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] [mWarning: 'MonadTrans' is out of scope.
[2m[duoidal-transformers] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[duoidal-transformers] [m 100% (  3 /  3) in 'Control.Duoidal.Trans.Class'
[2m[duoidal-transformers] [m 100% (  1 /  1) in 'Control.Duoidal.Trans.Orphans'
[2m[duoids-hedgehog] [mbuildPhase completed in 32 seconds
[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] [mNameLib Nothing
[2m[duoids-hedgehog] [m----------------------------------------
[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 100% (  3 /  3) in 'Test.Duoid'
[2m[duoids-hedgehog] [m 100% (  2 /  2) in 'Test.Duoidal'
[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 )
[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[10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
[2m[duoidal-transformers] [mInstalling library in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
[2m[duoidal-transformers] [m[1;36mPhase: fixupPhase[m
[2m[duoidal-transformers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mshrinking /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C-ghc9.10.3.so
[2m[duoidal-transformers] [mchecking for references to /build/ in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0...
[2m[duoidal-transformers] [mpatching script interpreter paths in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
[2m[duoidal-transformers] [mstripping (with command strip and flags -S -p) in  /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib
[2m[duoidal-transformers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc
[2m[duoidal-transformers] [mchecking for references to /build/ in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc...
[2m[duoidal-transformers] [mpatching script interpreter paths in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 2 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 7 of 21 built (2 building), 193 of 193 downloaded from cache[m
[2m[vector] [m[11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_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[duoids-hedgehog] [mhaddockPhase completed in 33 seconds
[2m[duoids-hedgehog] [m[1;36mPhase: installPhase[m
[2m[duoids-hedgehog] [mInstalling library in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[duoids-hedgehog] [m[1;36mPhase: fixupPhase[m
[2m[duoids-hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mshrinking /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW-ghc9.10.3.so
[2m[duoids-hedgehog] [mchecking for references to /build/ in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0...
[2m[duoids-hedgehog] [mpatching script interpreter paths in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
[2m[duoids-hedgehog] [mstripping (with command strip and flags -S -p) in  /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib
[2m[duoids-hedgehog] [mshrinking RPATHs of ELF executables and libraries in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
[2m[duoids-hedgehog] [mchecking for references to /build/ in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc...
[2m[duoids-hedgehog] [mpatching script interpreter paths in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 2 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 8 of 20 built (1 building), 193 of 193 downloaded from cache[m
[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 )
[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-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[;1mtests/Utilities.hs:244:17: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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[;1mtests/Tests/Vector/Property.hs:243:68: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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
[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 )
[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[;1mtests/Tests/Bundle.hs:16:29: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-38856\GHC-38856]8;;\] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    The import of ‘foldl'’ from module ‘Data.List’ is redundant[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m
[2m[vector] [m[;1m[34m16 |[0m[0m import Data.List           ([;1m[35mfoldl'[0m[0m, foldl1', unfoldr, find, findIndex)
[2m[vector] [m[;1m[34m   |[0m[0m[;1m[35m                             ^^^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:76:77: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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[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[;1mtests/Utilities.hs:244:17: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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[;1mtests/Tests/Vector/Property.hs:243:68: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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
[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[;1mtests/Tests/Bundle.hs:16:29: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-38856\GHC-38856]8;;\] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[vector] [m    The import of ‘foldl'’ from module ‘Data.List’ is redundant[0m[0m
[2m[vector] [m[;1m[34m   |[0m[0m
[2m[vector] [m[;1m[34m16 |[0m[0m import Data.List           ([;1m[35mfoldl'[0m[0m, foldl1', unfoldr, find, findIndex)
[2m[vector] [m[;1m[34m   |[0m[0m[;1m[35m                             ^^^^^^[0m[0m
[2m[vector] [m
[2m[vector] [m[;1mtests/Tests/Bundle.hs:76:77: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[vector] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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-doctest' for vector-0.13.2.0...
[2m[vector] [mBuilding test suite 'vector-doctest' for vector-0.13.2.0...
[2m[vector] [m[1 of 1] Compiling Main             ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
[2m[vector] [m[2 of 2] Linking dist/build/vector-doctest/vector-doctest
[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[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[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[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[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[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[vector] [m[1 of 4] Compiling Inspect          ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
[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[vector] [m[4 of 4] Compiling Main             ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
[2m[vector] [m[5 of 5] Linking dist/build/vector-inspection/vector-inspection
[2m[vector] [mbuildPhase completed in 4 minutes 56 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
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    empty:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[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
[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    index:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests; 14 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; 14 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    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; 19 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; 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; 22 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; 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; 14 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; 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; 22 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 100 tests.
[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 (0.03s)
[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.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 (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; 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; 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; 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.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; 21 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 25 discarded.
[2m[vector] [m      mut_modify:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 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; 17 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; 16 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; 24 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; 14 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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.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 100 tests.
[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; 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; 14 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; 14 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; 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; 12 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 100 tests.
[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.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.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
[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; 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; 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; 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
[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; 15 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; 13 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; 10 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; 14 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 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; 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; 11 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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.02s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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      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 100 tests.
[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      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; 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; 17 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; 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; 16 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 100 tests.
[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
[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.03s)
[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.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.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; 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; 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; 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; 21 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; 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 (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; 12 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; 14 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; 17 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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; 14 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; 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; 15 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; 16 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 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; 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 100 tests.
[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 (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.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.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 (0.02s)
[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.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.06s)
[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.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 (0.01s)
[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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 24 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; 17 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; 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; 17 discarded.
[2m[vector] [m      ifoldl:                                                              OK (0.01s)
[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
[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.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 (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.03s)
[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.03s)
[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.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      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 (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.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               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      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; 19 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; 15 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.02s)
[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
[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
[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.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.01s)
[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; 15 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; 20 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; 11 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; 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; 15 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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; 5 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; 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; 18 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; 15 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; 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; 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 100 tests.
[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.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.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 (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
[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; 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; 20 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; 16 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.02s)
[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.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; 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; 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; 20 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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      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; 17 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 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; 16 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; 11 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 100 tests.
[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.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.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
[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.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 (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.06s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      zipWithM:                                                            OK (0.02s)
[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 (0.01s)
[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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      imapMaybe:                                                           OK (0.02s)
[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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      partitionWith:                                                       OK (0.01s)
[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.02s)
[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 (0.01s)
[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
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1:                                                              OK (0.01s)
[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; 13 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.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.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 (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 (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.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 (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.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 (0.01s)
[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.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.01s)
[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; 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.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.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.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.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_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.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_ifoldM:                                                          OK (0.01s)
[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; 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; 19 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; 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; 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; 10 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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; 5 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; 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; 17 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; 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; 11 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 100 tests.
[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 (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
[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.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.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; 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; 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; 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 (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; 19 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; 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 (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; 13 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; 17 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; 16 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; 12 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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 100 tests.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.02s)
[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; 16 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; 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; 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 100 tests.
[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.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.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.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; 20 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; 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.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; 15 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.01s)
[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; 20 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; 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; 22 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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 100 tests.
[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; 16 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; 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; 18 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; 18 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; 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; 12 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 100 tests.
[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.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
[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 (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
[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; 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; 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; 12 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
[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 (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; 24 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; 17 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; 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; 17 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; 15 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 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; 17 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 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; 15 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; 25 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 100 tests.
[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.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
[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.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
[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; 21 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; 23 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; 25 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; 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
[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; 15 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; 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; 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; 16 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; 12 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 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; 12 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; 10 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; 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 100 tests.
[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 (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.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.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; 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; 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; 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; 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.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; 14 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
[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; 13 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; 13 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; 18 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; 12 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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    (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; 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; 15 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; 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; 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; 16 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 100 tests.
[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.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.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.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[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.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.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; 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; 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; 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      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
[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.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; 16 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 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 (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
[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; 11 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; 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; 16 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 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; 19 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; 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; 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; 14 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 100 tests.
[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.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.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
[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 (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.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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 13 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; 14 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; 17 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; 15 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
[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[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 (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 (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.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 (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.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.01s)
[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.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; 17 discarded.
[2m[vector] [m      mut_write:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 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.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.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
[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.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_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.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.01s)
[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_ifoldM':                                                         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      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; 16 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; 18 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; 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; 15 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; 15 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 1 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; 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; 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; 14 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; 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; 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 100 tests.
[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.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
[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.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.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.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; 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; 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      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.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
[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; 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; 15 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.03s)
[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.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; 22 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; 26 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 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; 16 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; 12 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 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; 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; 12 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; 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; 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 100 tests.
[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.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.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.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.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 (0.01s)
[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.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.06s)
[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.05s)
[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.07s)
[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; 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; 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; 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 (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
[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
[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; 20 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; 12 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.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
[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; 12 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; 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; 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; 12 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; 24 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 14 discarded.
[2m[vector] [m  Data.Vector.Primitive.Mutable (Move):                                    OK
[2m[vector] [m    +++ OK, passed 100 tests; 18 discarded.
[2m[vector] [m  Data.Vector.Unboxed.Mutable (Move):                                      OK
[2m[vector] [m    +++ OK, passed 100 tests; 15 discarded.
[2m[vector] [m  Data.Vector.Storable.Mutable (Move):                                     OK
[2m[vector] [m    +++ OK, passed 100 tests; 14 discarded.
[2m[vector] [m  Data.Vector.Generic.Mutable (nextPermutation):                           OK
[2m[vector] [m    +++ OK, passed 100 tests.
[2m[vector] [m  Data.Vector.Generic.Mutable (prevPermutation):                           OK
[2m[vector] [m    +++ OK, passed 100 tests.
[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 (15.02s)
[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
[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
[2m[vector] [m      +++ OK, passed 100 tests.
[2m[vector] [m    empty:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests.
[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
[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; 14 discarded.
[2m[vector] [m    index:                                                                 OK
[2m[vector] [m      +++ OK, passed 100 tests; 15 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; 14 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    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; 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; 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; 13 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; 14 discarded.
[2m[vector] [m    scanl1':                                                               OK
[2m[vector] [m      +++ OK, passed 100 tests; 18 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; 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; 11 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; 16 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; 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 100 tests.
[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
[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
[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
[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; 19 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[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
[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; 15 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; 22 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; 13 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; 23 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; 19 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; 16 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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
[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 100 tests.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.02s)
[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; 12 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; 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; 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 100 tests.
[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.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 (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.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; 20 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; 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      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; 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 (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[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; 20 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; 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; 17 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; 18 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_empty:                                                   OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.02s)
[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; 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; 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; 15 discarded.
[2m[vector] [m      last:                                                                OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 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; 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; 19 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 100 tests.
[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 (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.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; 20 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; 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      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; 16 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 (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.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; 17 discarded.
[2m[vector] [m      minimum:                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 19 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; 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; 24 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; 24 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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      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    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; 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; 22 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 100 tests.
[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.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 (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[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mapMaybe:                                                            OK (0.01s)
[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 (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; 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; 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; 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.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 (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.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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[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.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 (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.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               OK (0.01s)
[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.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; 13 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; 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 (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
[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.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.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.01s)
[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_ifoldM':                                                         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      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; 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; 13 discarded.
[2m[vector] [m      maxIndex:                                                            OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 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; 14 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 discarded.
[2m[vector] [m      maxIndexBy:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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; 8 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; 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; 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; 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 100 tests.
[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
[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.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.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.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; 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      foldr':                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldr1':                                                             OK
[2m[vector] [m        +++ OK, passed 100 tests; 11 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; 20 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; 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 (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; 15 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; 15 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; 21 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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      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    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; 11 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; 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; 15 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 100 tests.
[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 (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
[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.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.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 (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.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 (0.01s)
[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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1':                                                             OK (0.01s)
[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; 11 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      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
[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.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.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 (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.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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanl1:                                                              OK
[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.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 (0.01s)
[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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr:                                                               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      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; 11 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; 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 (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.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_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 (0.01s)
[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.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; 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; 11 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; 17 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 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; 13 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
[2m[vector] [m        []
[2m[vector] [m      mempty:                                                              OK
[2m[vector] [m        +++ OK, passed 100 tests.
[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.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; 24 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; 14 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; 25 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; 14 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 100 tests.
[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 (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
[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; 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; 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; 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
[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; 17 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; 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
[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; 19 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; 15 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 20 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; 23 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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
[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 100 tests.
[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; 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; 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; 16 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; 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; 11 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 100 tests.
[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
[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
[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.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; 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; 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; 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.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; 18 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 (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.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; 24 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; 17 discarded.
[2m[vector] [m      maximumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 24 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; 17 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; 12 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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 100 tests.
[2m[vector] [m      alternative_or:                                                      OK
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      sequence:                                                            OK (0.02s)
[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; 10 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; 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; 13 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; 12 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; 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; 20 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 100 tests.
[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.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.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
[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.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; 11 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; 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; 20 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; 18 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; 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
[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; 13 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; 11 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; 14 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 16 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; 15 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; 15 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 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; 15 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; 17 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; 11 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; 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 100 tests.
[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
[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.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.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; 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; 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; 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
[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; 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; 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
[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 (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; 13 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; 11 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; 13 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 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; 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; 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; 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; 14 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 100 tests.
[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 (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
[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.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.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; 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; 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; 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; 11 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; 15 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
[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
[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; 18 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; 10 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; 19 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 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; 16 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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      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; 14 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; 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; 14 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; 19 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; 11 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; 25 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 100 tests.
[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
[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.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.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
[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; 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; 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 (0.01s)
[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; 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.05s)
[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
[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; 17 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; 16 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; 21 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; 18 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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      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; 4 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; 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; 17 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; 14 discarded.
[2m[vector] [m      unsafeHead:                                                          OK
[2m[vector] [m        +++ OK, passed 100 tests; 21 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; 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 100 tests.
[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.03s)
[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.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.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.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 (0.01s)
[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.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.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 (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.02s)
[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 (0.01s)
[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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      foldl1:                                                              OK (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests; 17 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; 14 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; 14 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; 15 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[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 (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 (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.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 (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.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.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      scanr1':                                                             OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr:                                                              OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      iscanr':                                                             OK (0.03s)
[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; 18 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.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 (0.01s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldr':                                                          OK (0.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_foldl:                                                           OK (0.03s)
[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.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_foldM:                                                           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_foldrM:                                                          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_ifoldM:                                                          OK (0.01s)
[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.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; 18 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; 14 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; 17 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; 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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    (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; 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; 15 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; 16 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; 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; 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 100 tests.
[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.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.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
[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.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.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; 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; 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      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.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
[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; 20 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 (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 (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      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; 15 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; 17 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 discarded.
[2m[vector] [m      maximumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 23 discarded.
[2m[vector] [m      minimumOn:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 22 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; 20 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 20 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; 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; 21 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; 12 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 100 tests.
[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.02s)
[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.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
[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.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.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.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; 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; 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; 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      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
[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; 19 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.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.03s)
[2m[vector] [m        +++ OK, passed 100 tests.
[2m[vector] [m      mut_forM_:                                                           OK (0.06s)
[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; 17 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; 15 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; 12 discarded.
[2m[vector] [m      minimumBy:                                                           OK
[2m[vector] [m        +++ OK, passed 100 tests; 12 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; 16 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; 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/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
[2m[vector] [m            errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
[2m[vector] [m            foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.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 100 tests.
[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; 17 discarded.
[2m[vector] [m  Data.Vector.Primitive.Mutable (Move):                                    OK
[2m[vector] [m    +++ OK, passed 100 tests; 22 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; 25 discarded.
[2m[vector] [m  Data.Vector.Generic.Mutable (nextPermutation):                           OK
[2m[vector] [m    +++ OK, passed 100 tests.
[2m[vector] [m  Data.Vector.Generic.Mutable (prevPermutation):                           OK (0.01s)
[2m[vector] [m    +++ OK, passed 100 tests.
[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 (12.01s)
[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] [m[1;36mPhase: haddockPhase[m
[2m[vector] [m[1;36mPhase: installPhase[m
[2m[vector] [mInstalling library in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[vector] [mInstalling internal library benchmarks-O2 in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
[2m[vector] [m[1;36mPhase: fixupPhase[m
[2m[vector] [mshrinking RPATHs of ELF executables and libraries in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
[2m[vector] [mshrinking /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSvector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg-ghc9.10.3.so
[2m[vector] [mshrinking /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSvector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2-ghc9.10.3.so
[2m[vector] [mchecking for references to /build/ in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0...
[2m[vector] [mpatching script interpreter paths in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
[2m[vector] [mstripping (with command strip and flags -S -p) in  /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 9 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding nothunks[m
[2m[nothunks] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[nothunks] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[nothunks] [m[1;36mPhase: unpackPhase[m
[2m[nothunks] [munpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
[2m[nothunks] [msource root is nothunks-0.3.1
[2m[nothunks] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
[2m[nothunks] [m[1;36mPhase: patchPhase[m
[2m[nothunks] [mReplace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/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.oDyaFIHlax/setup-package.conf.d -threaded
[2m[nothunks] [m[1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.oDyaFIHlax/Main.o )
[2m[nothunks] [m[2 of 2] Linking Setup
[2m[nothunks] [m[1;36mPhase: updateAutotoolsGnuConfigScriptsPhase[m
[2m[nothunks] [m[1;36mPhase: configurePhase[m
[2m[nothunks] [mconfigureFlags: --verbose --prefix=/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.oDyaFIHlax/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
[2m[nothunks] [mUsing Parsec parser
[2m[nothunks] [mConfiguring nothunks-0.3.1...
[2m[nothunks] [mFlags chosen: bytestring=True, text=True, vector=True
[2m[nothunks] [mDependency base: using base-4.20.2.0
[2m[nothunks] [mDependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
[2m[nothunks] [mDependency containers: using containers-0.7
[2m[nothunks] [mDependency ghc-heap: using ghc-heap-9.10.3
[2m[nothunks] [mDependency stm: using stm-2.5.3.1
[2m[nothunks] [mDependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.3
[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.3: using wherefrom-compat-0.1.1.1
[2m[nothunks] [mDependency base: using base-4.20.2.0
[2m[nothunks] [mDependency containers: using containers-0.7
[2m[nothunks] [mDependency ghc-prim: using ghc-prim-0.12.0
[2m[nothunks] [mDependency hedgehog: using hedgehog-1.5
[2m[nothunks] [mDependency nothunks: using nothunks-0.3.1
[2m[nothunks] [mDependency random: using random-1.2.1.3
[2m[nothunks] [mDependency stm: using stm-2.5.3.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.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m        include base-4.20.2.0-acb8
[2m[nothunks] [m        include bytestring-0.12.2.0-04d5
[2m[nothunks] [m        include containers-0.7-a3f6
[2m[nothunks] [m        include ghc-heap-9.10.3-30e2
[2m[nothunks] [m        include stm-2.5.3.1-62de
[2m[nothunks] [m        include text-2.1.3-e138
[2m[nothunks] [m        include time-1.12.2-befd
[2m[nothunks] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[nothunks] [m        include wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
[2m[nothunks] [m    component nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
[2m[nothunks] [m        include base-4.20.2.0-acb8
[2m[nothunks] [m        include containers-0.7-a3f6
[2m[nothunks] [m        include ghc-prim-0.12.0-f1e7
[2m[nothunks] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[nothunks] [m        include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[nothunks] [m        include stm-2.5.3.1-62de
[2m[nothunks] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[nothunks] [m        include tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
[2m[nothunks] [mLinked component graph:
[2m[nothunks] [m    unit nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m        include base-4.20.2.0-acb8
[2m[nothunks] [m        include bytestring-0.12.2.0-04d5
[2m[nothunks] [m        include containers-0.7-a3f6
[2m[nothunks] [m        include ghc-heap-9.10.3-30e2
[2m[nothunks] [m        include stm-2.5.3.1-62de
[2m[nothunks] [m        include text-2.1.3-e138
[2m[nothunks] [m        include time-1.12.2-befd
[2m[nothunks] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[nothunks] [m        include wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
[2m[nothunks] [m        NoThunks.Class=nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw:NoThunks.Class
[2m[nothunks] [m    unit nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
[2m[nothunks] [m        include base-4.20.2.0-acb8
[2m[nothunks] [m        include containers-0.7-a3f6
[2m[nothunks] [m        include ghc-prim-0.12.0-f1e7
[2m[nothunks] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[nothunks] [m        include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[nothunks] [m        include stm-2.5.3.1-62de
[2m[nothunks] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[nothunks] [m        include tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
[2m[nothunks] [mReady component graph:
[2m[nothunks] [m    definite nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m        depends base-4.20.2.0-acb8
[2m[nothunks] [m        depends bytestring-0.12.2.0-04d5
[2m[nothunks] [m        depends containers-0.7-a3f6
[2m[nothunks] [m        depends ghc-heap-9.10.3-30e2
[2m[nothunks] [m        depends stm-2.5.3.1-62de
[2m[nothunks] [m        depends text-2.1.3-e138
[2m[nothunks] [m        depends time-1.12.2-befd
[2m[nothunks] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[nothunks] [m        depends wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
[2m[nothunks] [m    definite nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
[2m[nothunks] [m        depends base-4.20.2.0-acb8
[2m[nothunks] [m        depends containers-0.7-a3f6
[2m[nothunks] [m        depends ghc-prim-0.12.0-f1e7
[2m[nothunks] [m        depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[nothunks] [m        depends nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m        depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[nothunks] [m        depends stm-2.5.3.1-62de
[2m[nothunks] [m        depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[nothunks] [m        depends tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
[2m[nothunks] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[nothunks] [mUsing compiler: ghc-9.10.3
[2m[nothunks] [mUsing install prefix:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
[2m[nothunks] [mExecutables installed in:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/bin
[2m[nothunks] [mLibraries installed in:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [mDynamic Libraries installed in:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[nothunks] [mPrivate executables installed in:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1
[2m[nothunks] [mData files installed in:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1
[2m[nothunks] [mDocumentation installed in:
[2m[nothunks] [m/nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
[2m[nothunks] [mConfiguration files installed in:
[2m[nothunks] [m/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/etc
[2m[nothunks] [mNo alex found
[2m[nothunks] [mUsing ar found on system at:
[2m[nothunks] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[nothunks] [mUsing ghc version 9.10.3 found on system at:
[2m[nothunks] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[nothunks] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[nothunks] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[nothunks] [mNo ghcjs found
[2m[nothunks] [mNo ghcjs-pkg found
[2m[nothunks] [mNo greencard found
[2m[nothunks] [mUsing haddock version 2.31.1 found on system at:
[2m[nothunks] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[nothunks] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[nothunks] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[nothunks] [mUsing hscolour version 1.25 found on system at:
[2m[nothunks] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[nothunks] [mNo jhc found
[2m[nothunks] [mUsing ld found on system at:
[2m[nothunks] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[nothunks] [mNo pkg-config found
[2m[nothunks] [mUsing runghc version 9.10.3 found on system at:
[2m[nothunks] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[nothunks] [mUsing strip version 2.44 found on system at:
[2m[nothunks] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[nothunks] [mUsing tar found on system at:
[2m[nothunks] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-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.1...
[2m[nothunks] [mBuilding library for nothunks-0.3.1...
[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[nothunks] [m[1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
[2m[nothunks] [mPreprocessing test suite 'nothunks-test' for nothunks-0.3.1...
[2m[nothunks] [mBuilding test suite 'nothunks-test' for nothunks-0.3.1...
[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[nothunks] [m[2 of 2] Compiling Main             ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
[2m[nothunks] [m[3 of 3] Linking dist/build/nothunks-test/nothunks-test
[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"] 50% ██████████··········
[2m[nothunks] [m            Nothing      50% █████████▉··········
[2m[nothunks] [m      IntInt:            OK (0.04s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","Tuple2"] 39% ███████▊············
[2m[nothunks] [m            Just ["Tuple2"]       50% ██████████··········
[2m[nothunks] [m            Nothing               10% ██··················
[2m[nothunks] [m      SumInt:            OK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Either"]       32% ██████▍·············
[2m[nothunks] [m            Just ["Int","Either"] 34% ██████▊·············
[2m[nothunks] [m            Nothing               34% ██████▋·············
[2m[nothunks] [m      ListInt:           OK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List"] 23% ████▌···············
[2m[nothunks] [m            Just ["List"]       43% ████████▋···········
[2m[nothunks] [m            Nothing             34% ██████▊·············
[2m[nothunks] [m      IntListInt:        OK (0.04s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List","Tuple2"]  6% █···················
[2m[nothunks] [m            Just ["Int","Tuple2"]        25% █████···············
[2m[nothunks] [m            Just ["List","Tuple2"]       11% ██▏·················
[2m[nothunks] [m            Just ["Tuple2"]              51% ██████████▏·········
[2m[nothunks] [m            Nothing                       7% █▍··················
[2m[nothunks] [m      SeqInt:              [91m✗[0m [91mEXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
[2m[nothunks] [m    after 10 tests and 2 shrinks.
[2m[nothunks] [m    shrink path: 10:cA[0m
[2m[nothunks] [m    Just ["Int","Seq"][m [0m20%[m [0m████[90m·[0m[91m[0m[90m···············[0m[m[0m
[2m[nothunks] [m    Nothing           [m [0m70%[m [0m██████████████[90m·[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 13621856459592471057 8508144162220375703) "10:cA" EXPECTED FAILURE[0m
[2m[nothunks] [m  
[2m[nothunks] [mOK (0.07s)
[2m[nothunks] [m          ✓ <interactive> passed 1 test.
[2m[nothunks] [m    Model
[2m[nothunks] [m      Int:               OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int"] 48% █████████▋··········
[2m[nothunks] [m            Nothing      52% ██████████▎·········
[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"]       50% ██████████··········
[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"] 33% ██████▌·············
[2m[nothunks] [m            Nothing               33% ██████▌·············
[2m[nothunks] [m      ListInt:           OK (0.03s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List"] 22% ████▍···············
[2m[nothunks] [m            Just ["List"]       45% ████████▉···········
[2m[nothunks] [m            Nothing             33% ██████▋·············
[2m[nothunks] [m      IntListInt:        OK (0.07s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","List","Tuple2"]  6% █···················
[2m[nothunks] [m            Just ["Int","Tuple2"]        24% ████▊···············
[2m[nothunks] [m            Just ["List","Tuple2"]       11% ██▎·················
[2m[nothunks] [m            Just ["Tuple2"]              50% █████████▉··········
[2m[nothunks] [m            Nothing                       9% █▊··················
[2m[nothunks] [m      SeqInt:            OK (0.12s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","Seq"] 47% █████████▍··········
[2m[nothunks] [m            Nothing            53% ██████████▌·········
[2m[nothunks] [m      AllowThunksIn:     OK (0.05s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["Int","field2","Record"] 25% █████···············
[2m[nothunks] [m            Just ["Record"]                48% █████████▋··········
[2m[nothunks] [m            Nothing                        26% █████▎··············
[2m[nothunks] [m      Fn:                OK (0.02s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["->"] 26% █████▎··············
[2m[nothunks] [m            Nothing     74% ██████████████▋·····
[2m[nothunks] [m      IO:                OK (0.04s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["IO"] 25% ████▉···············
[2m[nothunks] [m            Nothing     75% ███████████████·····
[2m[nothunks] [m      ThunkFreeFn:       OK (0.05s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["->"]       27% █████▍··············
[2m[nothunks] [m            Just ["...","->"] 35% ██████▉·············
[2m[nothunks] [m            Nothing           38% ███████▌············
[2m[nothunks] [m      ThunkFreeIO:       OK (0.05s)
[2m[nothunks] [m          ✓ <interactive> passed 1000 tests.
[2m[nothunks] [m            Just ["...","IO"] 40% ███████▉············
[2m[nothunks] [m            Just ["IO"]       24% ████▊···············
[2m[nothunks] [m            Nothing           36% ███████▏············
[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.77s)
[2m[nothunks] [mTest suite nothunks-test: PASS
[2m[nothunks] [mTest suite logged to: dist/test/nothunks-0.3.1-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.1...
[2m[nothunks] [mRunning Haddock on library for nothunks-0.3.1...
[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] [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[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[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.1...
[2m[nothunks] [m[1;36mPhase: installPhase[m
[2m[nothunks] [mInstalling library in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[nothunks] [m[1;36mPhase: fixupPhase[m
[2m[nothunks] [mshrinking RPATHs of ELF executables and libraries in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
[2m[nothunks] [mshrinking /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSnothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw-ghc9.10.3.so
[2m[nothunks] [mchecking for references to /build/ in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1...
[2m[nothunks] [mpatching script interpreter paths in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
[2m[nothunks] [mstripping (with command strip and flags -S -p) in  /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib
[2m[nothunks] [mshrinking RPATHs of ELF executables and libraries in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
[2m[nothunks] [mchecking for references to /build/ in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc...
[2m[nothunks] [mpatching script interpreter paths in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 10 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding unordered-containers[m
[2m[unordered-containers] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[unordered-containers] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[unordered-containers] [m[1;36mPhase: unpackPhase[m
[2m[unordered-containers] [munpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
[2m[unordered-containers] [msource root is unordered-containers-0.2.20.1
[2m[unordered-containers] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
[2m[unordered-containers] [m[1;36mPhase: patchPhase[m
[2m[unordered-containers] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[unordered-containers] [msetupCompileFlags: -package-db=/build/tmp.sdS8mtmeoG/setup-package.conf.d -threaded
[2m[unordered-containers] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.sdS8mtmeoG/Main.o )
[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/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.sdS8mtmeoG/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
[2m[unordered-containers] [mUsing Parsec parser
[2m[unordered-containers] [mConfiguring unordered-containers-0.2.20.1...
[2m[unordered-containers] [mFlags chosen: debug=False
[2m[unordered-containers] [mDependency base >=4.10 && <5: using base-4.20.2.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.5.0.0
[2m[unordered-containers] [mDependency template-haskell <2.24: using template-haskell-2.22.0.0
[2m[unordered-containers] [mDependency ChasingBottoms: using ChasingBottoms-1.3.1.17
[2m[unordered-containers] [mDependency HUnit: using HUnit-1.6.2.0
[2m[unordered-containers] [mDependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
[2m[unordered-containers] [mDependency base: using base-4.20.2.0
[2m[unordered-containers] [mDependency containers >=0.5.8: using containers-0.7
[2m[unordered-containers] [mDependency hashable: using hashable-1.5.0.0
[2m[unordered-containers] [mDependency nothunks >=0.1.3: using nothunks-0.3.1
[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.1
[2m[unordered-containers] [mDependency unordered-containers: using unordered-containers-0.2.20.1
[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.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [m        include base-4.20.2.0-acb8
[2m[unordered-containers] [m        include deepseq-1.5.0.0-7e72
[2m[unordered-containers] [m        include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[unordered-containers] [m        include template-haskell-2.22.0.0-af3f
[2m[unordered-containers] [m    component unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
[2m[unordered-containers] [m        include ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
[2m[unordered-containers] [m        include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
[2m[unordered-containers] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[unordered-containers] [m        include base-4.20.2.0-acb8
[2m[unordered-containers] [m        include containers-0.7-a3f6
[2m[unordered-containers] [m        include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[unordered-containers] [m        include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[unordered-containers] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[unordered-containers] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[unordered-containers] [m        include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[unordered-containers] [m        include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[unordered-containers] [m        include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [mLinked component graph:
[2m[unordered-containers] [m    unit unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [m        include base-4.20.2.0-acb8
[2m[unordered-containers] [m        include deepseq-1.5.0.0-7e72
[2m[unordered-containers] [m        include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[unordered-containers] [m        include template-haskell-2.22.0.0-af3f
[2m[unordered-containers] [m        Data.HashMap.Internal=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashSet.Internal
[2m[unordered-containers] [m    unit unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
[2m[unordered-containers] [m        include ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
[2m[unordered-containers] [m        include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
[2m[unordered-containers] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[unordered-containers] [m        include base-4.20.2.0-acb8
[2m[unordered-containers] [m        include containers-0.7-a3f6
[2m[unordered-containers] [m        include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[unordered-containers] [m        include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[unordered-containers] [m        include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[unordered-containers] [m        include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[unordered-containers] [m        include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[unordered-containers] [m        include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[unordered-containers] [m        include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [mReady component graph:
[2m[unordered-containers] [m    definite unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [m        depends base-4.20.2.0-acb8
[2m[unordered-containers] [m        depends deepseq-1.5.0.0-7e72
[2m[unordered-containers] [m        depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[unordered-containers] [m        depends template-haskell-2.22.0.0-af3f
[2m[unordered-containers] [m    definite unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
[2m[unordered-containers] [m        depends ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
[2m[unordered-containers] [m        depends HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
[2m[unordered-containers] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[unordered-containers] [m        depends base-4.20.2.0-acb8
[2m[unordered-containers] [m        depends containers-0.7-a3f6
[2m[unordered-containers] [m        depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[unordered-containers] [m        depends nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
[2m[unordered-containers] [m        depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
[2m[unordered-containers] [m        depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
[2m[unordered-containers] [m        depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
[2m[unordered-containers] [m        depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
[2m[unordered-containers] [m        depends unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[unordered-containers] [mUsing compiler: ghc-9.10.3
[2m[unordered-containers] [mUsing install prefix:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
[2m[unordered-containers] [mExecutables installed in:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/bin
[2m[unordered-containers] [mLibraries installed in:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [mDynamic Libraries installed in:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[unordered-containers] [mPrivate executables installed in:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1
[2m[unordered-containers] [mData files installed in:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1
[2m[unordered-containers] [mDocumentation installed in:
[2m[unordered-containers] [m/nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
[2m[unordered-containers] [mConfiguration files installed in:
[2m[unordered-containers] [m/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/etc
[2m[unordered-containers] [mNo alex found
[2m[unordered-containers] [mUsing ar found on system at:
[2m[unordered-containers] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[unordered-containers] [mUsing ghc version 9.10.3 found on system at:
[2m[unordered-containers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[unordered-containers] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[unordered-containers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[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.31.1 found on system at:
[2m[unordered-containers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[unordered-containers] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[unordered-containers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[unordered-containers] [mUsing hscolour version 1.25 found on system at:
[2m[unordered-containers] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[unordered-containers] [mNo pkg-config found
[2m[unordered-containers] [mUsing runghc version 9.10.3 found on system at:
[2m[unordered-containers] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[unordered-containers] [mUsing strip version 2.44 found on system at:
[2m[unordered-containers] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[unordered-containers] [mUsing tar found on system at:
[2m[unordered-containers] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-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.1...
[2m[unordered-containers] [mBuilding library for unordered-containers-0.2.20.1...
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-53692\GHC-53692]8;;\] [[;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
[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[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-66111\GHC-66111]8;;\] [[;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
[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[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-53692\GHC-53692]8;;\] [[;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
[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[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-66111\GHC-66111]8;;\] [[;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
[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.1...
[2m[unordered-containers] [mBuilding test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
[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[;1mtests/Regressions.hs:93:16: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[unordered-containers] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[0m[0m
[2m[unordered-containers] [m[;1m[34m   |[0m[0m
[2m[unordered-containers] [m[;1m[34m93 |[0m[0m       k      = [;1m[35mhead[0m[0m keys
[2m[unordered-containers] [m[;1m[34m   |[0m[0m[;1m[35m                ^^^^[0m[0m
[2m[unordered-containers] [m
[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[;1mtests/Strictness.hs:7:1: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-66111\GHC-66111]8;;\] [[;1m[35m-Wunused-imports[0m[0m[;1m][0m[0m[;1m
[2m[unordered-containers] [m    The import of ‘Data.Foldable’ is redundant
[2m[unordered-containers] [m      except perhaps to import instances from ‘Data.Foldable’
[2m[unordered-containers] [m    To import instances alone, use: import Data.Foldable()[0m[0m
[2m[unordered-containers] [m[;1m[34m  |[0m[0m
[2m[unordered-containers] [m[;1m[34m7 |[0m[0m [;1m[35mimport Data.Foldable                (foldl')[0m[0m
[2m[unordered-containers] [m[;1m[34m  |[0m[0m[;1m[35m ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^[0m[0m
[2m[unordered-containers] [m
[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 1 minutes 37 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.16s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          /=:                              OK (0.04s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Ord
[2m[unordered-containers] [m          compare reflexive:               OK (0.15s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare transitive:              OK (0.12s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare antisymmetric:           OK (0.11s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          Ord => Eq:                       OK (0.11s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Read/Show:                         OK (0.62s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Functor:                           OK (0.29s)
[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        Bifoldable
[2m[unordered-containers] [m          bifoldMap:                       OK (0.07s)
[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.12s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Hashable:                          OK (0.11s)
[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 (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      size:                                OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member:                              OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      lookup:                              OK (0.19s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      !?:                                  OK
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert
[2m[unordered-containers] [m        model:                             OK (0.06s)
[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      insertWith
[2m[unordered-containers] [m        insertWith:                        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      delete
[2m[unordered-containers] [m        model:                             OK (0.08s)
[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      adjust
[2m[unordered-containers] [m        model:                             OK (0.01s)
[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      update
[2m[unordered-containers] [m        model:                             OK (0.13s)
[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.02s)
[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      alterF
[2m[unordered-containers] [m        model
[2m[unordered-containers] [m          []:                              OK (0.24s)
[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.12s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insertWith:                      OK (0.12s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          delete:                          OK (0.04s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          lookup:                          OK (0.10s)
[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      isSubmapOf
[2m[unordered-containers] [m        model:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m ⊆ m:                             OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ⊆ m1 ∪ m2:                      OK (0.08s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1\m2 ⊆ m1:                        OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK (0.07s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 196 discarded.
[2m[unordered-containers] [m        delete k m ⊆ m:                    OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 13 discarded.
[2m[unordered-containers] [m        m ⊈ delete k m :                   OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 13 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  m ⊆ insert k v m:        OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 14 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  insert k v m ⊈ m:        OK (0.05s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 17 discarded.
[2m[unordered-containers] [m      union
[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      unionWith
[2m[unordered-containers] [m        model:                             OK (0.17s)
[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.24s)
[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      unions
[2m[unordered-containers] [m        model:                             OK (2.43s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (1.30s)
[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.22s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      differenceWith
[2m[unordered-containers] [m        model:                             OK (0.13s)
[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      intersection
[2m[unordered-containers] [m        model:                             OK (0.07s)
[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      intersectionWith
[2m[unordered-containers] [m        model:                             OK (0.19s)
[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      intersectionWithKey
[2m[unordered-containers] [m        model:                             OK (0.22s)
[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      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.31s)
[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      traverseWithKey
[2m[unordered-containers] [m        model:                             OK (0.30s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapKeys
[2m[unordered-containers] [m        model:                             OK (0.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (1.44s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr:                               OK (0.12s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl:                               OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey:                        OK (0.07s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey:                        OK (0.11s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey':                       OK (0.08s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey':                       OK (0.11s)
[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.17s)
[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.16s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.22s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filterWithKey
[2m[unordered-containers] [m        model:                             OK (5.24s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (3.62s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybe
[2m[unordered-containers] [m        model:                             OK (0.31s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.16s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybeWithKey
[2m[unordered-containers] [m        model:                             OK (5.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (3.26s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      elems:                               OK (0.06s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      keys:                                OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromList
[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      fromListWith
[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      fromListWithKey
[2m[unordered-containers] [m        model:                             OK (0.05s)
[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      toList:                              OK (0.04s)
[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.08s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          /=:                              OK (0.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Ord
[2m[unordered-containers] [m          compare reflexive:               OK (0.04s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare transitive:              OK (0.06s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare antisymmetric:           OK (0.04s)
[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 (1.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Functor:                           OK (0.27s)
[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.07s)
[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.06s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Hashable:                          OK (0.10s)
[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.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member:                              OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      lookup:                              OK (0.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      !?:                                  OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert
[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      insertWith
[2m[unordered-containers] [m        insertWith:                        OK (0.03s)
[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.05s)
[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.10s)
[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      update
[2m[unordered-containers] [m        model:                             OK (0.04s)
[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      alter
[2m[unordered-containers] [m        model:                             OK (0.05s)
[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      alterF
[2m[unordered-containers] [m        model
[2m[unordered-containers] [m          []:                              OK (0.60s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          adjust:                          OK (0.05s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insert:                          OK (0.09s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          insertWith:                      OK (0.08s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          delete:                          OK (0.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          lookup:                          OK (0.09s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.16s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      isSubmapOf
[2m[unordered-containers] [m        model:                             OK (0.03s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m ⊆ m:                             OK
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ⊆ m1 ∪ m2:                      OK (0.15s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1\m2 ⊆ m1:                        OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK (0.14s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 128 discarded.
[2m[unordered-containers] [m        delete k m ⊆ m:                    OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 19 discarded.
[2m[unordered-containers] [m        m ⊈ delete k m :                   OK
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 14 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  m ⊆ insert k v m:        OK (0.02s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 12 discarded.
[2m[unordered-containers] [m        k ∉ m  ⇒  insert k v m ⊈ m:        OK (0.18s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests; 6 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.12s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unionWith
[2m[unordered-containers] [m        model:                             OK (0.23s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.29s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unionWithKey
[2m[unordered-containers] [m        model:                             OK (0.39s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.19s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      unions
[2m[unordered-containers] [m        model:                             OK (3.74s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (2.17s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      difference
[2m[unordered-containers] [m        model:                             OK (0.09s)
[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      differenceWith
[2m[unordered-containers] [m        model:                             OK (0.25s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.18s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersection
[2m[unordered-containers] [m        model:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.13s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersectionWith
[2m[unordered-containers] [m        model:                             OK (0.30s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.23s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      intersectionWithKey
[2m[unordered-containers] [m        model:                             OK (0.46s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.30s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      compose
[2m[unordered-containers] [m        valid:                             OK (0.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      map
[2m[unordered-containers] [m        model:                             OK (0.38s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.25s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      traverseWithKey
[2m[unordered-containers] [m        model:                             OK (0.77s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.18s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapKeys
[2m[unordered-containers] [m        model:                             OK (0.12s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (2.10s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr:                               OK (0.11s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl:                               OK (0.07s)
[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.06s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldrWithKey':                       OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldlWithKey':                       OK (0.06s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldl':                              OK (0.14s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      foldr':                              OK (0.08s)
[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.37s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.35s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filterWithKey
[2m[unordered-containers] [m        model:                             OK (4.15s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (3.23s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybe
[2m[unordered-containers] [m        model:                             OK (0.43s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.26s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      mapMaybeWithKey
[2m[unordered-containers] [m        model:                             OK (4.46s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (3.27s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      elems:                               OK (0.14s)
[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.10s)
[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      fromListWith
[2m[unordered-containers] [m        model:                             OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromListWithKey
[2m[unordered-containers] [m        model:                             OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        valid:                             OK (0.20s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      toList:                              OK (0.06s)
[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.06s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          == permutations:                 OK (0.12s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          /=:                              OK (0.10s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Ord
[2m[unordered-containers] [m          compare reflexive:               OK (0.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m          compare transitive:              OK (0.16s)
[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.07s)
[2m[unordered-containers] [m            +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Read/Show:                         OK (1.33s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Foldable:                          OK (0.11s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        Hashable:                          OK (0.15s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m      size:                                OK (0.07s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      member:                              OK (0.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert:                              OK (0.12s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      delete:                              OK (0.20s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      union:                               OK (0.12s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      map:                                 OK (3.18s)
[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 (0.09s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      filter:                              OK (3.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      toList:                              OK (0.27s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m    Data.HashMap.Internal.List
[2m[unordered-containers] [m      isPermutationBy:                     OK (0.20s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      isPermutationBy of different length: OK (0.05s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests; 19 discarded.
[2m[unordered-containers] [m      pUnorderedCompare:                   OK (0.25s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      modelUnorderedCompare
[2m[unordered-containers] [m        reflexive:                         OK (0.01s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        anti-symmetric:                    OK (0.06s)
[2m[unordered-containers] [m          +++ OK, passed 100 tests.
[2m[unordered-containers] [m        transitive:                        OK (0.10s)
[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.08s)
[2m[unordered-containers] [m      +++ OK, passed 100 tests.
[2m[unordered-containers] [m    issue254 lazy:                         OK (0.14s)
[2m[unordered-containers] [m    issue254 strict:                       OK (0.03s)
[2m[unordered-containers] [m    issue379
[2m[unordered-containers] [m      Lazy.unionWith:                      OK (0.02s)
[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 (0.02s)
[2m[unordered-containers] [m    issue383:                              OK
[2m[unordered-containers] [m    issue420:                              OK
[2m[unordered-containers] [m    issue491
[2m[unordered-containers] [m      1:                                   OK
[2m[unordered-containers] [m      2:                                   OK
[2m[unordered-containers] [m      3:                                   OK
[2m[unordered-containers] [m  Strictness
[2m[unordered-containers] [m    HashMap.Strict
[2m[unordered-containers] [m      singleton is key-strict:             OK (0.01s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      singleton is value-strict:           OK (0.02s)
[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
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      adjust is key-strict:                OK (0.02s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      adjust is value-strict:              OK (0.09s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert is key-strict:                OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insert is value-strict:              OK (0.03s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insertWith is key-strict:            OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      insertWith is value-strict:          OK (0.12s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m      fromList is key-strict:              OK (0.04s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[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.08s)
[2m[unordered-containers] [m        +++ OK, passed 100 tests.
[2m[unordered-containers] [m
[2m[unordered-containers] [mAll 257 tests passed (6.46s)
[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.1-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.1...
[2m[unordered-containers] [mRunning Haddock on library for unordered-containers-0.2.20.1...
[2m[unordered-containers] [m[;1mData/HashMap/Internal.hs:12:14-23: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-53692\GHC-53692]8;;\] [[;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
[2m[unordered-containers] [m[1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
[2m[unordered-containers] [m[;1mData/HashMap/Internal/Array.hs:83:1-35: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-66111\GHC-66111]8;;\] [[;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
[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: 'Leaf' is ambiguous. It is defined
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:227:7
[2m[unordered-containers] [m    * at Data/HashMap/Internal.hs:187: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:187: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] [m  88% ( 93 /105) in 'Data.HashMap.Internal'
[2m[unordered-containers] [m  Missing documentation for:
[2m[unordered-containers] [m    Leaf (Data/HashMap/Internal.hs:187)
[2m[unordered-containers] [m    intersectionWithKey# (Data/HashMap/Internal.hs:1859)
[2m[unordered-containers] [m    updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
[2m[unordered-containers] [m    equalKeys (Data/HashMap/Internal.hs:513)
[2m[unordered-containers] [m    equalKeys1 (Data/HashMap/Internal.hs:497)
[2m[unordered-containers] [m    lookupRecordCollision (Data/HashMap/Internal.hs:680)
[2m[unordered-containers] [m    LookupRes (Data/HashMap/Internal.hs:659)
[2m[unordered-containers] [m    lookupResToMaybe (Data/HashMap/Internal.hs:662)
[2m[unordered-containers] [m    insert' (Data/HashMap/Internal.hs:808)
[2m[unordered-containers] [m    delete' (Data/HashMap/Internal.hs:1126)
[2m[unordered-containers] [m    insertNewKey (Data/HashMap/Internal.hs:850)
[2m[unordered-containers] [m    insertKeyExists (Data/HashMap/Internal.hs:885)
[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: 'lookup' is out of scope.
[2m[unordered-containers] [m    If you qualify the identifier, haddock can try to link it anyway.
[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] [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] [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] [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.1...
[2m[unordered-containers] [m[1;36mPhase: installPhase[m
[2m[unordered-containers] [mInstalling library in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[unordered-containers] [m[1;36mPhase: fixupPhase[m
[2m[unordered-containers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
[2m[unordered-containers] [mshrinking /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSunordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf-ghc9.10.3.so
[2m[unordered-containers] [mchecking for references to /build/ in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1...
[2m[unordered-containers] [mpatching script interpreter paths in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
[2m[unordered-containers] [mstripping (with command strip and flags -S -p) in  /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib
[2m[unordered-containers] [mshrinking RPATHs of ELF executables and libraries in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc
[2m[unordered-containers] [mchecking for references to /build/ in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc...
[2m[unordered-containers] [mpatching script interpreter paths in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 11 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding quickcheck-instances[m
[2m[quickcheck-instances] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[quickcheck-instances] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[quickcheck-instances] [m[1;36mPhase: unpackPhase[m
[2m[quickcheck-instances] [munpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
[2m[quickcheck-instances] [msource root is quickcheck-instances-0.3.33
[2m[quickcheck-instances] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/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.33/revision/1.cabal.
[2m[quickcheck-instances] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[quickcheck-instances] [msetupCompileFlags: -package-db=/build/tmp.Stu7nxCuAS/setup-package.conf.d -threaded
[2m[quickcheck-instances] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.Stu7nxCuAS/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/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.Stu7nxCuAS/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
[2m[quickcheck-instances] [mUsing Parsec parser
[2m[quickcheck-instances] [mConfiguring quickcheck-instances-0.3.33...
[2m[quickcheck-instances] [mDependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
[2m[quickcheck-instances] [mDependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
[2m[quickcheck-instances] [mDependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
[2m[quickcheck-instances] [mDependency base >=4.12.0.0 && <4.22: using base-4.20.2.0
[2m[quickcheck-instances] [mDependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
[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.7
[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.5.0.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.3.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.9
[2m[quickcheck-instances] [mDependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.3
[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.8
[2m[quickcheck-instances] [mDependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
[2m[quickcheck-instances] [mDependency unordered-containers >=0.2.20 && <0.3: using
[2m[quickcheck-instances] [munordered-containers-0.2.20.1
[2m[quickcheck-instances] [mDependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
[2m[quickcheck-instances] [mDependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
[2m[quickcheck-instances] [mDependency QuickCheck: using QuickCheck-2.15.0.1
[2m[quickcheck-instances] [mDependency base: using base-4.20.2.0
[2m[quickcheck-instances] [mDependency containers: using containers-0.7
[2m[quickcheck-instances] [mDependency primitive: using primitive-0.9.1.0
[2m[quickcheck-instances] [mDependency quickcheck-instances: using quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mDependency tagged: using tagged-0.8.9
[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.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m        include OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
[2m[quickcheck-instances] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[quickcheck-instances] [m        include array-0.5.8.0-78a1
[2m[quickcheck-instances] [m        include base-4.20.2.0-acb8
[2m[quickcheck-instances] [m        include bytestring-0.12.2.0-04d5
[2m[quickcheck-instances] [m        include case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
[2m[quickcheck-instances] [m        include containers-0.7-a3f6
[2m[quickcheck-instances] [m        include data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
[2m[quickcheck-instances] [m        include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[quickcheck-instances] [m        include integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
[2m[quickcheck-instances] [m        include old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[quickcheck-instances] [m        include scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
[2m[quickcheck-instances] [m        include splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
[2m[quickcheck-instances] [m        include strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
[2m[quickcheck-instances] [m        include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
[2m[quickcheck-instances] [m        include text-2.1.3-e138
[2m[quickcheck-instances] [m        include text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
[2m[quickcheck-instances] [m        include these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
[2m[quickcheck-instances] [m        include time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
[2m[quickcheck-instances] [m        include transformers-0.6.1.1-74e0
[2m[quickcheck-instances] [m        include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
[2m[quickcheck-instances] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[quickcheck-instances] [m    component quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
[2m[quickcheck-instances] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[quickcheck-instances] [m        include base-4.20.2.0-acb8
[2m[quickcheck-instances] [m        include containers-0.7-a3f6
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[quickcheck-instances] [m        include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m        include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
[2m[quickcheck-instances] [mLinked component graph:
[2m[quickcheck-instances] [m    unit quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m        include OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
[2m[quickcheck-instances] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[quickcheck-instances] [m        include array-0.5.8.0-78a1
[2m[quickcheck-instances] [m        include base-4.20.2.0-acb8
[2m[quickcheck-instances] [m        include bytestring-0.12.2.0-04d5
[2m[quickcheck-instances] [m        include case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
[2m[quickcheck-instances] [m        include containers-0.7-a3f6
[2m[quickcheck-instances] [m        include data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
[2m[quickcheck-instances] [m        include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[quickcheck-instances] [m        include integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
[2m[quickcheck-instances] [m        include old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[quickcheck-instances] [m        include scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
[2m[quickcheck-instances] [m        include splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
[2m[quickcheck-instances] [m        include strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
[2m[quickcheck-instances] [m        include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
[2m[quickcheck-instances] [m        include text-2.1.3-e138
[2m[quickcheck-instances] [m        include text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
[2m[quickcheck-instances] [m        include these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
[2m[quickcheck-instances] [m        include time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
[2m[quickcheck-instances] [m        include transformers-0.6.1.1-74e0
[2m[quickcheck-instances] [m        include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
[2m[quickcheck-instances] [m        include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[quickcheck-instances] [m        Test.QuickCheck.Instances=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Void
[2m[quickcheck-instances] [m    unit quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
[2m[quickcheck-instances] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[quickcheck-instances] [m        include base-4.20.2.0-acb8
[2m[quickcheck-instances] [m        include containers-0.7-a3f6
[2m[quickcheck-instances] [m        include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[quickcheck-instances] [m        include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m        include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
[2m[quickcheck-instances] [m        include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
[2m[quickcheck-instances] [mReady component graph:
[2m[quickcheck-instances] [m    definite quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m        depends OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
[2m[quickcheck-instances] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[quickcheck-instances] [m        depends array-0.5.8.0-78a1
[2m[quickcheck-instances] [m        depends base-4.20.2.0-acb8
[2m[quickcheck-instances] [m        depends bytestring-0.12.2.0-04d5
[2m[quickcheck-instances] [m        depends case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
[2m[quickcheck-instances] [m        depends containers-0.7-a3f6
[2m[quickcheck-instances] [m        depends data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
[2m[quickcheck-instances] [m        depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
[2m[quickcheck-instances] [m        depends integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
[2m[quickcheck-instances] [m        depends old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
[2m[quickcheck-instances] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[quickcheck-instances] [m        depends scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
[2m[quickcheck-instances] [m        depends splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
[2m[quickcheck-instances] [m        depends strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
[2m[quickcheck-instances] [m        depends tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
[2m[quickcheck-instances] [m        depends text-2.1.3-e138
[2m[quickcheck-instances] [m        depends text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
[2m[quickcheck-instances] [m        depends these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
[2m[quickcheck-instances] [m        depends time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
[2m[quickcheck-instances] [m        depends transformers-0.6.1.1-74e0
[2m[quickcheck-instances] [m        depends unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
[2m[quickcheck-instances] [m        depends uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
[2m[quickcheck-instances] [m        depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
[2m[quickcheck-instances] [m    definite quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
[2m[quickcheck-instances] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[quickcheck-instances] [m        depends base-4.20.2.0-acb8
[2m[quickcheck-instances] [m        depends containers-0.7-a3f6
[2m[quickcheck-instances] [m        depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
[2m[quickcheck-instances] [m        depends quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m        depends tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
[2m[quickcheck-instances] [m        depends uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
[2m[quickcheck-instances] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[quickcheck-instances] [mUsing compiler: ghc-9.10.3
[2m[quickcheck-instances] [mUsing install prefix:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mExecutables installed in:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/bin
[2m[quickcheck-instances] [mLibraries installed in:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [mDynamic Libraries installed in:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[quickcheck-instances] [mPrivate executables installed in:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mData files installed in:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mDocumentation installed in:
[2m[quickcheck-instances] [m/nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mConfiguration files installed in:
[2m[quickcheck-instances] [m/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/etc
[2m[quickcheck-instances] [mNo alex found
[2m[quickcheck-instances] [mUsing ar found on system at:
[2m[quickcheck-instances] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[quickcheck-instances] [mUsing ghc version 9.10.3 found on system at:
[2m[quickcheck-instances] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[quickcheck-instances] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[quickcheck-instances] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[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.31.1 found on system at:
[2m[quickcheck-instances] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[quickcheck-instances] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[quickcheck-instances] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[quickcheck-instances] [mUsing hscolour version 1.25 found on system at:
[2m[quickcheck-instances] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[quickcheck-instances] [mNo pkg-config found
[2m[quickcheck-instances] [mUsing runghc version 9.10.3 found on system at:
[2m[quickcheck-instances] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[quickcheck-instances] [mUsing strip version 2.44 found on system at:
[2m[quickcheck-instances] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[quickcheck-instances] [mUsing tar found on system at:
[2m[quickcheck-instances] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-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.33...
[2m[quickcheck-instances] [mBuilding library for quickcheck-instances-0.3.33...
[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.33...
[2m[quickcheck-instances] [mBuilding test suite 'self-test' for quickcheck-instances-0.3.33...
[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.33-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.33...
[2m[quickcheck-instances] [mRunning Haddock on library for quickcheck-instances-0.3.33...
[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] [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] [m	- Data.Vector.Strict.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.33...
[2m[quickcheck-instances] [m[1;36mPhase: installPhase[m
[2m[quickcheck-instances] [mInstalling library in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[quickcheck-instances] [m[1;36mPhase: fixupPhase[m
[2m[quickcheck-instances] [mshrinking RPATHs of ELF executables and libraries in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mshrinking /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSquickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH-ghc9.10.3.so
[2m[quickcheck-instances] [mchecking for references to /build/ in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33...
[2m[quickcheck-instances] [mpatching script interpreter paths in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
[2m[quickcheck-instances] [mstripping (with command strip and flags -S -p) in  /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib
[2m[quickcheck-instances] [mshrinking RPATHs of ELF executables and libraries in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
[2m[quickcheck-instances] [mchecking for references to /build/ in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc...
[2m[quickcheck-instances] [mpatching script interpreter paths in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 12 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding extra[m
[2m[extra] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[extra] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[extra] [m[1;36mPhase: unpackPhase[m
[2m[extra] [munpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
[2m[extra] [msource root is extra-1.8.1
[2m[extra] [msetting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
[2m[extra] [m[1;36mPhase: patchPhase[m
[2m[extra] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[extra] [msetupCompileFlags: -package-db=/build/tmp.w0rxG4a3Pr/setup-package.conf.d -threaded
[2m[extra] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.w0rxG4a3Pr/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/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.w0rxG4a3Pr/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
[2m[extra] [mUsing Parsec parser
[2m[extra] [mConfiguring extra-1.8.1...
[2m[extra] [mDependency base >=4.9 && <5: using base-4.20.2.0
[2m[extra] [mDependency clock >=0.7: using clock-0.8.4
[2m[extra] [mDependency directory: using directory-1.3.8.5
[2m[extra] [mDependency filepath: using filepath-1.5.4.0
[2m[extra] [mDependency process: using process-1.6.26.1
[2m[extra] [mDependency time: using time-1.12.2
[2m[extra] [mDependency unix: using unix-2.8.7.0
[2m[extra] [mDependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
[2m[extra] [mDependency base >=4 && <5: using base-4.20.2.0
[2m[extra] [mDependency directory: using directory-1.3.8.5
[2m[extra] [mDependency extra: using extra-1.8.1
[2m[extra] [mDependency filepath: using filepath-1.5.4.0
[2m[extra] [mDependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
[2m[extra] [mDependency unix: using unix-2.8.7.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.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m        include base-4.20.2.0-acb8
[2m[extra] [m        include clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
[2m[extra] [m        include directory-1.3.8.5-e377
[2m[extra] [m        include filepath-1.5.4.0-c4eb
[2m[extra] [m        include process-1.6.26.1-c5d9
[2m[extra] [m        include time-1.12.2-befd
[2m[extra] [m        include unix-2.8.7.0-61f9
[2m[extra] [m    component extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
[2m[extra] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[extra] [m        include base-4.20.2.0-acb8
[2m[extra] [m        include directory-1.3.8.5-e377
[2m[extra] [m        include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m        include filepath-1.5.4.0-c4eb
[2m[extra] [m        include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[extra] [m        include unix-2.8.7.0-61f9
[2m[extra] [mLinked component graph:
[2m[extra] [m    unit extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m        include base-4.20.2.0-acb8
[2m[extra] [m        include clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
[2m[extra] [m        include directory-1.3.8.5-e377
[2m[extra] [m        include filepath-1.5.4.0-c4eb
[2m[extra] [m        include process-1.6.26.1-c5d9
[2m[extra] [m        include time-1.12.2-befd
[2m[extra] [m        include unix-2.8.7.0-61f9
[2m[extra] [m        Control.Concurrent.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Version.Extra,Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Extra,Numeric.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Numeric.Extra,System.Directory.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Environment.Extra,System.IO.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.IO.Extra,System.Info.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Info.Extra,System.Process.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Process.Extra,System.Time.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Time.Extra,Text.Read.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Text.Read.Extra
[2m[extra] [m    unit extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
[2m[extra] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[extra] [m        include base-4.20.2.0-acb8
[2m[extra] [m        include directory-1.3.8.5-e377
[2m[extra] [m        include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m        include filepath-1.5.4.0-c4eb
[2m[extra] [m        include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[extra] [m        include unix-2.8.7.0-61f9
[2m[extra] [mReady component graph:
[2m[extra] [m    definite extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m        depends base-4.20.2.0-acb8
[2m[extra] [m        depends clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
[2m[extra] [m        depends directory-1.3.8.5-e377
[2m[extra] [m        depends filepath-1.5.4.0-c4eb
[2m[extra] [m        depends process-1.6.26.1-c5d9
[2m[extra] [m        depends time-1.12.2-befd
[2m[extra] [m        depends unix-2.8.7.0-61f9
[2m[extra] [m    definite extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
[2m[extra] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[extra] [m        depends base-4.20.2.0-acb8
[2m[extra] [m        depends directory-1.3.8.5-e377
[2m[extra] [m        depends extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m        depends filepath-1.5.4.0-c4eb
[2m[extra] [m        depends quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
[2m[extra] [m        depends unix-2.8.7.0-61f9
[2m[extra] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[extra] [mUsing compiler: ghc-9.10.3
[2m[extra] [mUsing install prefix: /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
[2m[extra] [mExecutables installed in:
[2m[extra] [m/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/bin
[2m[extra] [mLibraries installed in:
[2m[extra] [m/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [mDynamic Libraries installed in:
[2m[extra] [m/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[extra] [mPrivate executables installed in:
[2m[extra] [m/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1
[2m[extra] [mData files installed in:
[2m[extra] [m/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/share/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1
[2m[extra] [mDocumentation installed in:
[2m[extra] [m/nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc/share/doc/extra-1.8.1
[2m[extra] [mConfiguration files installed in:
[2m[extra] [m/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/etc
[2m[extra] [mNo alex found
[2m[extra] [mUsing ar found on system at:
[2m[extra] [m/nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[extra] [mUsing ghc version 9.10.3 found on system at:
[2m[extra] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[extra] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[extra] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[2m[extra] [mNo ghcjs found
[2m[extra] [mNo ghcjs-pkg found
[2m[extra] [mNo greencard found
[2m[extra] [mUsing haddock version 2.31.1 found on system at:
[2m[extra] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[extra] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[extra] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[extra] [mUsing hscolour version 1.25 found on system at:
[2m[extra] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
[2m[extra] [mNo jhc found
[2m[extra] [mUsing ld found on system at:
[2m[extra] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[extra] [mNo pkg-config found
[2m[extra] [mUsing runghc version 9.10.3 found on system at:
[2m[extra] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[extra] [mUsing strip version 2.44 found on system at:
[2m[extra] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[extra] [mUsing tar found on system at:
[2m[extra] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
[2m[extra] [mNo uhc found
[2m[extra] [m[1;36mPhase: buildPhase[m
[2m[extra] [mPreprocessing library for extra-1.8.1...
[2m[extra] [mBuilding library for extra-1.8.1...
[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.8.1...
[2m[extra] [mBuilding test suite 'extra-test' for extra-1.8.1...
[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 100 tests.
[2m[extra] [mcaptureOutput
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mstringException ("test" ++ undefined)            == pure "test<Exception>"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstringException ['t','e','s','t',undefined]      == pure "test<Exception>"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mignore (print 1)    == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mignore (fail "die") == pure ()
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcatch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mseq (errorIO "foo") (print 1) == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcatch (assertIO True  >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mseq (assertIO False) (print 1) == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mretry 1 (print "x")  == print "x"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mretry 3 (fail "die") == fail "die"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenJust Nothing  print == pure ()
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenJust (Just 1) print == print 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @Maybe True  5 == Just 5
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @Maybe False 5 == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @[]    True  5 == [5]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpureIf @[]    False 5 == []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenMaybe True  (print 1) == fmap Just (print 1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwhenMaybe False (print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\(x :: Maybe ()) -> unit x == x
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguarded even 2 == [2]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguarded odd 2 == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguarded (not.null) "My Name" == Just "My Name"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguardedA (return . even) 42    == Just [42]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguardedA (return . odd) 42     == Just []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mguardedA (const Nothing) 42    == (Nothing :: Maybe [Int])
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfold1M (\x y -> Just x) [] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpartitionM (Just . even) [1,2,3] == Just ([2], [1,3])
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mpartitionM (const Nothing) [1,2,3] == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mloop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust True  ||^ undefined  == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust False ||^ Just True  == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust False ||^ Just False == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust False &&^ undefined  == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust True  &&^ Just True  == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mJust True  &&^ Just False == Just False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manyM Just [False,True ,undefined] == Just True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manyM Just [False,False,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mallM Just [True,True ,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [morM [Just False,Just False,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mandM [Just True,Just True ,undefined] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mfindM (Just . isUpper) "test"             == Just Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfindM (Just . const True) ["x",undefined] == Just (Just "x")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromLeft 1 (Left 3) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromLeft 1 (Right "foo") == 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromRight 1 (Right 3) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfromRight 1 (Left "foo") == 1
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mmapLeft show (Right True) == Right True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapRight show (Left 1) == Left 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmapRight show (Right True) == Right "True"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mdisjoint [1,2,3] [4,1] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrd [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrd [1,2,3] [4,1] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdisjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame [1,1,2] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame [1,2,3] == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame (1:2:1:undefined) == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [manySame [] == False
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mallSame [1,1,1] == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame [1]     == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame []      == True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mallSame (1:1:2:undefined) == False
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mheadDef 1 [2,3,4] == 2
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mlastDef 1 [2,3,4] == 4
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [m[2,3,4] !? (-1) == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m[]      !? 0    == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnotNull []  == False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnotNull [1] == True
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mlist 1 (\v _ -> v - 2) []      == 1
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [munsnoc ""     == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[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 100 tests.
[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 100 tests.
[2m[extra] [mtakeEnd 3 "hello"  == "llo"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeEnd 5 "bye"    == "bye"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeEnd (-1) "bye" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mdropEnd 5 "bye"    == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd (-1) "bye" == "bye"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [msplitAtEnd 3 "he"    == ("", "he")
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[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 100 tests.
[2m[extra] [mconcatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtakeWhileEnd even [2,3,4,6] == [4,6]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtrim      "  hello   " == "hello"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtrimStart "  hello   " == "hello   "
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtrimEnd   "  hello   " == "  hello"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mlower "" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mupper "This is A TEST" == "THIS IS A TEST"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mupper "" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mword1 "" == ("", "")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mword1 "keyword rest of string" == ("keyword","rest of string")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mword1 "  keyword\n  rest of string" == ("keyword","rest of string")
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mline1 "test" == ("test","")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test\n" == ("test","")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test\nrest" == ("test","rest")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mline1 "test\nrest\nmore" == ("test","rest\nmore")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeHTML "this is a test" == "this is a test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeHTML "t'was another test" == "t&#39;was another test"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mescapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mescapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mgroupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmaximumOn id [] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmaximumOn length ["test","extra","a"] == "extra"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mminimumOn id [] == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mminimumOn length ["test","extra","a"] == "a"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mgroupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mgroupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msum' [1, 2, 3] == 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msumOn' read ["1", "2", "3"] == 6
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mproduct' [1, 2, 4] == 8
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mproductOn' read ["1", "2", "4"] == 8
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmerge "ace" "bd" == "abcde"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mreplace "el" "e" "Hello"       == "Helo"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "" "x" "Hello"         == "xHxexlxlxox"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mreplace "" "x" ""              == "x"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mbreakEnd isLower "youre" == ("youre","")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbreakEnd isLower "YOURE" == ("","YOURE")
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mspanEnd (not . isSpace) "x y z" == ("x y ","z")
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[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 100 tests.
[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 100 tests.
[2m[extra] [mfirstJust id [Nothing,Just 3]  == Just 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirstJust id [Nothing,Nothing] == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdrop1 ""         == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdrop1 "test"     == "est"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\xs -> drop 1 xs == drop1 xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd1 ""         == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropEnd1 "test"     == "tes"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[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 100 tests.
[2m[extra] [mbreakOn "/" "foobar"   == ("foobar", "")
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [msplitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "aaa"  "aaaXaaaXaaaXaaa"  == ["","X","X","X",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "x"    "x"                == ["",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplitOn "x"    ""                 == [""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m\s x -> s /= "" ==> intercalate s (splitOn s x) == x
[2m[extra] [m+++ OK, passed 100 tests; 13 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 100 tests.
[2m[extra] [msplit (== 'a') ""        == [""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msplit (== ',') "my,list,here" == ["my","list","here"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropWhileEnd  isSpace "ab cde  " == "ab cde"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropWhileEnd' isSpace "ab cde  " == "ab cde"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlast (dropWhileEnd  even [undefined,3]) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlast (dropWhileEnd' even [undefined,3]) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mhead (dropWhileEnd  even (3:undefined)) == 3
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mhead (dropWhileEnd' even (3:undefined)) == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropPrefix "Mr. " "Mr. Men" == "Men"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropPrefix "Mr. " "Dr. Men" == "Dr. Men"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropSuffix "!" "Hello World!"  == "Hello World"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropSuffix "!" "Hello World!!" == "Hello World!"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdropSuffix "!" "Hello World."  == "Hello World."
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripSuffix "bar" "foobar" == Just "foo"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripSuffix ""    "baz"    == Just "baz"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripSuffix "foo" "quux"   == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripInfix "::" "a::b::c" == Just ("a", "b::c")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripInfix "/" "foobar"   == Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mstripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 3 "my test" == ["my ","tes","t"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 3 "mytest"  == ["myt","est"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 8 ""        == []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mchunksOf 0 "test"    == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubSort "this is a test" == " aehist"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mnubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrd "this is a test" == "this ae"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mnubOrd (take 4 ("this" ++ undefined)) == "this"
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mnubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mzipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength [1,2,3] [False] == GT
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mcomparingLength [1,2] "ab" == EQ
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mcomparingLength (1:2:3:undefined) [1,2] == GT
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmwhen True  "test" == "test"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mmwhen False "test" == ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirst succ (1,"test") == (2,"test")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msecond reverse (1,"test") == (1,"tset")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msecondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(succ *** reverse) (1,"test") == (2,"tset")
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(succ &&& pred) 1 == (2,0)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdupe 12 == (12, 12)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mboth succ (1,2) == (2,3)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfirst3 succ (1,1,1) == (2,1,1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [msecond3 succ (1,1,1) == (1,2,1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mthird3 succ (1,1,1) == (1,1,2)
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mshowDP 4 pi == "3.1416"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDP 0 pi == "3"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDP 2 3  == "3.00"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mlistTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mlistTest (listFilesInside $ const $ pure False) ["bar.txt"] []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [misWindows == (os == "mingw32")
[2m[extra] [m+++ OK, passed 100 tests.
[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 100 tests.
[2m[extra] [mwithTempFile doesFileExist == pure True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(doesFileExist =<< withTempFile pure) == pure False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile readFile' == pure ""
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir doesDirectoryExist == pure True
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [m(doesDirectoryExist =<< withTempDir pure) == pure False
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempDir listFiles == pure []
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfileEq "does_not_exist1" "does_not_exist2" == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfileEq "does_not_exist" "does_not_exist" == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mfmap (round . fst) (duration $ sleep 1) == pure 1
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtimeout (-3) (print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtimeout 0.1  (print 1) == fmap Just (print 1)
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdo (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
[2m[extra] [m0.102222407
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mtimeout 0.1  (sleep 2 >> print 1) == pure Nothing
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 3.435   == "3.44s"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 623.8   == "10m24s"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 62003.8 == "17h13m"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mshowDuration 1e8     == "27777h47m"
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdo f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mdo (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mExtra export
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mwithTempFile
[2m[extra] [m....done
[2m[extra] [mwithTempDir
[2m[extra] [m....done
[2m[extra] [mretry
[2m[extra] [m+++ OK, passed 100 tests.
[2m[extra] [mbarrier
[2m[extra] [mSuccess (325 tests)
[2m[extra] [mTest suite extra-test: PASS
[2m[extra] [mTest suite logged to: dist/test/extra-1.8.1-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.8.1...
[2m[extra] [mRunning Haddock on library for extra-1.8.1...
[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] [mWarning: 'Arrow' is out of scope.
[2m[extra] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[extra] [m 100% ( 22 / 22) 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 ‘GHC.Internal.Data.Functor’
[2m[extra] [m    * in ‘GHC.Internal.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.Internal.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 ‘GHC.Internal.Data.Version’
[2m[extra] [m    * in ‘GHC.Internal.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 ‘GHC.Internal.Data.Version’
[2m[extra] [m 100% (  3 /  3) in 'Data.Version.Extra'
[2m[extra] [mWarning: 'length' is ambiguous. It is defined
[2m[extra] [m    * in ‘Data.List.NonEmpty’
[2m[extra] [m    * in ‘GHC.Internal.Data.Foldable’
[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.Internal.Data.Foldable’
[2m[extra] [m 100% ( 23 / 23) 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.Internal.Exception’
[2m[extra] [m    * in ‘GHC.Internal.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.Internal.Exception’
[2m[extra] [mWarning: 'AssertionFailed' is ambiguous. It is defined
[2m[extra] [m    * in ‘GHC.Internal.IO.Exception’
[2m[extra] [m    * in ‘GHC.Internal.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.Internal.IO.Exception’
[2m[extra] [mWarning: 'SomeException' is ambiguous. It is defined
[2m[extra] [m    * in ‘GHC.Internal.Exception.Type’
[2m[extra] [m    * in ‘GHC.Internal.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.Internal.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% ( 40 / 40) in 'Control.Monad.Extra'
[2m[extra] [m  92% ( 13 / 14) 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] [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% (270 /270) in 'Extra'
[2m[extra] [m 100% (  2 /  2) in 'Text.Read.Extra'
[2m[extra] [mDocumentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
[2m[extra] [mPreprocessing test suite 'extra-test' for extra-1.8.1...
[2m[extra] [m[1;36mPhase: installPhase[m
[2m[extra] [mInstalling library in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[extra] [m[1;36mPhase: fixupPhase[m
[2m[extra] [mshrinking RPATHs of ELF executables and libraries in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
[2m[extra] [mshrinking /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSextra-1.8.1-6dBP7svJ0dU8qAqNvDulTp-ghc9.10.3.so
[2m[extra] [mchecking for references to /build/ in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1...
[2m[extra] [mpatching script interpreter paths in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
[2m[extra] [mstripping (with command strip and flags -S -p) in  /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib
[2m[extra] [mshrinking RPATHs of ELF executables and libraries in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
[2m[extra] [mchecking for references to /build/ in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc...
[2m[extra] [mpatching script interpreter paths in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 13 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding algebraic-graphs[m
[2m[algebraic-graphs] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[algebraic-graphs] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[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] [mapplying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
[2m[algebraic-graphs] [mpatching file algebraic-graphs.cabal
[2m[algebraic-graphs] [m[1;36mPhase: compileBuildDriverPhase[m
[2m[algebraic-graphs] [msetupCompileFlags: -package-db=/build/tmp.Vq4dS5nPZ3/setup-package.conf.d -threaded
[2m[algebraic-graphs] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.Vq4dS5nPZ3/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/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.Vq4dS5nPZ3/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/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.8.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.20.2.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.7
[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.1
[2m[algebraic-graphs] [mDependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
[2m[algebraic-graphs] [mDependency algebraic-graphs: using algebraic-graphs-0.7
[2m[algebraic-graphs] [mDependency array >=0.4 && <0.6: using array-0.5.8.0
[2m[algebraic-graphs] [mDependency base >=4.11 && <5: using base-4.20.2.0
[2m[algebraic-graphs] [mDependency containers >=0.5.5.1 && <0.8: using containers-0.7
[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.8.1
[2m[algebraic-graphs] [mDependency inspection-testing >=0.4.2.2 && <0.7: using
[2m[algebraic-graphs] [minspection-testing-0.6.2
[2m[algebraic-graphs] [mDependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
[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-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m        include array-0.5.8.0-78a1
[2m[algebraic-graphs] [m        include base-4.20.2.0-acb8
[2m[algebraic-graphs] [m        include containers-0.7-a3f6
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-7e72
[2m[algebraic-graphs] [m        include transformers-0.6.1.1-74e0
[2m[algebraic-graphs] [m    component algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
[2m[algebraic-graphs] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[algebraic-graphs] [m        include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m        include array-0.5.8.0-78a1
[2m[algebraic-graphs] [m        include base-4.20.2.0-acb8
[2m[algebraic-graphs] [m        include containers-0.7-a3f6
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-7e72
[2m[algebraic-graphs] [m        include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[algebraic-graphs] [m        include inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
[2m[algebraic-graphs] [m        include transformers-0.6.1.1-74e0
[2m[algebraic-graphs] [mLinked component graph:
[2m[algebraic-graphs] [m    unit algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m        include array-0.5.8.0-78a1
[2m[algebraic-graphs] [m        include base-4.20.2.0-acb8
[2m[algebraic-graphs] [m        include containers-0.7-a3f6
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-7e72
[2m[algebraic-graphs] [m        include transformers-0.6.1.1-74e0
[2m[algebraic-graphs] [m        Algebra.Graph=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Data.Graph.Typed
[2m[algebraic-graphs] [m    unit algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
[2m[algebraic-graphs] [m        include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[algebraic-graphs] [m        include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m        include array-0.5.8.0-78a1
[2m[algebraic-graphs] [m        include base-4.20.2.0-acb8
[2m[algebraic-graphs] [m        include containers-0.7-a3f6
[2m[algebraic-graphs] [m        include deepseq-1.5.0.0-7e72
[2m[algebraic-graphs] [m        include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[algebraic-graphs] [m        include inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
[2m[algebraic-graphs] [m        include transformers-0.6.1.1-74e0
[2m[algebraic-graphs] [mReady component graph:
[2m[algebraic-graphs] [m    definite algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m        depends array-0.5.8.0-78a1
[2m[algebraic-graphs] [m        depends base-4.20.2.0-acb8
[2m[algebraic-graphs] [m        depends containers-0.7-a3f6
[2m[algebraic-graphs] [m        depends deepseq-1.5.0.0-7e72
[2m[algebraic-graphs] [m        depends transformers-0.6.1.1-74e0
[2m[algebraic-graphs] [m    definite algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
[2m[algebraic-graphs] [m        depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
[2m[algebraic-graphs] [m        depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m        depends array-0.5.8.0-78a1
[2m[algebraic-graphs] [m        depends base-4.20.2.0-acb8
[2m[algebraic-graphs] [m        depends containers-0.7-a3f6
[2m[algebraic-graphs] [m        depends deepseq-1.5.0.0-7e72
[2m[algebraic-graphs] [m        depends extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
[2m[algebraic-graphs] [m        depends inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
[2m[algebraic-graphs] [m        depends transformers-0.6.1.1-74e0
[2m[algebraic-graphs] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[algebraic-graphs] [mUsing compiler: ghc-9.10.3
[2m[algebraic-graphs] [mUsing install prefix:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
[2m[algebraic-graphs] [mExecutables installed in:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/bin
[2m[algebraic-graphs] [mLibraries installed in:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [mDynamic Libraries installed in:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[algebraic-graphs] [mPrivate executables installed in:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7
[2m[algebraic-graphs] [mData files installed in:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7
[2m[algebraic-graphs] [mDocumentation installed in:
[2m[algebraic-graphs] [m/nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
[2m[algebraic-graphs] [mConfiguration files installed in:
[2m[algebraic-graphs] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-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/rinxh4y0akcin90l05j0zr1r3wahl34d-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[algebraic-graphs] [mUsing ghc version 9.10.3 found on system at:
[2m[algebraic-graphs] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[algebraic-graphs] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[algebraic-graphs] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[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.31.1 found on system at:
[2m[algebraic-graphs] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[algebraic-graphs] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[algebraic-graphs] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[algebraic-graphs] [mUsing hscolour version 1.25 found on system at:
[2m[algebraic-graphs] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[algebraic-graphs] [mNo pkg-config found
[2m[algebraic-graphs] [mUsing runghc version 9.10.3 found on system at:
[2m[algebraic-graphs] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[algebraic-graphs] [mUsing strip version 2.44 found on system at:
[2m[algebraic-graphs] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[algebraic-graphs] [mUsing tar found on system at:
[2m[algebraic-graphs] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-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[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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 1 minutes 6 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 4 minutes 23 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] [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[;1msrc/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.List):
[2m[algebraic-graphs] [m    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."[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: []8;;https://errors.haskell.org/messages/GHC-63394\GHC-63394]8;;\] [[;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.Internal.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 'GHC.Internal.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
[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[;1msrc/Algebra/Graph/ToGraph.hs:171:32: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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[;1msrc/Algebra/Graph/Export.hs:185:41: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[2m[algebraic-graphs] [m[22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
[2m[algebraic-graphs] [m[;1msrc/Algebra/Graph/Export/Dot.hs:121:63: [;1m[35mwarning[0m[0m[;1m: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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: []8;;https://errors.haskell.org/messages/GHC-58520\GHC-58520]8;;\] [[;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
[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] [m 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
[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] [m 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
[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: 'sort' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[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    You may be able to disambiguate the identifier by qualifying it or
[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: 'IsList' 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% ( 19 / 19) in 'Algebra.Graph.Internal'
[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    * 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:316:1
[2m[algebraic-graphs] [m 100% ( 61 / 61) in 'Algebra.Graph'
[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: 'vertexCount' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'hasVertex' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexSet' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'isEmpty' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edgeList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'box' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edgeCount' 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% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[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: '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: 'swap' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
[2m[algebraic-graphs] [m    * in ‘GHC.Internal.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] [m 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
[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: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250: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/Bipartite/AdjacencyMap.hs:250: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: 'isEmpty' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'empty' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'vertexList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'edges' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'adjacencyList' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[2m[algebraic-graphs] [mWarning: 'stars' 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% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
[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: 'sort' is out of scope.
[2m[algebraic-graphs] [m    If you qualify the identifier, haddock can try to link it anyway.
[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: '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] [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: '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    You may be able to disambiguate the identifier by qualifying it or
[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    You may be able to disambiguate the identifier by qualifying it or
[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: '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    You may be able to disambiguate the identifier by qualifying it or
[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/Acyclic/AdjacencyMap.hs:258: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: '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] [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] [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: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation.hs:243: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/Relation.hs:243:1
[2m[algebraic-graphs] [mWarning: 'AdjacencyMap' 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% ( 56 / 56) in 'Algebra.Graph.Relation'
[2m[algebraic-graphs] [mWarning: 'vertexCount' is ambiguous. It is defined
[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    You may be able to disambiguate the identifier by qualifying it or
[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:372:1
[2m[algebraic-graphs] [mWarning: 'edgeCount' is ambiguous. It is defined
[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    You may be able to disambiguate the identifier by qualifying it or
[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:384:1
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Relation/Symmetric.hs:188: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/Relation/Symmetric.hs:188:1
[2m[algebraic-graphs] [m 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
[2m[algebraic-graphs] [mWarning: 'vertexList' 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% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
[2m[algebraic-graphs] [mWarning: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
[2m[algebraic-graphs] [m    * in ‘Data.Map.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: '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    You may be able to disambiguate the identifier by qualifying it or
[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:379: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: 'empty' is ambiguous. It is defined
[2m[algebraic-graphs] [m    * at src/Algebra/Graph/Labelled.hs:191: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/Labelled.hs:191: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: '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: 'empty' is ambiguous. It is defined
[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] [m 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
[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: 'Transitive' 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% (  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: 'Reflexive' 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% (  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: 'Preorder' 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% (  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] [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] [mWarning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Rep_Graph
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for: 
[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.NonEmpty.AdjacencyMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
[2m[algebraic-graphs] [mWarning: Algebra.Graph.Labelled: could not find link destinations for: 
[2m[algebraic-graphs] [m	- Algebra.Graph.Labelled.Rep_Graph
[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] [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/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graphs] [m[1;36mPhase: fixupPhase[m
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
[2m[algebraic-graphs] [mshrinking /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSalgebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW-ghc9.10.3.so
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
[2m[algebraic-graphs] [mstripping (with command strip and flags -S -p) in  /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib
[2m[algebraic-graphs] [mshrinking RPATHs of ELF executables and libraries in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
[2m[algebraic-graphs] [mchecking for references to /build/ in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc...
[2m[algebraic-graphs] [mpatching script interpreter paths in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 1 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 14 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding algebraic-graph-duoids[m
[2m[algebraic-graph-duoids] [m[1;36mPhase: setupCompilerEnvironmentPhase[m
[2m[algebraic-graph-duoids] [mBuild with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
[2m[algebraic-graph-duoids] [m[1;36mPhase: unpackPhase[m
[2m[algebraic-graph-duoids] [munpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-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.vpwI7S5bEi/setup-package.conf.d -threaded
[2m[algebraic-graph-duoids] [m[1 of 2] Compiling Main             ( Setup.hs, /build/tmp.vpwI7S5bEi/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/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.vpwI7S5bEi/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/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/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: lint=False, noisy-deprecations=True
[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 || >=4.22.0 && <4.23: using base-4.20.2.0
[2m[algebraic-graph-duoids] [mDependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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 || >=4.22.0 && <4.23: using base-4.20.2.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 ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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 || >=4.22.0 && <4.23: using base-4.20.2.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.24.2
[2m[algebraic-graph-duoids] [mDependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
[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-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graph-duoids] [m        include base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[algebraic-graph-duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m    component algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        include base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[algebraic-graph-duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m    component algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graph-duoids] [m        include base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[algebraic-graph-duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[algebraic-graph-duoids] [mLinked component graph:
[2m[algebraic-graph-duoids] [m    unit algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graph-duoids] [m        include base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[algebraic-graph-duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m        Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI:Algebra.Graph.Duoid.Orphans
[2m[algebraic-graph-duoids] [m    unit algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        include base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[algebraic-graph-duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m    unit algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
[2m[algebraic-graph-duoids] [m        include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graph-duoids] [m        include base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[algebraic-graph-duoids] [m        include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m        include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[algebraic-graph-duoids] [mReady component graph:
[2m[algebraic-graph-duoids] [m    definite algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graph-duoids] [m        depends base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
[2m[algebraic-graph-duoids] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m    definite algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
[2m[algebraic-graph-duoids] [m        depends algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
[2m[algebraic-graph-duoids] [m        depends base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
[2m[algebraic-graph-duoids] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [m        depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
[2m[algebraic-graph-duoids] [m    definite algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
[2m[algebraic-graph-duoids] [m        depends algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m        depends base-4.20.2.0-acb8
[2m[algebraic-graph-duoids] [m        depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
[2m[algebraic-graph-duoids] [m        depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
[2m[algebraic-graph-duoids] [mUsing Cabal-3.12.1.0 compiled by ghc-9.10
[2m[algebraic-graph-duoids] [mUsing compiler: ghc-9.10.3
[2m[algebraic-graph-duoids] [mUsing install prefix:
[2m[algebraic-graph-duoids] [m/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mExecutables installed in:
[2m[algebraic-graph-duoids] [m/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/bin
[2m[algebraic-graph-duoids] [mLibraries installed in:
[2m[algebraic-graph-duoids] [m/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [mDynamic Libraries installed in:
[2m[algebraic-graph-duoids] [m/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
[2m[algebraic-graph-duoids] [mPrivate executables installed in:
[2m[algebraic-graph-duoids] [m/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mData files installed in:
[2m[algebraic-graph-duoids] [m/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mDocumentation installed in:
[2m[algebraic-graph-duoids] [m/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-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/iwgl4r59m0qyijlcvw3arlhnak5s49hi-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/rinxh4y0akcin90l05j0zr1r3wahl34d-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.24.2 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
[2m[algebraic-graph-duoids] [mUsing gcc version 14.3.0 given by user at:
[2m[algebraic-graph-duoids] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
[2m[algebraic-graph-duoids] [mUsing ghc version 9.10.3 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
[2m[algebraic-graph-duoids] [mUsing ghc-pkg version 9.10.3 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
[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.31.1 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
[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/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
[2m[algebraic-graph-duoids] [mUsing hsc2hs version 0.68.10 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
[2m[algebraic-graph-duoids] [mUsing hscolour version 1.25 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-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/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
[2m[algebraic-graph-duoids] [mNo pkg-config found
[2m[algebraic-graph-duoids] [mUsing runghc version 9.10.3 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
[2m[algebraic-graph-duoids] [mUsing strip version 2.44 found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
[2m[algebraic-graph-duoids] [mUsing tar found on system at:
[2m[algebraic-graph-duoids] [m/nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-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 '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] [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] [m[1;36mPhase: checkPhase[m
[2m[algebraic-graph-duoids] [mRunning 2 test suites...
[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] [mTest suite doctests: RUNNING...
[2m[algebraic-graph-duoids] [mExamples: 0  Tried: 0  Errors: 0  Failures: 0
[2m[algebraic-graph-duoids] [mNameLib Nothing
[2m[algebraic-graph-duoids] [m----------------------------------------
[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] [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 100% (  5 /  5) in 'Algebra.Graph.Duoid'
[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 'laws' for algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mPreprocessing test suite 'doctests' 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/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
[2m[algebraic-graph-duoids] [m[1;36mPhase: fixupPhase[m
[2m[algebraic-graph-duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mshrinking /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSalgebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI-ghc9.10.3.so
[2m[algebraic-graph-duoids] [mchecking for references to /build/ in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0...
[2m[algebraic-graph-duoids] [mpatching script interpreter paths in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
[2m[algebraic-graph-duoids] [mstripping (with command strip and flags -S -p) in  /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib
[2m[algebraic-graph-duoids] [mshrinking RPATHs of ELF executables and libraries in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc
[2m[algebraic-graph-duoids] [mchecking for references to /build/ in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc...
[2m[algebraic-graph-duoids] [mpatching script interpreter paths in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 2 paths...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mcopying path '/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 15 of 19 built, 193 of 193 downloaded from cache[m
[1;34mBuilding ghc-9.10.3-with-packages[m
[2m[ghc-9.10.3-with-packages] [m/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/q9bmv83s4921kh6z965q0v2glgm742gx-ghc-compat-plugin-0.1.0.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/q9bmv83s4921kh6z965q0v2glgm742gx-ghc-compat-plugin-0.1.0.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/6s0czylb98l3w1dfdbw1lz6d0xz5dik2-hedgehog-1.5/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/6s0czylb98l3w1dfdbw1lz6d0xz5dik2-hedgehog-1.5/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/yv1515y35b5d87px2xnywdrzl57bzj36-ansi-terminal-1.1.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/yv1515y35b5d87px2xnywdrzl57bzj36-ansi-terminal-1.1.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/sjm0zblwxqfdk46ck7qrjg10f19k2b3q-async-2.2.5/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/sjm0zblwxqfdk46ck7qrjg10f19k2b3q-async-2.2.5/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/mrh8y1rc5sfl36wh0q014barx02dk48a-barbies-2.1.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/mrh8y1rc5sfl36wh0q014barx02dk48a-barbies-2.1.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/nwqnn7mc9y6m6qhlf4b04dm8b694ihir-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/nwqnn7mc9y6m6qhlf4b04dm8b694ihir-concurrent-output-1.10.21/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/c0kvhsdh044cby9s385kdp6fzrwnx0b2-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/c0kvhsdh044cby9s385kdp6fzrwnx0b2-lifted-async-0.10.2.7/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/88zzrq6z3q2i7raa4bqrfzp2xm1spfzs-mmorph-1.2.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/88zzrq6z3q2i7raa4bqrfzp2xm1spfzs-mmorph-1.2.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/g2qvb2hxv61dkd7kcwl314bfkn49w353-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/g2qvb2hxv61dkd7kcwl314bfkn49w353-monad-control-1.0.3.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/6cndgccwks6pzgpp40sd3yqj1gwrwcpc-pretty-show-1.10/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/6cndgccwks6pzgpp40sd3yqj1gwrwcpc-pretty-show-1.10/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/cbkpv0a2jd34ji7dmwlcs5079p09clw9-primitive-0.9.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/cbkpv0a2jd34ji7dmwlcs5079p09clw9-primitive-0.9.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/8l34z8pqyxz1a375p2mjy2x9pl7qwv9j-random-1.2.1.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/8l34z8pqyxz1a375p2mjy2x9pl7qwv9j-random-1.2.1.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/h9ngfa8xz6vn23w9hbg6hfcciqp1618a-resourcet-1.3.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/h9ngfa8xz6vn23w9hbg6hfcciqp1618a-resourcet-1.3.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/7vn9fv3b7f0ajmhrb61h3cnsym1y3n3f-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/7vn9fv3b7f0ajmhrb61h3cnsym1y3n3f-safe-exceptions-0.1.7.4/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/na9f6zzz8s1k6g1id7dcffl0gi7r7cjj-transformers-base-0.4.6/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/na9f6zzz8s1k6g1id7dcffl0gi7r7cjj-transformers-base-0.4.6/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/25k1v3pwwy7x5gym9q9dhviv0csxvvmn-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/25k1v3pwwy7x5gym9q9dhviv0csxvvmn-wl-pprint-annotated-0.1.0.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/8gj8b8i9s12rdfbqmdph9s03wnpqh44d-ansi-terminal-types-1.1.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/8gj8b8i9s12rdfbqmdph9s03wnpqh44d-ansi-terminal-types-1.1.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/m2gbv27qwdgpizs36ysfzkc543z73msp-hashable-1.5.0.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/m2gbv27qwdgpizs36ysfzkc543z73msp-hashable-1.5.0.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/k735nrbnq1v6hqj9l4aqf84zvqnc17fb-distributive-0.6.2.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/k735nrbnq1v6hqj9l4aqf84zvqnc17fb-distributive-0.6.2.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/qlaran7276vq5yfddk8gjyb0bbl7463d-constraints-0.14.2/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/qlaran7276vq5yfddk8gjyb0bbl7463d-constraints-0.14.2/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/anslqcpw3nb5ij1vvfxxqb4m5q9x9jkp-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/anslqcpw3nb5ij1vvfxxqb4m5q9x9jkp-lifted-base-0.2.3.12/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/yf7r6nnmfc4mwj08iavfcxpp70mj6mkq-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/yf7r6nnmfc4mwj08iavfcxpp70mj6mkq-transformers-compat-0.7.2/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/v6jdycf0p0gypqgg67hc7k45i6p25cwj-splitmix-0.1.3.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/v6jdycf0p0gypqgg67hc7k45i6p25cwj-splitmix-0.1.3.1/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/3d0qs4aijgblg7mvsxzr2b168hmncirn-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/3d0qs4aijgblg7mvsxzr2b168hmncirn-unliftio-core-0.2.1.0/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/kspxaj152b3jyd5yfwmkb8fi5l571rms-base-orphans-0.9.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/kspxaj152b3jyd5yfwmkb8fi5l571rms-base-orphans-0.9.3/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/c1ickhy1b9cnskfyjr6bhh9xbczy60w0-tagged-0.8.9/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/c1ickhy1b9cnskfyjr6bhh9xbczy60w0-tagged-0.8.9/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/rwvnxl3wi6qdd2mffsl3rymh0infb7nh-boring-0.2.2/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [m/nix/store/rwvnxl3wi6qdd2mffsl3rymh0infb7nh-boring-0.2.2/nix-support:
[2m[ghc-9.10.3-with-packages] [mpropagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
[2m[ghc-9.10.3-with-packages] [mWarning: include-dirs: /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages/lib/ghc-9.10.3/lib/../lib/x86_64-linux-ghc-9.10.3/directory-1.3.8.5-e377/include doesn't exist or isn't a directory
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 16 of 18 built, 193 of 193 downloaded from cache[m
[1;34mBuilding all-packages[m
[2m[all-packages] [mcreated 3 symlinks in user environment
[2m[post-build-hook] [m[2mUploading to cachix cache "sellout": /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages[m
[2m[post-build-hook] [m[2mNothing to push - all store paths are already on Cachix.[m
[2m[post-build-hook] [m[2mUploading to the NixCI cache: /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2m[post-build-hook] [m[2mwarning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead[m
[2m[post-build-hook] [m[2mcopying 0 paths...[m
[2mProgress: 17 of 18 built, 193 of 193 downloaded from cache[m